| Fairness versus guaranteed output delivery in secure multiparty computation R Cohen, Y Lindell Journal of Cryptology 30 (4), 1157-1186, 2017 | 115 | 2017 |
| Probabilistic termination and composability of cryptographic protocols R Cohen, S Coretti, J Garay, V Zikas Journal of Cryptology 32 (3), 690-741, 2019 | 63 | 2019 |
| Asynchronous secure multiparty computation in constant time R Cohen Public-Key Cryptography--PKC 2016, 183-207, 2016 | 58 | 2016 |
| Multiparty generation of an RSA modulus M Chen, J Doerner, Y Kondi, E Lee, S Rosefield, A Shelat, R Cohen Journal of Cryptology 35 (2), 12, 2022 | 56 | 2022 |
| Breaking the O (√ n)-bit barrier: Byzantine agreement with polylog bits per party E Boyle, R Cohen, A Goel Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 51* | 2021 |
| Adaptively secure MPC with sublinear communication complexity R Cohen, A Shelat, D Wichs Journal of Cryptology 36 (2), 11, 2023 | 40* | 2023 |
| Round-preserving parallel composition of probabilistic-termination cryptographic protocols R Cohen, S Coretti, J Garay, V Zikas Journal of Cryptology 34 (2), 12, 2021 | 35 | 2021 |
| Broadcast-optimal two-round MPC R Cohen, J Garay, V Zikas Annual International Conference on the Theory and Applications of …, 2020 | 34 | 2020 |
| Characterization of secure multiparty computation without broadcast R Cohen, I Haitner, E Omri, L Rotem Journal of Cryptology 31 (2), 587-609, 2018 | 33 | 2018 |
| From fairness to full security in multiparty computation R Cohen, I Haitner, E Omri, L Rotem Journal of Cryptology 35 (1), 4, 2022 | 25* | 2022 |
| Must the communication graph of MPC protocols be an expander? E Boyle, R Cohen, D Data, P Hubáček Journal of Cryptology 36 (3), 20, 2023 | 24 | 2023 |
| On the round complexity of randomized byzantine agreement R Cohen, I Haitner, N Makriyannis, M Orland, A Samorodnitsky Journal of Cryptology 35 (2), 10, 2022 | 24 | 2022 |
| Completeness theorems for adaptively secure broadcast R Cohen, J Garay, V Zikas Annual International Cryptology Conference, 3-38, 2023 | 21* | 2023 |
| Concurrent asynchronous byzantine agreement in expected-constant rounds, revisited R Cohen, P Forghani, J Garay, R Patel, V Zikas Theory of Cryptography Conference, 422-451, 2023 | 19* | 2023 |
| Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW G Asharov, R Cohen, O Shochat Cryptology ePrint Archive, 2022 | 16 | 2022 |
| Secure Multiparty Computation with Identifiable Abort via Vindicating R Cohen, J Doerner, Y Kondi¹, A Shelat Advances in Cryptology–CRYPTO 2024: 44th Annual International Cryptology …, 2024 | 14* | 2024 |
| Guaranteed Output in Rounds for Round-Robin Sampling Protocols R Cohen, J Doerner, Y Kondi, A Shelat Annual International Conference on the Theory and Applications of …, 2022 | 12 | 2022 |
| Communication lower bounds for cryptographic broadcast protocols E Blum, E Boyle, R Cohen, CD Liu-Zhang Distributed Computing 38 (1), 1-17, 2025 | 10 | 2025 |
| Is information-theoretic topology-hiding computation possible? M Ball, E Boyle, R Cohen, T Malkin, T Moran Theory of Cryptography Conference, 502-530, 2019 | 10 | 2019 |
| Topology-hiding communication from minimal assumptions M Ball, E Boyle, R Cohen, L Kohl, T Malkin, P Meyer, T Moran Theory of Cryptography Conference, 473-501, 2020 | 9 | 2020 |
Juan GarayProfessor, Texas A&M University, Computer Science & EngineeringVerified email at TAMU.EDU
