Leonid Reyzin

Affiliations:
  • Boston University, USA


According to our database1, Leonid Reyzin authored at least 79 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Reusable Fuzzy Extractors for Low-Entropy Distributions.
J. Cryptol., 2021

Turning HATE into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2021

2020
When Are Fuzzy Extractors Possible?
IEEE Trans. Inf. Theory, 2020

Compact Certificates of Collective Knowledge.
IACR Cryptol. ePrint Arch., 2020

Aardvark: A Concurrent Authenticated Dictionary with Short Proofs.
IACR Cryptol. ePrint Arch., 2020

Pointproofs: Aggregating Proofs for Multiple Vector Commitments.
IACR Cryptol. ePrint Arch., 2020

Can a Blockchain Keep a Secret?
IACR Cryptol. ePrint Arch., 2020

Can a Public Blockchain Keep a Secret?
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols.
Proc. VLDB Endow., 2019

A Survey of Leakage-Resilient Cryptography.
IACR Cryptol. ePrint Arch., 2019

Efficient Noninteractive Certification of RSA Moduli and Beyond.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

A survey of leakage-resilient cryptography.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018
Turning HATE Into LOVE: Homomorphic Ad Hoc Threshold Encryption for Scalable MPC.
IACR Cryptol. ePrint Arch., 2018

A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2018

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption.
IACR Cryptol. ePrint Arch., 2018

A Comparative Evaluation of Order-Preserving and Order-Revealing Schemes and Protocols.
IACR Cryptol. ePrint Arch., 2018

Certifying RSA Public Keys with an Efficient NIZK.
IACR Cryptol. ePrint Arch., 2018

Fuzzy Password-Authenticated Key Exchange.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Can NSEC5 be practical for DNSSEC deployments?
IACR Cryptol. ePrint Arch., 2017

Fuzzy Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2017

Accumulators with Applications to Anonymity-Preserving Revocation.
IACR Cryptol. ePrint Arch., 2017

Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space.
IACR Cryptol. ePrint Arch., 2017

2016
Improving Authenticated Dynamic Dictionaries, with Applications to Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2016

NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses.
IACR Cryptol. ePrint Arch., 2016

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
IACR Cryptol. ePrint Arch., 2016

Scrypt is Maximally Memory-Hard.
IACR Cryptol. ePrint Arch., 2016

2015
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy.
J. Cryptol., 2015

Efficient Asynchronous Accumulators for Distributed PKI.
IACR Cryptol. ePrint Arch., 2015

On the Correlation Intractability of Obfuscated Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2015

2014
Protecting Circuits from Computationally Bounded and Noisy Leakage.
SIAM J. Comput., 2014

Privacy amplification with asymptotically optimal entropy loss.
J. ACM, 2014

NSEC5: Provably Preventing DNSSEC Zone Enumeration.
IACR Cryptol. ePrint Arch., 2014

Where are Fuzzy Extractors Possible?
IACR Cryptol. ePrint Arch., 2014

Key Derivation From Noisy Sources With More Errors Than Entropy.
IACR Cryptol. ePrint Arch., 2014

From the consent of the routed: improving the transparency of the RPKI.
Proceedings of the ACM SIGCOMM 2014 Conference, 2014

2013
Mercurial Commitments with Applications to Zero-Knowledge Sets.
J. Cryptol., 2013

Computational Fuzzy Extractors.
IACR Cryptol. ePrint Arch., 2013

Amplifying Privacy in Privacy Amplification.
IACR Cryptol. ePrint Arch., 2013

On the risk of misbehaving RPKI authorities.
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks, 2013

2012
Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets.
IEEE Trans. Inf. Theory, 2012

Computational Entropy and Information Leakage.
IACR Cryptol. ePrint Arch., 2012

Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations - (Extended Abstract).
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2011

Some Notions of Entropy for Cryptography - (Invited Talk).
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

2010
Authenticated Index Structures for Aggregation Queries.
ACM Trans. Inf. Syst. Secur., 2010

Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009
Upper and Lower Bounds on Black-Box Steganography.
J. Cryptol., 2009

Protecting Circuits from Computationally-Bounded Leakage.
IACR Cryptol. ePrint Arch., 2009

Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6.
Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

2008
Authenticated Index Structures for Outsourced Databases.
Proceedings of the Handbook of Database Security - Applications and Trends, 2008

Key Agreement from Close Secrets over Unsecured Channels.
IACR Cryptol. ePrint Arch., 2008

An Improved Robust Fuzzy Extractor.
IACR Cryptol. ePrint Arch., 2008

2007
Saving Private Randomness in One-Way Functions and Pseudorandom Generators.
IACR Cryptol. ePrint Arch., 2007

Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility.
Proceedings of the Advances in Cryptology, 2007

2006
Dynamic authenticated index structures for outsourced databases.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.
Proceedings of the Advances in Cryptology, 2006

2004
Physically Observable Cryptography (Extended Abstract).
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
Proceedings of the Advances in Cryptology, 2004

Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Proceedings of the Advances in Cryptology, 2004

2003
Simple Stateless Steganography.
IACR Cryptol. ePrint Arch., 2003

Physically Observable Cryptography.
IACR Cryptol. ePrint Arch., 2003

Sequential Aggregate Signatures from Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2003

Breaking and Repairing Optimistic Fair Exchange from PODC 2003.
IACR Cryptol. ePrint Arch., 2003

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
IACR Cryptol. ePrint Arch., 2003

2002
Improving the Exact Security of Digital Signature Schemes.
J. Cryptol., 2002

Better than BiBa: Short One-time Signatures with Fast Signing and Verifying.
IACR Cryptol. ePrint Arch., 2002

Forward-Secure Signatures with Fast Key Update.
IACR Cryptol. ePrint Arch., 2002

SiBIR: Signer-Base Intrusion-Resilient Signatures.
IACR Cryptol. ePrint Arch., 2002

On the Power of Claw-Free Permutations.
IACR Cryptol. ePrint Arch., 2002

An Improved Pseudorandom Generator Based on Hardness of Factoring.
IACR Cryptol. ePrint Arch., 2002

2001
Zero-knowledge with public keys.
PhD thesis, 2001

Forward-Secure Signatures with Optimal Signing and Verifying.
IACR Cryptol. ePrint Arch., 2001

Min-round Resettable Zero-Knowledge in the Public-Key Model.
Proceedings of the Advances in Cryptology, 2001

Soundness in the Public-Key Model.
Proceedings of the Advances in Cryptology, 2001

Accountable-subgroup multisignatures: extended abstract.
Proceedings of the CCS 2001, 2001

Mutually Independent Commitments.
Proceedings of the Advances in Cryptology, 2001

2000
A New Forward-Secure Digital Signature Scheme.
IACR Cryptol. ePrint Arch., 2000

On the Round Security of Symmetric-Key Cryptographic Primitives.
Proceedings of the Advances in Cryptology, 2000

1999
Improving the Exact Security of Fiat-Shamir Signature Schemes.
Proceedings of the Secure Networking - CQRE (Secure) '99, International Exhibition and Congress Düsseldorf, Germany, November 30, 1999


  Loading...