Ran Cohen

Orcid: 0000-0002-1293-552X

According to our database1, Ran Cohen authored at least 32 papers between 2014 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols.
IACR Cryptol. ePrint Arch., 2025

Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party.
J. Cryptol., March, 2024

An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast.
IACR Cryptol. ePrint Arch., 2024

Efficient Agreement Over Byzantine Gossip.
Proceedings of the Financial Cryptography and Data Security, 2024

Secure Multiparty Computation with Identifiable Abort via Vindicating Release.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond.
Proceedings of the 5th Conference on Information-Theoretic Cryptography, 2024

2023
Secure Multiparty Computation with Identifiable Abort from Vindicating Release.
IACR Cryptol. ePrint Arch., 2023

Communication Lower Bounds for Cryptographic Broadcast Protocols.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Locally Verifiable Distributed SNARGs.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Completeness Theorems for Adaptively Secure Broadcast.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021
Adaptively Secure Broadcast in Resource-Restricted Cryptography.
IACR Cryptol. ePrint Arch., 2021

Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2020

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

On the Power of an Honest Majority in Three-Party Computation Without Broadcast.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Broadcast-Optimal Two-Round MPC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Multiparty Generation of an RSA Modulus.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
On the Round Complexity of Randomized Byzantine Agreement.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

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

Adaptively Secure MPC with Sublinear Communication Complexity.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
From Fairness to Full Security in Multiparty Computation.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Must the Communication Graph of MPC Protocols be an Expander?
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Characterization of Secure Multiparty Computation Without Broadcast.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

On Adaptively Secure Multiparty Computation with a Short CRS.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Asynchronous Secure Multiparty Computation in Constant Time.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Probabilistic Termination and Composability of Cryptographic Protocols.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2014
Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014


  Loading...