Follow
Marshall Ball
Marshall Ball
Verified email at nyu.edu - Homepage
Title
Cited by
Cited by
Year
Proofs of useful work
M Ball, A Rosen, M Sabin, PN Vasudevan
Cryptology ePrint Archive, 2017
1632017
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
942016
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
802017
Proofs of work from worst-case assumptions
M Ball, A Rosen, M Sabin, PN Vasudevan
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
662018
Garbled neural networks are practical
M Ball, B Carmer, T Malkin, M Rosulek, N Schimanski
Cryptology ePrint Archive, 2019
592019
Non-malleable codes for bounded depth, bounded fan-in circuits
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
572016
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
432018
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
422018
Non-malleable codes against bounded polynomial time tampering
M Ball, D Dachman-Soled, M Kulkarni, H Lin, T Malkin
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
262019
Non-malleable codes for decision trees
M Ball, S Guo, D Wichs
Annual International Cryptology Conference, 413-434, 2019
232019
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
162020
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
132018
Experimental evaluation of digitally verifiable photonic computing for blockchain and cryptocurrency
S Pai, T Park, M Ball, B Penkovsky, M Dubrovsky, N Abebe, ...
Optica 10 (5), 552-560, 2023
122023
Randomness extraction from somewhat dependent sources
M Ball, O Goldreich, T Malkin
13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022
102022
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
9*2020
Limits to non-malleability
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Cryptology ePrint Archive, 2019
92019
Is information-theoretic topology-hiding computation possible?
M Ball, E Boyle, R Cohen, T Malkin, T Moran
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
82019
Towards optical proof of work
M Dubrovsky, M Ball, L Kiffer, B Penkovsky
Cryptoeconomic Systems 11, 2020
72020
Non-malleability against polynomial tampering
M Ball, E Chattopadhyay, JJ Liao, T Malkin, LY Tan
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
72020
Optical proof of work
M Dubrovsky, M Ball, B Penkovsky
arXiv preprint arXiv:1911.05193, 2019
62019
The system can't perform the operation now. Try again later.
Articles 1–20