Asynchronous Secure Multiparty Computation in Constant Time. - Ran Cohen (IACR Cryptol. ePrint Arch., 2015)

On Adaptively Secure Multiparty Computation with a Short CRS. - Ran Cohen; Chris Peikert (IACR Cryptol. ePrint Arch., 2016)

Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. - Ran Cohen; Yehuda Lindell (J. Cryptol., 2017)

Characterization of Secure Multiparty Computation Without Broadcast. - Ran Cohen; Iftach Haitner; Eran Omri; Lior Rotem (J. Cryptol., 2018)

Is Information-Theoretic Topology-Hiding Computation Possible? - Marshall Ball; Elette Boyle; Ran Cohen; Tal Malkin; Tal Moran (IACR Cryptol. ePrint Arch., 2019)

Broadcast-Optimal Two-Round MPC. - Ran Cohen; Juan A. Garay; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2019)

Probabilistic Termination and Composability of Cryptographic Protocols. - Ran Cohen; Sandro Coretti; Juan A. Garay; Vassilis Zikas (J. Cryptol., 2019)

Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. - Elette Boyle; Ran Cohen; Aarushi Goel (IACR Cryptol. ePrint Arch., 2020)

Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. - Elette Boyle; Ran Cohen; Aarushi Goel (PODC, 2021)

Adaptively Secure Broadcast in Resource-Restricted Cryptography. - Ran Cohen; Juan A. Garay; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2021)

Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. - Ran Cohen; Sandro Coretti; Juan A. Garay; Vassilis Zikas (J. Cryptol., 2021)

Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. - Gilad Asharov; Ran Cohen; Oren Shochat (IACR Cryptol. ePrint Arch., 2022)

Multiparty Generation of an RSA Modulus. - Megan Chen; Jack Doerner; Yashvanth Kondi; Eysa Lee; Schuyler Rosefield; Abhi Shelat; Ran Cohen (J. Cryptol., 2022)

On the Round Complexity of Randomized Byzantine Agreement. - Ran Cohen; Iftach Haitner; Nikolaos Makriyannis; Matan Orland; Alex Samorodnitsky (J. Cryptol., 2022)

From Fairness to Full Security in Multiparty Computation. - Ran Cohen; Iftach Haitner; Eran Omri; Lior Rotem (J. Cryptol., 2022)

Completeness Theorems for Adaptively Secure Broadcast. - Ran Cohen; Juan A. Garay; Vassilis Zikas (CRYPTO (1), 2023)

Secure Multiparty Computation with Identifiable Abort from Vindicating Release. - Ran Cohen; Jack Doerner; Yashvanth Kondi; Abhi Shelat (IACR Cryptol. ePrint Arch., 2023)

Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. - Ran Cohen; Pouyan Forghani; Juan A. Garay; Rutvik Patel; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2023)

Efficient Agreement Over Byzantine Gossip. - Ran Cohen; Julian Loss; Tal Moran (IACR Cryptol. ePrint Arch., 2023)

Adaptively Secure MPC with Sublinear Communication Complexity. - Ran Cohen; Abhi Shelat; Daniel Wichs (J. Cryptol., 2023)

On the Power of an Honest Majority in Three-Party Computation Without Broadcast. - Bar Alon; Ran Cohen; Eran Omri; Tom Suad (J. Cryptol., 2023)

Must the Communication Graph of MPC Protocols be an Expander? - Elette Boyle; Ran Cohen; Deepesh Data; Pavel Hubácek (J. Cryptol., 2023)

Topology-Hiding Communication from Minimal Assumptions. - Marshall Ball; Elette Boyle; Ran Cohen; Lisa Kohl; Tal Malkin; Pierre Meyer; Tal Moran (J. Cryptol., 2023)

Secure Multiparty Computation with Identifiable Abort via Vindicating Release. - Ran Cohen; Jack Doerner; Yashvanth Kondi; Abhi Shelat (CRYPTO (8), 2024)

Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. - D'or Banoun; Elette Boyle; Ran Cohen (IACR Cryptol. ePrint Arch., 2024)

An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast. - Ran Cohen; Jack Doerner; Eysa Lee; Anna Lysyanskaya; Lawrence Roy (IACR Cryptol. ePrint Arch., 2024)

Locally Verifiable Distributed SNARGs. - Eden Aldema Tshuva; Elette Boyle; Ran Cohen; Tal Moran; Rotem Oshman (IACR Cryptol. ePrint Arch., 2024)

Breaking the $O( sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. - Elette Boyle; Ran Cohen; Aarushi Goel (J. Cryptol., 2024)

Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries. - Gilad Asharov; Anirudh Chandramouli; Ran Cohen; Yuval Ishai (IACR Cryptol. ePrint Arch., 2025)

Communication lower bounds for cryptographic broadcast protocols. - Erica Blum; Elette Boyle; Ran Cohen; Chen-Da Liu-Zhang (Distributed Comput., 2025)

Guaranteed Output in $O( sqrt{n})$ Rounds for Round-Robin Sampling Protocols. - Ran Cohen; Jack Doerner; Yashvanth Kondi; Abhi Shelat (J. Cryptol., 2025)