default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRan Cohen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j14]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication lower bounds for cryptographic broadcast protocols. Distributed Comput. 38(1): 1-17 (2025)- [j13]Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat:
Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols. J. Cryptol. 38(1): 16 (2025) - 2024
- [j12]Elette Boyle, Ran Cohen
, Aarushi Goel:
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. J. Cryptol. 37(1): 2 (2024) - [c25]D'or Banoun, Elette Boyle, Ran Cohen:
Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. ITC 2024: 1:1-1:13 - [c24]Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat:
Secure Multiparty Computation with Identifiable Abort via Vindicating Release. CRYPTO (8) 2024: 36-73 - [c23]Ran Cohen, Julian Loss, Tal Moran:
Efficient Agreement Over Byzantine Gossip. FC (1) 2024: 74-91 - [i33]D'or Banoun, Elette Boyle, Ran Cohen:
Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. IACR Cryptol. ePrint Arch. 2024: 1266 (2024) - [i32]Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. IACR Cryptol. ePrint Arch. 2024: 1385 (2024) - [i31]Ran Cohen, Jack Doerner, Eysa Lee, Anna Lysyanskaya, Lawrence Roy:
An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast. IACR Cryptol. ePrint Arch. 2024: 1807 (2024) - 2023
- [j11]Ran Cohen, Abhi Shelat, Daniel Wichs:
Adaptively Secure MPC with Sublinear Communication Complexity. J. Cryptol. 36(2): 11 (2023) - [j10]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? J. Cryptol. 36(3): 20 (2023) - [j9]Bar Alon, Ran Cohen, Eran Omri, Tom Suad:
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. J. Cryptol. 36(3): 25 (2023) - [j8]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36(4): 39 (2023) - [c22]Ran Cohen, Juan A. Garay, Vassilis Zikas:
Completeness Theorems for Adaptively Secure Broadcast. CRYPTO (1) 2023: 3-38 - [c21]Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. TCC (1) 2023: 65-90 - [c20]Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas:
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. TCC (4) 2023: 422-451 - [c19]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. DISC 2023: 10:1-10:19 - [i30]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? CoRR abs/2305.11428 (2023) - [i29]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. CoRR abs/2309.01466 (2023) - [i28]Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas:
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. CoRR abs/2312.14506 (2023) - [i27]Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas:
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. IACR Cryptol. ePrint Arch. 2023: 1003 (2023) - [i26]Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat:
Secure Multiparty Computation with Identifiable Abort from Vindicating Release. IACR Cryptol. ePrint Arch. 2023: 1136 (2023) - [i25]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. IACR Cryptol. ePrint Arch. 2023: 1316 (2023) - [i24]Ran Cohen, Julian Loss, Tal Moran:
Efficient Agreement Over Byzantine Gossip. IACR Cryptol. ePrint Arch. 2023: 1507 (2023) - 2022
- [j7]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. J. Cryptol. 35(1): 4 (2022) - [j6]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. J. Cryptol. 35(2): 10 (2022) - [j5]Megan Chen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, Abhi Shelat, Ran Cohen:
Multiparty Generation of an RSA Modulus. J. Cryptol. 35(2): 12 (2022) - [c18]Gilad Asharov, Ran Cohen, Oren Shochat:
Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. ITC 2022: 15:1-15:16 - [c17]Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat:
Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols. EUROCRYPT (1) 2022: 241-271 - [i23]Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat:
Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols. IACR Cryptol. ePrint Arch. 2022: 257 (2022) - [i22]Gilad Asharov, Ran Cohen, Oren Shochat:
Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. IACR Cryptol. ePrint Arch. 2022: 758 (2022) - 2021
- [j4]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. J. Cryptol. 34(2): 12 (2021) - [c16]Elette Boyle, Ran Cohen, Aarushi Goel:
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. PODC 2021: 319-330 - [i21]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. CoRR abs/2105.00732 (2021) - [i20]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. CoRR abs/2105.00962 (2021) - [i19]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2021: 388 (2021) - [i18]Ran Cohen, Juan A. Garay, Vassilis Zikas:
Adaptively Secure Broadcast in Resource-Restricted Cryptography. IACR Cryptol. ePrint Arch. 2021: 775 (2021) - 2020
- [c15]Megan Chen, Ran Cohen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, Abhi Shelat:
Multiparty Generation of an RSA Modulus. CRYPTO (3) 2020: 64-93 - [c14]Ran Cohen, Juan A. Garay, Vassilis Zikas:
Broadcast-Optimal Two-Round MPC. EUROCRYPT (2) 2020: 828-858 - [c13]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. TCC (2) 2020: 473-501 - [c12]Bar Alon, Ran Cohen, Eran Omri, Tom Suad:
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. TCC (2) 2020: 621-651 - [i17]Elette Boyle, Ran Cohen, Aarushi Goel:
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. CoRR abs/2002.02516 (2020) - [i16]Elette Boyle, Ran Cohen, Aarushi Goel:
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. IACR Cryptol. ePrint Arch. 2020: 130 (2020) - [i15]Megan Chen, Ran Cohen, Jack Doerner, Yashvanth Kondi, Eysa Lee, Schuyler Rosefield, Abhi Shelat:
Multiparty Generation of an RSA Modulus. IACR Cryptol. ePrint Arch. 2020: 370 (2020) - [i14]Bar Alon, Ran Cohen, Eran Omri, Tom Suad:
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2020: 1170 (2020)
2010 – 2019
- 2019
- [j3]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Probabilistic Termination and Composability of Cryptographic Protocols. J. Cryptol. 32(3): 690-741 (2019) - [c11]Ran Cohen, Abhi Shelat, Daniel Wichs:
Adaptively Secure MPC with Sublinear Communication Complexity. CRYPTO (2) 2019: 30-60 - [c10]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? TCC (1) 2019: 502-530 - [c9]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. DISC 2019: 12:1-12:17 - [i13]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. CoRR abs/1907.11329 (2019) - [i12]Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. IACR Cryptol. ePrint Arch. 2019: 868 (2019) - [i11]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? IACR Cryptol. ePrint Arch. 2019: 1094 (2019) - [i10]Ran Cohen, Juan A. Garay, Vassilis Zikas:
Broadcast-Optimal Two-Round MPC. IACR Cryptol. ePrint Arch. 2019: 1183 (2019) - [i9]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. IACR Cryptol. ePrint Arch. 2019: 1344 (2019) - 2018
- [j2]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptol. 31(2): 587-609 (2018) - [c8]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? CRYPTO (3) 2018: 243-272 - [c7]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. SCN 2018: 216-234 - [i8]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? IACR Cryptol. ePrint Arch. 2018: 540 (2018) - [i7]Ran Cohen, Abhi Shelat, Daniel Wichs:
Adaptively Secure MPC with Sublinear Communication Complexity. IACR Cryptol. ePrint Arch. 2018: 1161 (2018) - 2017
- [j1]Ran Cohen, Yehuda Lindell:
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. J. Cryptol. 30(4): 1157-1186 (2017) - [c6]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. ICALP 2017: 37:1-37:15 - [i6]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2017: 364 (2017) - 2016
- [c5]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Probabilistic Termination and Composability of Cryptographic Protocols. CRYPTO (3) 2016: 240-269 - [c4]Ran Cohen:
Asynchronous Secure Multiparty Computation in Constant Time. Public Key Cryptography (2) 2016: 183-207 - [c3]Ran Cohen, Chris Peikert:
On Adaptively Secure Multiparty Computation with a Short CRS. SCN 2016: 129-146 - [c2]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. TCC (A1) 2016: 596-616 - [i5]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Probabilistic Termination and Composability of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2016: 350 (2016) - [i4]Ran Cohen, Chris Peikert:
On Adaptively Secure Multiparty Computation with a Short CRS. IACR Cryptol. ePrint Arch. 2016: 976 (2016) - 2015
- [i3]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2015: 846 (2015) - [i2]Ran Cohen:
Asynchronous Secure Multiparty Computation in Constant Time. IACR Cryptol. ePrint Arch. 2015: 1238 (2015) - 2014
- [c1]Ran Cohen, Yehuda Lindell:
Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation. ASIACRYPT (2) 2014: 466-485 - [i1]Ran Cohen, Yehuda Lindell:
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 668 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 21:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
