Ran Cohen

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 63

Top Topics

Secure Multiparty Computation

Locally Decodable Codes

Distributional Clustering

Top Venues

IACR Cryptol. ePrint Arch.

Publications

D'or Banoun, Elette Boyle, Ran Cohen
Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. ITC (2024)
Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat
Secure Multiparty Computation with Identifiable Abort via Vindicating Release. CRYPTO (8) (2024)
Elette Boyle, Ran Cohen, Aarushi Goel
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. J. Cryptol. 37 (1) (2024)
D'or Banoun, Elette Boyle, Ran Cohen
Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. IACR Cryptol. ePrint Arch. 2024 (2024)
Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang
Communication Lower Bounds for Cryptographic Broadcast Protocols. IACR Cryptol. ePrint Arch. 2023 (2023)
Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang
Communication Lower Bounds for Cryptographic Broadcast Protocols. CoRR (2023)
Bar Alon, Ran Cohen, Eran Omri, Tom Suad
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. J. Cryptol. 36 (3) (2023)
Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. IACR Cryptol. ePrint Arch. 2023 (2023)
Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat
Secure Multiparty Computation with Identifiable Abort from Vindicating Release. IACR Cryptol. ePrint Arch. 2023 (2023)
Ran Cohen, Abhi Shelat, Daniel Wichs
Adaptively Secure MPC with Sublinear Communication Complexity. J. Cryptol. 36 (2) (2023)
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36 (4) (2023)
Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman
Locally Verifiable Distributed SNARGs. TCC (1) (2023)
Ran Cohen, Juan A. Garay, Vassilis Zikas
Completeness Theorems for Adaptively Secure Broadcast. CRYPTO (1) (2023)
Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang
Communication Lower Bounds for Cryptographic Broadcast Protocols. DISC (2023)
Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek
Must the Communication Graph of MPC Protocols be an Expander? J. Cryptol. 36 (3) (2023)
Ran Cohen, Julian Loss, Tal Moran
Efficient Agreement Over Byzantine Gossip. IACR Cryptol. ePrint Arch. 2023 (2023)
Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. TCC (4) (2023)
Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. CoRR (2023)
Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek
Must the Communication Graph of MPC Protocols be an Expander? CoRR (2023)
Gilad Asharov, Ran Cohen, Oren Shochat
Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. IACR Cryptol. ePrint Arch. 2022 (2022)
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
On the Round Complexity of Randomized Byzantine Agreement. J. Cryptol. 35 (2) (2022)
Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat
Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols. EUROCRYPT (1) (2022)
Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat
Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols. IACR Cryptol. ePrint Arch. 2022 (2022)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. J. Cryptol. 35 (1) (2022)
Megan Chen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, Abhi Shelat, Ran Cohen
Multiparty Generation of an RSA Modulus. J. Cryptol. 35 (2) (2022)
Gilad Asharov, Ran Cohen, Oren Shochat
Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. ITC (2022)
Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. J. Cryptol. 34 (2) (2021)
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
Topology-Hiding Communication from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2021 (2021)
Ran Cohen, Juan A. Garay, Vassilis Zikas
Adaptively Secure Broadcast in Resource-Restricted Cryptography. IACR Cryptol. ePrint Arch. 2021 (2021)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. CoRR (2021)
Elette Boyle, Ran Cohen, Aarushi Goel
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. PODC (2021)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. CoRR (2021)
Elette Boyle, Ran Cohen, Aarushi Goel
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. IACR Cryptol. ePrint Arch. 2020 (2020)
Bar Alon, Ran Cohen, Eran Omri, Tom Suad
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. TCC (2) (2020)
Ran Cohen, Juan A. Garay, Vassilis Zikas
Broadcast-Optimal Two-Round MPC. EUROCRYPT (2) (2020)
Megan Chen, Ran Cohen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, Abhi Shelat
Multiparty Generation of an RSA Modulus. IACR Cryptol. ePrint Arch. 2020 (2020)
Elette Boyle, Ran Cohen, Aarushi Goel
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. CoRR (2020)
Bar Alon, Ran Cohen, Eran Omri, Tom Suad
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2020 (2020)
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
Topology-Hiding Communication from Minimal Assumptions. TCC (2) (2020)
Megan Chen, Ran Cohen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, Abhi Shelat
Multiparty Generation of an RSA Modulus. CRYPTO (3) (2020)
Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran
Is Information-Theoretic Topology-Hiding Computation Possible? TCC (1) (2019)
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
On the Round Complexity of Randomized Byzantine Agreement. DISC (2019)
Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran
Is Information-Theoretic Topology-Hiding Computation Possible? IACR Cryptol. ePrint Arch. 2019 (2019)
Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas
Probabilistic Termination and Composability of Cryptographic Protocols. J. Cryptol. 32 (3) (2019)
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
On the Round Complexity of Randomized Byzantine Agreement. CoRR (2019)
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky
On the Round Complexity of Randomized Byzantine Agreement. IACR Cryptol. ePrint Arch. 2019 (2019)
Ran Cohen, Abhi Shelat, Daniel Wichs
Adaptively Secure MPC with Sublinear Communication Complexity. CRYPTO (2) (2019)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Ran Cohen, Juan A. Garay, Vassilis Zikas
Broadcast-Optimal Two-Round MPC. IACR Cryptol. ePrint Arch. 2019 (2019)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptol. 31 (2) (2018)
Ran Cohen, Abhi Shelat, Daniel Wichs
Adaptively Secure MPC with Sublinear Communication Complexity. IACR Cryptol. ePrint Arch. 2018 (2018)
Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek
Must the Communication Graph of MPC Protocols be an Expander? IACR Cryptol. ePrint Arch. 2018 (2018)
Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek
Must the Communication Graph of MPC Protocols be an Expander? CRYPTO (3) (2018)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. SCN (2018)
Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. ICALP (2017)
Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2017 (2017)
Ran Cohen, Yehuda Lindell
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. J. Cryptol. 30 (4) (2017)
Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas
Probabilistic Termination and Composability of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2016 (2016)
Ran Cohen, Chris Peikert
On Adaptively Secure Multiparty Computation with a Short CRS. SCN (2016)
Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas
Probabilistic Termination and Composability of Cryptographic Protocols. CRYPTO (3) (2016)
Ran Cohen
Asynchronous Secure Multiparty Computation in Constant Time. Public Key Cryptography (2) (2016)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. TCC (A1) (2016)
Ran Cohen, Chris Peikert
On Adaptively Secure Multiparty Computation with a Short CRS. IACR Cryptol. ePrint Arch. 2016 (2016)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2015 (2015)
Ran Cohen
Asynchronous Secure Multiparty Computation in Constant Time. IACR Cryptol. ePrint Arch. 2015 (2015)
Ran Cohen, Yehuda Lindell
Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation. ASIACRYPT (2) (2014)
Ran Cohen, Yehuda Lindell
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014 (2014)