Marshall Ball

Orcid: 0000-0002-4236-3710

According to our database1, Marshall Ball authored at least 42 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Extractors for Samplable Distributions with Low Min-Entropy.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

(Inefficient Prover) ZAPs from Hard-to-Invert Functions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Uniform Black-Box Separations via Non-malleable Extractors.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Towards Free Lunch Derandomization from Necessary Assumptions (And OWFs).
Proceedings of the 40th Computational Complexity Conference, 2025

2024
Secure Stateful Aggregation: A Practical Protocol with Applications in Differentially-Private Federated Learning.
IACR Cryptol. ePrint Arch., 2024

Non-malleable Codes with Optimal Rate for Poly-Size Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Immunizing Backdoored PRGs.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Towards Topology-Hiding Computation from Oblivious Transfer.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Extracting Randomness from Samplable Distributions, Revisited.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

New Ways to Garble Arithmetic Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
Survey: Non-malleable code in the split-state model.
IACR Cryptol. ePrint Arch., 2022

Non-Malleable Code in the Split-State Model.
Entropy, 2022

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

Randomness Extraction from Somewhat Dependent Sources.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

(Nondeterministic) Hardness vs. Non-malleability.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

A Note on the Complexity of Private Simultaneous Messages with Many Parties.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021
On Resilience to Computable Tampering.
PhD thesis, 2021

Communication Complexity with Defective Randomness.
Proceedings of the 36th Computational Complexity Conference, 2021

Linear Threshold Secret-Sharing with Binary Reconstruction.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Topology-Hiding Communication from Minimal Assumptions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Limits to Non-Malleability.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Cryptography from Information Loss.
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.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Non-malleability Against Polynomial Tampering.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction.
IACR Cryptol. ePrint Arch., 2019

Garbled Neural Networks are Practical.
IACR Cryptol. ePrint Arch., 2019

Optical Proof of Work.
CoRR, 2019

Is Information-Theoretic Topology-Hiding Computation Possible?
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Non-Malleable Codes Against Bounded Polynomial Time Tampering.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Non-malleable Codes for Decision Trees.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Non-Malleable Codes for Small-Depth Circuits.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering.
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.
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

Proofs of Work From Worst-Case Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Proofs of Useful Work.
IACR Cryptol. ePrint Arch., 2017

Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering.
IACR Cryptol. ePrint Arch., 2017

Average-case fine-grained hardness.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Garbling Gadgets for Boolean and Arithmetic Circuits.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016


  Loading...