Ran Cohen

Orcid: 0000-0002-1293-552X

According to our database1, Ran Cohen authored at least 30 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Locally Verifiable Distributed SNARGs.
IACR Cryptol. ePrint Arch., 2024

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

Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond.
IACR Cryptol. ePrint Arch., 2024

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

2023
Topology-Hiding Communication from Minimal Assumptions.
J. Cryptol., October, 2023

Must the Communication Graph of MPC Protocols be an Expander?
J. Cryptol., July, 2023

On the Power of an Honest Majority in Three-Party Computation Without Broadcast.
J. Cryptol., July, 2023

Adaptively Secure MPC with Sublinear Communication Complexity.
J. Cryptol., April, 2023

Efficient Agreement Over Byzantine Gossip.
IACR Cryptol. ePrint Arch., 2023

Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited.
IACR Cryptol. ePrint Arch., 2023

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

Communication Lower Bounds for Cryptographic Broadcast Protocols.
IACR Cryptol. ePrint Arch., 2023

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

2022
From Fairness to Full Security in Multiparty Computation.
J. Cryptol., 2022

On the Round Complexity of Randomized Byzantine Agreement.
J. Cryptol., 2022

Multiparty Generation of an RSA Modulus.
J. Cryptol., 2022

Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols.
IACR Cryptol. ePrint Arch., 2022

Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW.
IACR Cryptol. ePrint Arch., 2022

2021
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols.
J. Cryptol., 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

2019
Probabilistic Termination and Composability of Cryptographic Protocols.
J. Cryptol., 2019

Broadcast-Optimal Two-Round MPC.
IACR Cryptol. ePrint Arch., 2019

Is Information-Theoretic Topology-Hiding Computation Possible?
IACR Cryptol. ePrint Arch., 2019

2018
Characterization of Secure Multiparty Computation Without Broadcast.
J. Cryptol., 2018

2017
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation.
J. Cryptol., 2017

2016
On Adaptively Secure Multiparty Computation with a Short CRS.
IACR Cryptol. ePrint Arch., 2016

2015
Asynchronous Secure Multiparty Computation in Constant Time.
IACR Cryptol. ePrint Arch., 2015


  Loading...