Leonid Reyzin

Leonid Reyzin

Boston University

H-index: 47

North America-United States

About Leonid Reyzin

Leonid Reyzin, With an exceptional h-index of 47 and a recent h-index of 33 (since 2020), a distinguished researcher at Boston University, specializes in the field of Cryptography.

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

RFC 9381 Verifiable Random Functions (VRFs)

Approximate Lower Bound Arguments

Proofs of Space with Maximal Hardness

Aardvark: An asynchronous authenticated dictionary with applications to account-based cryptocurrencies

Request for Information (RFI) on Advancing Privacy Enhancing Technologies

Turning HATE into LOVE: compact homomorphic ad hoc threshold encryption for scalable MPC

Compact certificates of collective knowledge

Reusable fuzzy extractors for low-entropy distributions

Leonid Reyzin Information

University

Position

Associate Professor of Computer Science

Citations(all)

12381

Citations(since 2020)

4107

Cited By

10024

hIndex(all)

47

hIndex(since 2020)

33

i10Index(all)

79

i10Index(since 2020)

58

Email

University Profile Page

Boston University

Google Scholar

View Google Scholar Profile

Leonid Reyzin Skills & Research Interests

Cryptography

Top articles of Leonid Reyzin

Title

Journal

Author(s)

Publication Date

RFC 9381 Verifiable Random Functions (VRFs)

S Goldberg

L Reyzin

D Papadopoulos

J Včelák

2023/8

Approximate Lower Bound Arguments

Cryptology ePrint Archive

Pyrros Chaidos

Aggelos Kiayias

Leonid Reyzin

Anatoliy Zinovyev

2023

Proofs of Space with Maximal Hardness

Cryptology ePrint Archive

Leonid Reyzin

2023

Aardvark: An asynchronous authenticated dictionary with applications to account-based cryptocurrencies

Derek Leung

Yossi Gilad

Sergey Gorbunov

Leonid Reyzin

Nickolai Zeldovich

2022

Request for Information (RFI) on Advancing Privacy Enhancing Technologies

Ran Canetti

Gabe Kaptchuk

Leonid Reyzin

Adam Smith

Mayank Varia

2022/7/8

Turning HATE into LOVE: compact homomorphic ad hoc threshold encryption for scalable MPC

Leonid Reyzin

Adam Smith

Sophia Yakoubov

2021/7/1

Compact certificates of collective knowledge

Silvio Micali

Leonid Reyzin

Georgios Vlachos

Riad S Wahby

Nickolai Zeldovich

2021/5/24

Reusable fuzzy extractors for low-entropy distributions

Journal of Cryptology

Ran Canetti

Benjamin Fuller

Omer Paneth

Leonid Reyzin

Adam Smith

2021/1

Pointproofs: Aggregating proofs for multiple vector commitments

Sergey Gorbunov

Leonid Reyzin

Hoeteck Wee

Zhenfei Zhang

2020/10/30

When are fuzzy extractors possible?

IEEE Transactions on Information Theory

Benjamin Fuller

Leonid Reyzin

Adam Smith

2020/4/1

Aardvark: A Concurrent Authenticated Dictionary with Short Proofs.

IACR Cryptol. ePrint Arch.

Derek Leung

Yossi Gilad

Sergey Gorbunov

Leonid Reyzin

Nickolai Zeldovich

2020

Can a public blockchain keep a secret?

Fabrice Benhamouda

Craig Gentry

Sergey Gorbunov

Shai Halevi

Hugo Krawczyk

...

2020

Computational fuzzy extractors

Information and Computation

Benjamin Fuller

Xianrui Meng

Leonid Reyzin

2020/12/1

See List of Professors in Leonid Reyzin University(Boston University)

Co-Authors

H-index: 86
Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

H-index: 73
Yevgeniy Dodis

Yevgeniy Dodis

New York University

H-index: 67
Vinod Vaikuntanathan

Vinod Vaikuntanathan

Massachusetts Institute of Technology

H-index: 60
Adam Smith

Adam Smith

Boston University

H-index: 47
George Kollios

George Kollios

Boston University

H-index: 46
Michel Abdalla

Michel Abdalla

École Normale Supérieure

academic-engine