Get started
Author

Ran Cohen

Observed name: Cohen, Ran
Institution: Reichman University
ORCID: 0000-0002-1293-552X
Observed ORCID: 0000-0002-1293-552X
OpenAlex ID: A5048892933
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation
2016 · Ran Cohen, Yehuda Lindell · Journal of Cryptology · 44
PDF
Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
2014 · Ran Cohen, Yehuda Lindell · Lecture notes in computer science · 39
Asynchronous Secure Multiparty Computation in Constant Time
2016 · Ran Cohen · Lecture notes in computer science · 32
Probabilistic Termination and Composability of Cryptographic Protocols
2016 · Ran Cohen, Sandro Coretti, et al. · Lecture notes in computer science · 28
Adaptively Secure MPC with Sublinear Communication Complexity
2019 · Ran Cohen, Abhi Shelat, et al. · Lecture notes in computer science · 26
Multiparty Generation of an RSA Modulus
2020 · Megan Chen, Ran Cohen, et al. · Lecture notes in computer science · 25
Broadcast-Optimal Two-Round MPC
2020 · Ran Cohen, Juan Garay, et al. · Lecture notes in computer science · 24
Probabilistic Termination and Composability of Cryptographic Protocols
2018 · Ran Cohen, Sandro Coretti, et al. · Journal of Cryptology · 19
Breaking the O(√ n)-Bit Barrier
2021 · Elette Boyle, Ran Cohen, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 18
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited
2023 · Ran Cohen, Pouyan Forghani, et al. · Lecture notes in computer science · 15
PDF
Must the Communication Graph of MPC Protocols be an Expander?
2018 · Elette Boyle, Ran Cohen, et al. · Lecture notes in computer science · 14
Multiparty Generation of an RSA Modulus
2022 · Megan Chen, Jack Doerner, et al. · Journal of Cryptology · 13
On the Round Complexity of Randomized Byzantine Agreement
2022 · Ran Cohen, Iftach Haitner, et al. · Journal of Cryptology · 13
PDF
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
2021 · Ran Cohen, Sandro Coretti, et al. · Journal of Cryptology · 13
PDF
Characterization of Secure Multiparty Computation Without Broadcast
2015 · Ran Cohen, Iftach Haitner, et al. · Lecture notes in computer science · 13
PDF
From Fairness to Full Security in Multiparty Computation
2021 · Ran Cohen, Iftach Haitner, et al. · Journal of Cryptology · 10
PDF
From Fairness to Full Security in Multiparty Computation
2018 · Ran Cohen, Iftach Haitner, et al. · Lecture notes in computer science · 10
Completeness Theorems for Adaptively Secure Broadcast
2023 · Ran Cohen, Juan Garay, et al. · Lecture notes in computer science · 9
Topology-Hiding Communication from Minimal Assumptions
2020 · Marshall Ball, Elette Boyle, et al. · Lecture notes in computer science · 9
Is Information-Theoretic Topology-Hiding Computation Possible?
2019 · Marshall Ball, Elette Boyle, et al. · Lecture notes in computer science · 9
Secure Multiparty Computation with Identifiable Abort via Vindicating Release
2024 · Ran Cohen, Jack Doerner, et al. · Lecture notes in computer science · 8
Guaranteed Output in $$O(\sqrt{n})$$ Rounds for Round-Robin Sampling Protocols
2022 · Ran Cohen, Jack Doerner, et al. · Lecture notes in computer science · 8
Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
2023 · Elette Boyle, Ran Cohen, et al. · Journal of Cryptology · 7
On Adaptively Secure Multiparty Computation with a Short CRS
2016 · Ran Cohen, Chris Peikert · Lecture notes in computer science · 6
Communication lower bounds for cryptographic broadcast protocols
2025 · Erica Blum, Elette Boyle, et al. · Distributed Computing · 4
PDF
Works count: 49
Citation count: 438
H-index: 13
I10-index: 17
Year
Topic
Type