Marshall Ball

According to our database, Marshall Ball authored at least 40 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity.

Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos

IACR Cryptol. ePrint Arch., 2024

Secure Stateful Aggregation: A Practical Protocol with Applications in Differentially-Private Federated Learning.

Marshall Ball, James Bell-Clark, Adrià Gascón, Peter Kairouz, Sewoong Oh, Zhiye Xie

IACR Cryptol. ePrint Arch., 2024

Extractors for Samplable Distributions with Low Min-Entropy.

Marshall Ball, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2024

Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement.

Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass

Electron. Colloquium Comput. Complex., 2024

2023

Topology-Hiding Communication from Minimal Assumptions.

Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran

J. Cryptol., October, 2023

New Ways to Garble Arithmetic Circuits.

Marshall Ball, Hanjun Li, Huijia Lin, Tianren Liu

IACR Cryptol. ePrint Arch., 2023

Immunizing Backdoored PRGs.

Marshall Ball, Yevgeniy Dodis, Eli Goldin

IACR Cryptol. ePrint Arch., 2023

Towards Topology-Hiding Computation from Oblivious Transfer.

Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer

IACR Cryptol. ePrint Arch., 2023

Non-malleable codes with optimal rate for poly-size circuits.

Marshall Ball, Ronen Shaltiel, Jad Silbak

Electron. Colloquium Comput. Complex., 2023

Extracting Randomness from Samplable Distributions, Revisited.

Marshall Ball, Dana Dachman-Soled, Eli Goldin, Saachi Mutreja

Electron. Colloquium Comput. Complex., 2023

(Inefficient Prover) ZAPs from Hard-to-Invert Functions.

Marshall Ball, Dana Dachman-Soled

Electron. Colloquium Comput. Complex., 2023

2022

Survey: Non-malleable code in the split-state model.

Divesh Aggarwal, Marshall Ball, Maciej Obremski

IACR Cryptol. ePrint Arch., 2022

Non-Malleable Code in the Split-State Model.

Divesh Aggarwal, Marshall Ball, Maciej Obremski

Entropy, 2022

(Nondeterministic) Hardness vs. Non-Malleability.

Marshall Ball, Dana Dachman-Soled, Julian Loss

Electron. Colloquium Comput. Complex., 2022

Experimental evaluation of digitally-verifiable photonic computing for blockchain and cryptocurrency.

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

CoRR, 2022

A Note on the Complexity of Private Simultaneous Messages with Many Parties.

Marshall Ball, Tim Randolph

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021

On Resilience to Computable Tampering.

Marshall Ball

PhD thesis, 2021

Linear Threshold Secret-Sharing with Binary Reconstruction.

Marshall Ball, Alper Çakan, Tal Malkin

Electron. Colloquium Comput. Complex., 2021

2020

Communication Complexity with Defective Randomness.

Marshall Ball, Oded Goldreich, Tal Malkin

Electron. Colloquium Comput. Complex., 2020

Non-Malleability against Polynomial Tampering.

Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan

Electron. Colloquium Comput. Complex., 2020

Cryptography from Information Loss.

Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan

Electron. Colloquium Comput. Complex., 2020

On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?

Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, Tal Malkin

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Non-Malleable Codes for Decision Trees.

Marshall Ball, Siyao Guo, Daniel Wichs

IACR Cryptol. ePrint Arch., 2019

Limits to Non-Malleability.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin

IACR Cryptol. ePrint Arch., 2019

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni

IACR Cryptol. ePrint Arch., 2019

Garbled Neural Networks are Practical.

Marshall Ball, Brent Carmer, Tal Malkin, Mike Rosulek, Nichole Schimanski

IACR Cryptol. ePrint Arch., 2019

Is Information-Theoretic Topology-Hiding Computation Possible?

Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran

IACR Cryptol. ePrint Arch., 2019

Randomness Extraction from Somewhat Dependent Sources.

Marshall Ball, Oded Goldreich, Tal Malkin

Electron. Colloquium Comput. Complex., 2019

Optical Proof of Work.

Michael Dubrovsky, Marshall Ball, Bogdan Penkovsky

CoRR, 2019

2018

Proofs of Work from Worst-Case Assumptions.

Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan

IACR Cryptol. ePrint Arch., 2018

Non-Malleable Codes Against Bounded Polynomial Time Tampering.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin

IACR Cryptol. ePrint Arch., 2018

Non-Malleable Codes for Small-Depth Circuits.

Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan

Electron. Colloquium Comput. Complex., 2018

Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Exploring the Boundaries of Topology-Hiding Computation.

Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017

Proofs of Useful Work.

Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan

IACR Cryptol. ePrint Arch., 2017

Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin

IACR Cryptol. ePrint Arch., 2017

Average-Case Fine-Grained Hardness.

Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan

Electron. Colloquium Comput. Complex., 2017

2016

Garbling Gadgets for Boolean and Arithmetic Circuits.

Marshall Ball, Tal Malkin, Mike Rosulek

IACR Cryptol. ePrint Arch., 2016

Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits.

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin

IACR Cryptol. ePrint Arch., 2016