| Fairness versus guaranteed output delivery in secure multiparty computation R Cohen, Y Lindell Journal of Cryptology 30 (4), 1157-1186, 2017 | 99 | 2017 |
| Probabilistic termination and composability of cryptographic protocols R Cohen, S Coretti, J Garay, V Zikas Journal of Cryptology 32 (3), 690-741, 2019 | 54 | 2019 |
| 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 | 44 | 2022 |
| Asynchronous secure multiparty computation in constant time R Cohen Public-Key Cryptography--PKC 2016, 183-207, 2016 | 36 | 2016 |
| 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 | 32 | 2021 |
| Characterization of secure multiparty computation without broadcast R Cohen, I Haitner, E Omri, L Rotem Journal of Cryptology 31, 587-609, 2018 | 30 | 2018 |
| Adaptively Secure MPC with Sublinear Communication Complexity R Cohen, A Shelat, D Wichs Journal of Cryptology 36 (2), 11, 2023 | 29* | 2023 |
| Round-preserving parallel composition of probabilistic-termination cryptographic protocols R Cohen, S Coretti, J Garay, V Zikas Journal of Cryptology 34, 1-57, 2021 | 27 | 2021 |
| Broadcast-optimal two-round MPC R Cohen, J Garay, V Zikas Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020 | 25 | 2020 |
| 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 | 22 | 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 | 20 | 2022 |
| From fairness to full security in multiparty computation R Cohen, I Haitner, E Omri, L Rotem Journal of Cryptology 35 (1), 4, 2022 | 18* | 2022 |
| Completeness theorems for adaptively secure broadcast R Cohen, J Garay, V Zikas Annual International Cryptology Conference, 3-38, 2023 | 12* | 2023 |
| Is information-theoretic topology-hiding computation possible? M Ball, E Boyle, R Cohen, T Malkin, T Moran Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019 | 9 | 2019 |
| On adaptively secure multiparty computation with a short CRS R Cohen, C Peikert International Conference on Security and Cryptography for Networks, 129-146, 2016 | 8 | 2016 |
| Topology-hiding communication from minimal assumptions M Ball, E Boyle, R Cohen, L Kohl, T Malkin, P Meyer, T Moran Journal of Cryptology 36 (4), 39, 2023 | 7 | 2023 |
| Communication lower bounds for cryptographic broadcast protocols E Blum, E Boyle, R Cohen, CD Liu-Zhang arXiv preprint arXiv:2309.01466, 2023 | 7 | 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 | 6 | 2022 |
| 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 | 5 | 2022 |
| 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 | 3 | 2023 |
Vassilis ZikasPurdue UniversityVerified email at cs.purdue.edu
