Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Reyzin, Leonid - Department of Computer Science, Boston University
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Mutually Independent Commitments Moses Liskov 1 , Anna Lysyanskaya 1 , Silvio Micali 1 ,
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility #
Some Notions of Entropy for Cryptography Leonid Reyzin
An Improved Pseudorandom Generator Based on Hardness of Factoring
Mutually Independent Commitments Moses Liskov1
Computational Entropy and Information Leakage Benjamin Fuller Leonid Reyzin
Mercurial Commitments with Applications to Zero-Knowledge Sets Melissa Chase
Syndrome Encoding and Decoding of BCH Codes in Sublinear Excerpted from Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Indi#erentiability of PermutationBased Compression Functions and TreeBased Modes
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
ForwardSecure Signatures with Fast Key Update Anton Kozlov Leonid Reyzin
Verifying Membership in NPlanguages, or How to Avoid Reading Long Proofs
Fuzzy Extractors # A Brief Survey of Results from 2004 to 2006
Minentropy and its Variations for Cryptography
Sequential Aggregate Signatures from Trapdoor Permutations Anna Lysyanskaya # Silvio Micali + Leonid Reyzin # Hovav Shacham
Forward-Secure Signatures with Fast Key Update Anton Kozlov Leonid Reyzin
Fuzzy Extractors A Brief Survey of Results from 2004 to 2006
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
Breaking and Repairing Optimistic Fair Exchange from PODC 2003 Yevgeniy Dodis
Verifying Membership in NP-languages, or How to Avoid Reading Long Proofs
On the Power of ClawFree Permutations Yevgeniy Dodis # Leonid Reyzin +
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Mercurial Commitments with Applications to ZeroKnowledge Sets # Melissa Chase + Alexander Healy # Anna Lysyanskaya Tal Malkin Leonid Reyzin #
An Improved Pseudorandom Generator Based on Hardness of Factoring
Signing with Partially Adversarial Hashing Silvio Micali Leonid Reyzin
Breaking and Repairing Optimistic Fair Exchange from PODC 2003 Yevgeniy Dodis # Leonid Reyzin +
Sequential Aggregate Signatures from Trapdoor Permutations Anna Lysyanskaya
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes
On the Power of Claw-Free Permutations Yevgeniy Dodis