Leonid Reyzin

According to our database1, Leonid Reyzin authored at least 110 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

A Survey of Leakage-Resilient Cryptography.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2018

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

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

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

Certifying RSA Public Keys with an Efficient NIZK.
IACR Cryptology ePrint Archive, 2018

A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures.
Proceedings of the Public-Key Cryptography - PKC 2018, 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

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption.
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

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017
Can NSEC5 be practical for DNSSEC deployments?
IACR Cryptology ePrint Archive, 2017

Fuzzy Authenticated Key Exchange.
IACR Cryptology ePrint Archive, 2017

Accumulators with Applications to Anonymity-Preserving Revocation.
IACR Cryptology ePrint Archive, 2017

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

Improving Authenticated Dynamic Dictionaries, with Applications to Cryptocurrencies.
Proceedings of the Financial Cryptography and Data Security, 2017

Accumulators with Applications to Anonymity-Preserving Revocation.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

Scrypt Is Maximally Memory-Hard.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Improving Authenticated Dynamic Dictionaries, with Applications to Cryptocurrencies.
IACR Cryptology ePrint Archive, 2016

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

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

Scrypt is Maximally Memory-Hard.
IACR Cryptology ePrint Archive, 2016

On the Correlation Intractability of Obfuscated Pseudorandom Functions.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Efficient Asynchronous Accumulators for Distributed PKI.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Reusable Fuzzy Extractors for Low-Entropy Distributions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

When Are Fuzzy Extractors Possible?
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

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

Efficient Asynchronous Accumulators for Distributed PKI.
IACR Cryptology ePrint Archive, 2015

On the Correlation Intractability of Obfuscated Pseudorandom Functions.
IACR Cryptology ePrint Archive, 2015

NSEC5: Provably Preventing DNSSEC Zone Enumeration.
Proceedings of the 22nd Annual Network and Distributed System Security Symposium, 2015

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

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

Sequential aggregate signatures with lazy verification from trapdoor permutations.
Inf. Comput., 2014

NSEC5: Provably Preventing DNSSEC Zone Enumeration.
IACR Cryptology ePrint Archive, 2014

Where are Fuzzy Extractors Possible?
IACR Cryptology ePrint Archive, 2014

Key Derivation From Noisy Sources With More Errors Than Entropy.
IACR Cryptology ePrint Archive, 2014

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

Amplifying Privacy in Privacy Amplification.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

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

Computational Fuzzy Extractors.
IACR Cryptology ePrint Archive, 2013

Amplifying Privacy in Privacy Amplification.
IACR Cryptology ePrint Archive, 2013

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

Computational Fuzzy Extractors.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

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

Computational Entropy and Information Leakage.
IACR Cryptology ePrint Archive, 2012

A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy.
IACR Cryptology ePrint Archive, 2012

Privacy Amplification with Asymptotically Optimal Entropy Loss.
IACR Cryptology ePrint Archive, 2012

A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 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 Cryptology ePrint Archive, 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

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.
IACR Cryptology ePrint Archive, 2010

Privacy amplification with asymptotically optimal entropy loss.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 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. Cryptology, 2009

Protecting Circuits from Computationally-Bounded Leakage.
IACR Cryptology ePrint Archive, 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

Key Agreement from Close Secrets over Unsecured Channels.
Proceedings of the Advances in Cryptology, 2009

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

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
SIAM J. Comput., 2008

Key Agreement from Close Secrets over Unsecured Channels.
IACR Cryptology ePrint Archive, 2008

An Improved Robust Fuzzy Extractor.
IACR Cryptology ePrint Archive, 2008

An Improved Robust Fuzzy Extractor
CoRR, 2008

Upper and Lower Bounds on Black-Box Steganography
CoRR, 2008

Saving Private Randomness in One-Way Functions and Pseudorandom Generators.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

An Improved Robust Fuzzy Extractor.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

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

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

2006
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
CoRR, 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

2005
Upper and Lower Bounds on Black-Box Steganography.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Mercurial Commitments with Applications to Zero-Knowledge Sets.
Proceedings of the Advances in Cryptology, 2005

2004
Upper and Lower Bounds on Black-Box Steganography.
IACR Cryptology ePrint Archive, 2004

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

Sequential Aggregate Signatures from Trapdoor Permutations.
Proceedings of the Advances in Cryptology, 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 Cryptology ePrint Archive, 2003

Physically Observable Cryptography.
IACR Cryptology ePrint Archive, 2003

Sequential Aggregate Signatures from Trapdoor Permutations.
IACR Cryptology ePrint Archive, 2003

Breaking and Repairing Optimistic Fair Exchange from PODC 2003.
IACR Cryptology ePrint Archive, 2003

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

Breaking and repairing optimistic fair exchange from PODC 2003.
Proceedings of the 2003 ACM workshop on Digital rights management 2003, Washington, 2003

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

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

Forward-Secure Signatures with Fast Key Update.
IACR Cryptology ePrint Archive, 2002

SiBIR: Signer-Base Intrusion-Resilient Signatures.
IACR Cryptology ePrint Archive, 2002

On the Power of Claw-Free Permutations.
IACR Cryptology ePrint Archive, 2002

An Improved Pseudorandom Generator Based on Hardness of Factoring.
IACR Cryptology ePrint Archive, 2002

Forward-Secure Signatures with Fast Key Update.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

On the Power of Claw-Free Permutations.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

An Improved Pseudorandom Generator Based on Hardness of Factoring.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

SiBIR: Signer-Base Intrusion-Resilient Signatures.
Proceedings of the Advances in Cryptology, 2002

Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying.
Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002

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

Forward-Secure Signatures with Optimal Signing and Verifying.
IACR Cryptology ePrint Archive, 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

Forward-Secure Signatures with Optimal Signing and Verifying.
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 Cryptology ePrint Archive, 2000

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

A New Forward-Secure Digital Signature Scheme.
Proceedings of the Advances in Cryptology, 2000

1999
Improving the Exact Security of Digital Signature Schemes.
IACR Cryptology ePrint Archive, 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...