Marshall Ball
Marshall Ball
University of Washington
Bestätigte E-Mail-Adresse bei cs.columbia.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Proofs of Useful Work.
M Ball, A Rosen, M Sabin, PN Vasudevan
IACR Cryptol. ePrint Arch. 2017, 203, 2017
892017
Average-case fine-grained hardness
M Ball, A Rosen, M Sabin, PN Vasudevan
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
522017
Non-malleable codes for bounded depth, bounded fan-in circuits
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Annual International Conference on the Theory and Applications of …, 2016
452016
Garbling gadgets for boolean and arithmetic circuits
M Ball, T Malkin, M Rosulek
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
412016
Non-malleable Codes from Average-Case Hardness: , Decision Trees, and Streaming Space-Bounded Tampering
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Annual International Conference on the Theory and Applications of …, 2018
312018
Non-malleable codes for small-depth circuits
M Ball, D Dachman-Soled, S Guo, T Malkin, LY Tan
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
262018
Proofs of work from worst-case assumptions
M Ball, A Rosen, M Sabin, PN Vasudevan
Annual International Cryptology Conference, 789-819, 2018
242018
Garbled Neural Networks are Practical.
M Ball, B Carmer, T Malkin, M Rosulek, N Schimanski
IACR Cryptol. ePrint Arch. 2019, 338, 2019
192019
Non-malleable codes for decision trees
M Ball, S Guo, D Wichs
Annual International Cryptology Conference, 413-434, 2019
132019
Non-malleable codes against bounded polynomial time tampering
M Ball, D Dachman-Soled, M Kulkarni, H Lin, T Malkin
Annual International Conference on the Theory and Applications of …, 2019
132019
Exploring the boundaries of topology-hiding computation
M Ball, E Boyle, T Malkin, T Moran
Annual International Conference on the Theory and Applications of …, 2018
82018
Cryptography from information loss
M Ball, E Boyle, A Degwekar, A Deshpande, A Rosen, V Vaikuntanathan, ...
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
32020
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?
M Ball, J Holmgren, Y Ishai, T Liu, T Malkin
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
32020
Limits to non-malleability
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
32020
Is Information-Theoretic Topology-Hiding Computation Possible?
M Ball, E Boyle, R Cohen, T Malkin, T Moran
Theory of Cryptography Conference, 502-530, 2019
32019
New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
M Ball, D Dachman-Soled, M Kulkarni
Annual International Cryptology Conference, 674-703, 2020
2*2020
Non-malleability against polynomial tampering
M Ball, E Chattopadhyay, JJ Liao, T Malkin, LY Tan
Annual International Cryptology Conference, 97-126, 2020
22020
Randomness Extraction from Somewhat Dependent Sources.
M Ball, O Goldreich, T Malkin
Electronic Colloquium on Computational Complexity (ECCC) 26, 183, 2019
12019
Optical proof of work
M Dubrovsky, M Ball, B Penkovsky
arXiv preprint arXiv:1911.05193, 2019
12019
Topology-Hiding Communication from Minimal Assumptions
M Ball, E Boyle, R Cohen, L Kohl, T Malkin, P Meyer, T Moran
Theory of Cryptography Conference, 473-501, 2020
2020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20