| 2026 | EuroCrypt | Maintaining Sublinear Locality Over Time: Adaptively Secure MPC on a Reusable Hidden Graph. | Elette Boyle, Ran Cohen, Pierre Meyer |
| 2025 | ASIACRYPT | Setup-Free Committee Sampling with Subquadratic Communication. | Ran Cohen, Poulami Das, Tal Moran |
| 2025 | EuroCrypt | Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries. | Gilad Asharov, Anirudh Chandramouli, Ran Cohen, Yuval Ishai |
| 2025 | TCC | 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 |
| 2025 | TCC | Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols. | Ran Cohen, Pouyan Forghani, Juan Garay, Rutvik Patel, Vassilis Zikas |
| 2024 | CRYPTO | Secure Multiparty Computation with Identifiable Abort via Vindicating Release. | Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat |
| 2024 | FC | Efficient Agreement Over Byzantine Gossip. | Ran Cohen, Julian Loss, Tal Moran |
| 2023 | CRYPTO | Completeness Theorems for Adaptively Secure Broadcast. | Ran Cohen, Juan A. Garay, Vassilis Zikas |
| 2023 | TCC | Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. | Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas |
| 2023 | TCC | Locally Verifiable Distributed SNARGs. | Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman |
| 2022 | EuroCrypt | Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols. | Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat |
| 2021 | PODC | Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. | Elette Boyle, Ran Cohen, Aarushi Goel |
| 2020 | CRYPTO | Multiparty Generation of an RSA Modulus. | Megan Chen, Ran Cohen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, Abhi Shelat |
| 2020 | EuroCrypt | Broadcast-Optimal Two-Round MPC. | Ran Cohen, Juan A. Garay, Vassilis Zikas |
| 2020 | TCC | On the Power of an Honest Majority in Three-Party Computation Without Broadcast. | Bar Alon, Ran Cohen, Eran Omri, Tom Suad |
| 2020 | TCC | Topology-Hiding Communication from Minimal Assumptions. | Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran |
| 2019 | CRYPTO | Adaptively Secure MPC with Sublinear Communication Complexity. | Ran Cohen, Abhi Shelat, Daniel Wichs |
| 2019 | TCC | Is Information-Theoretic Topology-Hiding Computation Possible? | Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran |
| 2018 | CRYPTO | Must the Communication Graph of MPC Protocols be an Expander? | Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubcek |
| 2018 | SCN | From Fairness to Full Security in Multiparty Computation. | Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem |
| 2017 | ICALP | Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. | Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas |
| 2016 | CRYPTO | Probabilistic Termination and Composability of Cryptographic Protocols. | Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas |
| 2016 | PKC | Asynchronous Secure Multiparty Computation in Constant Time. | Ran Cohen |
| 2016 | SCN | On Adaptively Secure Multiparty Computation with a Short CRS. | Ran Cohen, Chris Peikert |
| 2016 | TCC | Characterization of Secure Multiparty Computation Without Broadcast. | Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem |
| 2014 | ASIACRYPT | Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation. | Ran Cohen, Yehuda Lindell |