Marshall Ball

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 68

Top Topics

Redescription Mining

Kolmogorov Complexity

Underlying Assumptions

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Publications

Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos
Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. CRYPTO (2) (2024)
Marshall Ball, Ronen Shaltiel, Jad Silbak
Non-malleable Codes with Optimal Rate for Poly-Size Circuits. EUROCRYPT (4) (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. IACR Cryptol. ePrint Arch. 2024 (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Electron. Colloquium Comput. Complex. (2024)
Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos
Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. IACR Cryptol. ePrint Arch. 2024 (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. FOCS (2023)
Marshall Ball, Ronen Shaltiel, Jad Silbak
Non-malleable codes with optimal rate for poly-size circuits. Electron. Colloquium Comput. Complex. (2023)
Marshall Ball, Yevgeniy Dodis, Eli Goldin
Immunizing Backdoored PRGs. TCC (3) (2023)
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36 (4) (2023)
Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer
Towards Topology-Hiding Computation from Oblivious Transfer. IACR Cryptol. ePrint Arch. 2023 (2023)
Marshall Ball, Hanjun Li, Huijia Lin, Tianren Liu
New Ways to Garble Arithmetic Circuits. EUROCRYPT (2) (2023)
Marshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi Mutreja
Extracting Randomness from Samplable Distributions, Revisited. FOCS (2023)
Marshall Ball, Dana Dachman-Soled
(Inefficient Prover) ZAPs from Hard-to-Invert Functions. Electron. Colloquium Comput. Complex. (2023)
Marshall Ball, Hanjun Li, Huijia Lin, Tianren Liu
New Ways to Garble Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2023 (2023)
Marshall Ball, Dana Dachman-Soled, Eli Goldin, Saachi Mutreja
Extracting Randomness from Samplable Distributions, Revisited. Electron. Colloquium Comput. Complex. (2023)
Marshall Ball, Yevgeniy Dodis, Eli Goldin
Immunizing Backdoored PRGs. IACR Cryptol. ePrint Arch. 2023 (2023)
Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer
Towards Topology-Hiding Computation from Oblivious Transfer. TCC (1) (2023)
Marshall Ball, Tim Randolph
A Note on the Complexity of Private Simultaneous Messages with Many Parties. ITC (2022)
Marshall Ball, Dana Dachman-Soled, Julian Loss
(Nondeterministic) Hardness vs. Non-Malleability. Electron. Colloquium Comput. Complex. 29 (2022)
Divesh Aggarwal, Marshall Ball, Maciej Obremski
Survey: Non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2022 (2022)
Marshall Ball, Dana Dachman-Soled, Julian Loss
(Nondeterministic) Hardness vs. Non-malleability. CRYPTO (1) (2022)
Divesh Aggarwal, Marshall Ball, Maciej Obremski
Non-Malleable Code in the Split-State Model. Entropy 24 (8) (2022)
Marshall Ball, Dana Dachman-Soled, Julian Loss
(Nondeterministic) Hardness vs. Non-Malleability. IACR Cryptol. ePrint Arch. 2022 (2022)
Sunil Pai, Taewon Park, Marshall Ball, Bogdan Penkovsky, Maziyar Milanizadeh, Michael Dubrovsky, Nathnael Abebe, Francesco Morichetti, Andrea Melloni, Shanhui Fan, Olav Solgaard, David A. B. Miller
Experimental evaluation of digitally-verifiable photonic computing for blockchain and cryptocurrency. CoRR (2022)
Marshall Ball, Oded Goldreich, Tal Malkin
Randomness Extraction from Somewhat Dependent Sources. ITCS (2022)
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
Topology-Hiding Communication from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2021 (2021)
Marshall Ball, Alper Çakan, Tal Malkin
Linear Threshold Secret-Sharing with Binary Reconstruction. Electron. Colloquium Comput. Complex. 28 (2021)
Marshall Ball, Oded Goldreich, Tal Malkin
Communication Complexity with Defective Randomness. Computational Complexity Conference (2021)
Marshall Ball, Alper Çakan, Tal Malkin
Linear Threshold Secret-Sharing with Binary Reconstruction. ITC (2021)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-Malleability against Polynomial Tampering. Electron. Colloquium Comput. Complex. 27 (2020)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-Malleability against Polynomial Tampering. IACR Cryptol. ePrint Arch. 2020 (2020)
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Cryptography from Information Loss. IACR Cryptol. ePrint Arch. 2020 (2020)
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Cryptography from Information Loss. ITCS (2020)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Limits to Non-Malleability. ITCS (2020)
Marshall Ball, Oded Goldreich, Tal Malkin
Communication Complexity with Defective Randomness. Electron. Colloquium Comput. Complex. 27 (2020)
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
Topology-Hiding Communication from Minimal Assumptions. TCC (2) (2020)
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Cryptography from Information Loss. Electron. Colloquium Comput. Complex. 27 (2020)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-malleability Against Polynomial Tampering. CRYPTO (3) (2020)
Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, Tal Malkin
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? ITCS (2020)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust. CRYPTO (3) (2020)
Marshall Ball, Brent Carmer, Tal Malkin, Mike Rosulek, Nichole Schimanski
Garbled Neural Networks are Practical. IACR Cryptol. ePrint Arch. 2019 (2019)
Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran
Is Information-Theoretic Topology-Hiding Computation Possible? TCC (1) (2019)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction. IACR Cryptol. ePrint Arch. 2019 (2019)
Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran
Is Information-Theoretic Topology-Hiding Computation Possible? IACR Cryptol. ePrint Arch. 2019 (2019)
Michael Dubrovsky, Marshall Ball, Bogdan Penkovsky
Optical Proof of Work. CoRR (2019)
Marshall Ball, Siyao Guo, Daniel Wichs
Non-malleable Codes for Decision Trees. CRYPTO (1) (2019)
Marshall Ball, Oded Goldreich, Tal Malkin
Randomness Extraction from Somewhat Dependent Sources. Electron. Colloquium Comput. Complex. 26 (2019)
Marshall Ball, Siyao Guo, Daniel Wichs
Non-Malleable Codes for Decision Trees. IACR Cryptol. ePrint Arch. 2019 (2019)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin
Non-Malleable Codes Against Bounded Polynomial Time Tampering. EUROCRYPT (1) (2019)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Limits to Non-Malleability. IACR Cryptol. ePrint Arch. 2019 (2019)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Proofs of Work From Worst-Case Assumptions. CRYPTO (1) (2018)
Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits. CoRR (2018)
Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits. IACR Cryptol. ePrint Arch. 2018 (2018)
Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran
Exploring the Boundaries of Topology-Hiding Computation. EUROCRYPT (3) (2018)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering. EUROCRYPT (3) (2018)
Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits. FOCS (2018)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Proofs of Work from Worst-Case Assumptions. IACR Cryptol. ePrint Arch. 2018 (2018)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin
Non-Malleable Codes Against Bounded Polynomial Time Tampering. IACR Cryptol. ePrint Arch. 2018 (2018)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Average-case fine-grained hardness. STOC (2017)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering. IACR Cryptol. ePrint Arch. 2017 (2017)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Average-Case Fine-Grained Hardness. Electron. Colloquium Comput. Complex. 24 (2017)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Average-Case Fine-Grained Hardness. IACR Cryptol. ePrint Arch. 2017 (2017)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Proofs of Useful Work. IACR Cryptol. ePrint Arch. 2017 (2017)
Marshall Ball, Tal Malkin, Mike Rosulek
Garbling Gadgets for Boolean and Arithmetic Circuits. CCS (2016)
Marshall Ball, Tal Malkin, Mike Rosulek
Garbling Gadgets for Boolean and Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2016 (2016)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. EUROCRYPT (2) (2016)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits. IACR Cryptol. ePrint Arch. 2016 (2016)