Ran Cohen

About Ran Cohen

Ran Cohen, With an exceptional h-index of 12 and a recent h-index of 12 (since 2020), a distinguished researcher at North Eastern University, specializes in the field of Cryptography, Distributed Computing, Secure multiparty Computation.

His recent articles reflect a diverse array of research interests and contributions to the field:

Breaking the -Bit Barrier: Byzantine Agreement with Polylog Bits Per Party

Concurrent asynchronous byzantine agreement in expected-constant rounds, revisited

Topology-hiding communication from minimal assumptions

Communication Lower Bounds for Cryptographic Broadcast Protocols

Completeness theorems for adaptively secure broadcast

On the power of an honest majority in three-party computation without broadcast

Must the communication graph of MPC protocols be an expander?

Adaptively Secure MPC with Sublinear Communication Complexity

Ran Cohen Information

University

Position

___

Citations(all)

425

Citations(since 2020)

380

Cited By

186

hIndex(all)

12

hIndex(since 2020)

12

i10Index(all)

12

i10Index(since 2020)

12

Email

University Profile Page

Google Scholar

Ran Cohen Skills & Research Interests

Cryptography

Distributed Computing

Secure multiparty Computation

Top articles of Ran Cohen

Breaking the -Bit Barrier: Byzantine Agreement with Polylog Bits Per Party

Journal of Cryptology

2024/3

Ran Cohen
Ran Cohen

H-Index: 7

Concurrent asynchronous byzantine agreement in expected-constant rounds, revisited

2023/11/27

Ran Cohen
Ran Cohen

H-Index: 7

Topology-hiding communication from minimal assumptions

Journal of Cryptology

2023/10

Communication Lower Bounds for Cryptographic Broadcast Protocols

arXiv preprint arXiv:2309.01466

2023/9/4

Erica Blum
Erica Blum

H-Index: 4

Ran Cohen
Ran Cohen

H-Index: 7

Completeness theorems for adaptively secure broadcast

2023/8/9

Ran Cohen
Ran Cohen

H-Index: 7

On the power of an honest majority in three-party computation without broadcast

Journal of Cryptology

2023/7

Ran Cohen
Ran Cohen

H-Index: 7

Must the communication graph of MPC protocols be an expander?

Journal of Cryptology

2023/7

Adaptively Secure MPC with Sublinear Communication Complexity

Journal of Cryptology

2023/4

Ran Cohen
Ran Cohen

H-Index: 7

Daniel Wichs
Daniel Wichs

H-Index: 37

Efficient Agreement Over Byzantine Gossip

Cryptology ePrint Archive

2023

Secure Multiparty Computation with Identifiable Abort from Vindicating Release

Cryptology ePrint Archive

2023

Ran Cohen
Ran Cohen

H-Index: 7

Jack Doerner
Jack Doerner

H-Index: 7

Locally Verifiable Distributed SNARGs

2023/11/27

Ran Cohen
Ran Cohen

H-Index: 7

Tal Moran
Tal Moran

H-Index: 8

Guaranteed Output in Rounds for Round-Robin Sampling Protocols

2022/5/25

Ran Cohen
Ran Cohen

H-Index: 7

Jack Doerner
Jack Doerner

H-Index: 7

Multiparty generation of an RSA modulus

Journal of Cryptology

2022/4

On the round complexity of randomized byzantine agreement

Journal of Cryptology

2022/4

Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW

Cryptology ePrint Archive

2022

Gilad Asharov
Gilad Asharov

H-Index: 17

Ran Cohen
Ran Cohen

H-Index: 7

From fairness to full security in multiparty computation

Journal of Cryptology

2022/1

Round-preserving parallel composition of probabilistic-termination cryptographic protocols

Journal of Cryptology

2021/4

Ran Cohen
Ran Cohen

H-Index: 7

Broadcast-optimal two-round MPC

2020

Ran Cohen
Ran Cohen

H-Index: 7

See List of Professors in Ran Cohen University(North Eastern University)

Co-Authors

academic-engine