Follow
Ran Cohen
Ran Cohen
Reichman University (aka IDC Herzliya)
Verified email at idc.ac.il - Homepage
Title
Cited by
Cited by
Year
Fairness versus guaranteed output delivery in secure multiparty computation
R Cohen, Y Lindell
Journal of Cryptology 30 (4), 1157-1186, 2017
692017
Probabilistic termination and composability of cryptographic protocols
R Cohen, S Coretti, J Garay, V Zikas
Journal of Cryptology 32 (3), 690-741, 2019
392019
Characterization of secure multiparty computation without broadcast
R Cohen, I Haitner, E Omri, L Rotem
Theory of Cryptography Conference, 596-616, 2016
252016
Round-preserving parallel composition of probabilistic-termination cryptographic protocols
R Cohen, S Coretti, J Garay, V Zikas
Journal of Cryptology 34 (2), 1-57, 2021
202021
Asynchronous secure multiparty computation in constant time
R Cohen
Public-Key Cryptography--PKC 2016, 183-207, 2016
202016
Adaptively secure MPC with sublinear communication complexity
R Cohen, A Shelat, D Wichs
Annual International Cryptology Conference, 30-60, 2019
19*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), 1-84, 2022
172022
On the round complexity of randomized Byzantine agreement
R Cohen, I Haitner, N Makriyannis, M Orland, A Samorodnitsky
Journal of Cryptology 35 (2), 1-51, 2022
142022
Broadcast-optimal two-round MPC
R Cohen, J Garay, V Zikas
Annual International Conference on the Theory and Applications of …, 2020
142020
Must the communication graph of MPC protocols be an expander?
E Boyle, R Cohen, D Data, P Hubáček
Annual International Cryptology Conference, 243-272, 2018
112018
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
10*2021
From fairness to full security in multiparty computation
R Cohen, I Haitner, E Omri, L Rotem
Journal of Cryptology 35 (1), 1-70, 2022
82022
On adaptively secure multiparty computation with a short CRS
R Cohen, C Peikert
International Conference on Security and Cryptography for Networks, 129-146, 2016
62016
Is Information-Theoretic Topology-Hiding Computation Possible?
M Ball, E Boyle, R Cohen, T Malkin, T Moran
Theory of Cryptography Conference, 502-530, 2019
42019
Completeness Theorems for Adaptively Secure Broadcast
R Cohen, J Garay, V Zikas
Cryptology ePrint Archive, 2021
2*2021
On the power of an honest majority in three-party computation without broadcast
B Alon, R Cohen, E Omri, T Suad
Theory of Cryptography Conference, 621-651, 2020
12020
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
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
2022
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
2020
Studies on Full Security in Multiparty Computation
R Cohen
2017
The system can't perform the operation now. Try again later.
Articles 1–20