Follow
Marshall Ball
Marshall Ball
Verified email at cs.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
1232017
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
722016
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
622017
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
592016
Proofs of work from worst-case assumptions
M Ball, A Rosen, M Sabin, PN Vasudevan
Annual International Cryptology Conference, 789-819, 2018
482018
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 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
402018
Garbled neural networks are practical
M Ball, B Carmer, T Malkin, M Rosulek, N Schimanski
Cryptology ePrint Archive, 2019
372019
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
242019
Non-malleable codes for decision trees
M Ball, S Guo, D Wichs
Annual International Cryptology Conference, 413-434, 2019
212019
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
112020
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
112018
Limits to non-malleability
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
Cryptology ePrint Archive, 2019
92019
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
8*2020
Non-malleability against polynomial tampering
M Ball, E Chattopadhyay, JJ Liao, T Malkin, LY Tan
Annual International Cryptology Conference, 97-126, 2020
52020
Is Information-Theoretic Topology-Hiding Computation Possible?
M Ball, E Boyle, R Cohen, T Malkin, T Moran
Theory of Cryptography Conference, 502-530, 2019
52019
Randomness extraction from somewhat dependent sources
M Ball, O Goldreich, T Malkin
13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022
42022
Towards Optical Proof of Work
M Dubrovsky, M Ball, L Kiffer, B Penkovsky
Cryptoeconomic Systems 11, 2020
42020
Cryptography from information loss
M Ball, E Boyle, A Degwekar, A Deshpande, A Rosen, V Vaikuntanathan, ...
Cryptology ePrint Archive, 2020
42020
Optical proof of work
M Dubrovsky, M Ball, B Penkovsky
arXiv preprint arXiv:1911.05193, 2019
42019
The system can't perform the operation now. Try again later.
Articles 1–20