| 2026 | CRYPTO | Permissionless Consensus from a Common Random String. | Damiano Abram, Marshall Ball, Juan Garay, Aggelos Kiayias |
| 2026 | EuroCrypt | Fair Multiparty Coin Tossing from Minimal Assumptions. | Marshall Ball, Miranda Christ, Yevgeniy Dodis, Rachit Garg |
| 2025 | CRYPTO | Uniform Black-Box Separations via Non-malleable Extractors. | Marshall Ball, Dana Dachman-Soled |
| 2025 | EuroCrypt | (Inefficient Prover) ZAPs from Hard-to-Invert Functions. | Marshall Ball, Dana Dachman-Soled |
| 2025 | STOC | Extractors for Samplable Distributions with Low Min-Entropy. | Marshall Ball, Ronen Shaltiel, Jad Silbak |
| 2024 | CRYPTO | Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. | Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos |
| 2024 | EuroCrypt | Non-malleable Codes with Optimal Rate for Poly-Size Circuits. | Marshall Ball, Ronen Shaltiel, Jad Silbak |
| 2023 | EuroCrypt | New Ways to Garble Arithmetic Circuits. | Marshall Ball, Hanjun Li, Huijia Lin, Tianren Liu |
| 2023 | FOCS | Extracting Randomness from Samplable Distributions, Revisited. | Marshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi Mutreja |
| 2023 | FOCS | Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. | Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass |
| 2023 | TCC | Towards Topology-Hiding Computation from Oblivious Transfer. | Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer |
| 2023 | TCC | Immunizing Backdoored PRGs. | Marshall Ball, Yevgeniy Dodis, Eli Goldin |
| 2022 | CRYPTO | (Nondeterministic) Hardness vs. Non-malleability. | Marshall Ball, Dana Dachman-Soled, Julian Loss |
| 2020 | CRYPTO | Non-malleability Against Polynomial Tampering. | Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan |
| 2020 | CRYPTO | New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni |
| 2020 | TCC | Topology-Hiding Communication from Minimal Assumptions. | Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran |
| 2019 | CRYPTO | Non-malleable Codes for Decision Trees. | Marshall Ball, Siyao Guo, Daniel Wichs |
| 2019 | EuroCrypt | Non-Malleable Codes Against Bounded Polynomial Time Tampering. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin |
| 2019 | TCC | Is Information-Theoretic Topology-Hiding Computation Possible? | Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran |
| 2018 | CRYPTO | Proofs of Work From Worst-Case Assumptions. | Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan |
| 2018 | EuroCrypt | Exploring the Boundaries of Topology-Hiding Computation. | Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran |
| 2018 | EuroCrypt | 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 |
| 2018 | FOCS | Non-Malleable Codes for Small-Depth Circuits. | Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan |
| 2017 | STOC | Average-case fine-grained hardness. | Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan |
| 2016 | CCS | Garbling Gadgets for Boolean and Arithmetic Circuits. | Marshall Ball, Tal Malkin, Mike Rosulek |
| 2016 | EuroCrypt | Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin |