Marshall Ball
Marshall Ball
Verified email at cs.columbia.edu - Homepage
Title
Cited by
Cited by
Year
Proofs of Useful Work.
M Ball, A Rosen, M Sabin, PN Vasudevan
IACR Cryptol. ePrint Arch. 2017, 203, 2017
752017
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
452017
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
442016
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
392016
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
302018
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
242018
Proofs of work from worst-case assumptions
M Ball, A Rosen, M Sabin, PN Vasudevan
Annual International Cryptology Conference, 789-819, 2018
202018
Garbled Neural Networks are Practical.
M Ball, B Carmer, T Malkin, M Rosulek, N Schimanski
IACR Cryptol. ePrint Arch. 2019, 338, 2019
142019
Non-malleable codes for decision trees
M Ball, S Guo, D Wichs
Annual International Cryptology Conference, 413-434, 2019
122019
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
122019
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
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
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
22020
Limits to Non-Malleability
M Ball, D Dachman-Soled, M Kulkarni, T Malkin
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
22020
Non-Malleability against Polynomial Tampering.
M Ball, E Chattopadhyay, JJ Liao, T Malkin, LY Tan
Electronic Colloquium on Computational Complexity (ECCC) 27, 23, 2020
12020
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
12020
Optical Proof of Work
M Dubrovsky, M Ball, B Penkovsky
arXiv preprint arXiv:1911.05193, 2019
12019
Communication Complexity with Defective Randomness.
M Ball, O Goldreich, T Malkin
Electronic Colloquium on Computational Complexity (ECCC) 27, 54, 2020
2020
Randomness Extraction from Somewhat Dependent Sources.
M Ball, O Goldreich, T Malkin
Electronic Colloquium on Computational Complexity (ECCC) 26, 183, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20