Marshall Ball
Orcid: 0000-0002-4236-3710
According to our database1,
Marshall Ball
authored at least 42 papers
between 2016 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025
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
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024
2023
Proceedings of the Theory of Cryptography - 21st International Conference, 2023
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
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023
2022
IACR Cryptol. ePrint Arch., 2022
Experimental evaluation of digitally-verifiable photonic computing for blockchain and cryptocurrency.
CoRR, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022
2021
Proceedings of the 36th Computational Complexity Conference, 2021
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021
2020
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
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
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
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
Proceedings of the Theory of Cryptography - 17th International Conference, 2019
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019
2018
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
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
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018
2017
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering.
IACR Cryptol. ePrint Arch., 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
2016
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016