| Proofs of useful work M Ball, A Rosen, M Sabin, PN Vasudevan Cryptology ePrint Archive, 2017 | 139 | 2017 |
| 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 | 81 | 2016 |
| 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 | 71 | 2017 |
| 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 | 58 | 2018 |
| 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 | 56 | 2016 |
| Garbled neural networks are practical M Ball, B Carmer, T Malkin, M Rosulek, N Schimanski Cryptology ePrint Archive, 2019 | 52 | 2019 |
| 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 | 41 | 2018 |
| Non-malleable codes from average-case hardness:, decision trees, and streaming space-bounded tampering M Ball, D Dachman-Soled, M Kulkarni, T Malkin Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 39 | 2018 |
| 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 | 24 | 2019 |
| Non-malleable codes for decision trees M Ball, S Guo, D Wichs Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019 | 21 | 2019 |
| 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 | 12 | 2020 |
| Exploring the boundaries of topology-hiding computation M Ball, E Boyle, T Malkin, T Moran Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 12 | 2018 |
| Limits to non-malleability M Ball, D Dachman-Soled, M Kulkarni, T Malkin Cryptology ePrint Archive, 2019 | 9 | 2019 |
| New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust M Ball, D Dachman-Soled, M Kulkarni Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020 | 8* | 2020 |
| 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 | 7 | 2019 |
| Cryptography from information loss M Ball, E Boyle, A Degwekar, A Deshpande, A Rosen, V Vaikuntanathan, ... Cryptology ePrint Archive, 2020 | 6 | 2020 |
| Randomness extraction from somewhat dependent sources M Ball, O Goldreich, T Malkin 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022 | 5 | 2022 |
| Towards optical proof of work M Dubrovsky, M Ball, L Kiffer, B Penkovsky Cryptoeconomic Systems 11, 2020 | 5 | 2020 |
| 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 | 5 | 2020 |
| 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 | 4 | 2023 |
Tal MalkinProfessor of Computer Science, Columbia UniversityVerified email at columbia.edu
