Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Leonid Reyzin
2010 – today
- 2013
[j6]Melissa Chase, Alexander Healy, Anna Lysyanskaya, Tal Malkin, Leonid Reyzin: Mercurial Commitments with Applications to Zero-Knowledge Sets. J. Cryptology 26(2): 251-279 (2013)- 2012
[j5]Yevgeniy Dodis, Bhavana Kanukurthi, Jonathan Katz, Leonid Reyzin, Adam Smith: Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets. IEEE Transactions on Information Theory 58(9): 6207-6222 (2012)
[c32]Kyle Brogle, Sharon Goldberg, Leonid Reyzin: Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations - (Extended Abstract). ASIACRYPT 2012: 644-662
[c31]Benjamin Fuller, Adam O'Neill, Leonid Reyzin: A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. TCC 2012: 582-599
[i25]Benjamin Fuller, Adam O'Neill, Leonid Reyzin: A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. IACR Cryptology ePrint Archive 2012: 5 (2012)
[i24]Benjamin Fuller, Leonid Reyzin: Computational Entropy and Information Leakage. IACR Cryptology ePrint Archive 2012: 466 (2012)
[i23]Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin: Privacy Amplification with Asymptotically Optimal Entropy Loss. IACR Cryptology ePrint Archive 2012: 501 (2012)- 2011
[c30]
[i22]Kyle Brogle, Sharon Goldberg, Leonid Reyzin: Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations. IACR Cryptology ePrint Archive 2011: 222 (2011)- 2010
[j4]Feifei Li, Marios Hadjieleftheriou, George Kollios, Leonid Reyzin: Authenticated Index Structures for Aggregation Queries. ACM Trans. Inf. Syst. Secur. 13(4): 32 (2010)
[c29]Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan: Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases. EUROCRYPT 2010: 135-156
[c28]Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin: Privacy amplification with asymptotically optimal entropy loss. STOC 2010: 785-794
[i21]Yevgeniy Dodis, Bhavana Kanukurthi, Jonathan Katz, Leonid Reyzin, Adam Smith: Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. IACR Cryptology ePrint Archive 2010: 456 (2010)
2000 – 2009
- 2009
[j3]Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell: Upper and Lower Bounds on Black-Box Steganography. J. Cryptology 22(3): 365-394 (2009)
[c27]Bhavana Kanukurthi, Leonid Reyzin: Key Agreement from Close Secrets over Unsecured Channels. EUROCRYPT 2009: 206-223
[c26]Yevgeniy Dodis, Leonid Reyzin, Ronald L. Rivest, Emily Shen: Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6. FSE 2009: 104-121
[i20]Sebastian Faust, Leonid Reyzin, Eran Tromer: Protecting Circuits from Computationally-Bounded Leakage. IACR Cryptology ePrint Archive 2009: 379 (2009)- 2008
[j2]Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. SIAM J. Comput. 38(1): 97-139 (2008)
[c25]
[c24]Nenad Dedic, Danny Harnik, Leonid Reyzin: Saving Private Randomness in One-Way Functions and Pseudorandom Generators. TCC 2008: 607-625
[p1]Feifei Li, Marios Hadjieleftheriou, George Kollios, Leonid Reyzin: Authenticated Index Structures for Outsourced Databases. Handbook of Database Security 2008: 115-136
[i19]Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell: Upper and Lower Bounds on Black-Box Steganography. CoRR abs/0806.0837 (2008)
[i18]
[i17]Bhavana Kanukurthi, Leonid Reyzin: An Improved Robust Fuzzy Extractor. IACR Cryptology ePrint Archive 2008: 278 (2008)
[i16]Bhavana Kanukurthi, Leonid Reyzin: Key Agreement from Close Secrets over Unsecured Channels. IACR Cryptology ePrint Archive 2008: 494 (2008)- 2007
[c23]Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility. EUROCRYPT 2007: 169-186
[i15]Nenad Dedic, Danny Harnik, Leonid Reyzin: Saving Private Randomness in One-Way Functions and Pseudorandom Generators. IACR Cryptology ePrint Archive 2007: 458 (2007)- 2006
[c22]Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam Smith: Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. CRYPTO 2006: 232-250
[c21]Feifei Li, Marios Hadjieleftheriou, George Kollios, Leonid Reyzin: Dynamic authenticated index structures for outsourced databases. SIGMOD Conference 2006: 121-132
[i14]Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. CoRR abs/cs/0602007 (2006)- 2005
[c20]Melissa Chase, Alexander Healy, Anna Lysyanskaya, Tal Malkin, Leonid Reyzin: Mercurial Commitments with Applications to Zero-Knowledge Sets. EUROCRYPT 2005: 422-439
[c19]Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell: Upper and Lower Bounds on Black-Box Steganography. TCC 2005: 227-244- 2004
[c18]Chun-Yuan Hsiao, Leonid Reyzin: Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? CRYPTO 2004: 92-105
[c17]Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham: Sequential Aggregate Signatures from Trapdoor Permutations. EUROCRYPT 2004: 74-90
[c16]Yevgeniy Dodis, Leonid Reyzin, Adam Smith: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. EUROCRYPT 2004: 523-540
[c15]Silvio Micali, Leonid Reyzin: Physically Observable Cryptography (Extended Abstract). TCC 2004: 278-296
[i13]Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell: Upper and Lower Bounds on Black-Box Steganography. IACR Cryptology ePrint Archive 2004: 246 (2004)- 2003
[c14]Yevgeniy Dodis, Leonid Reyzin: Breaking and repairing optimistic fair exchange from PODC 2003. Digital Rights Management Workshop 2003: 47-54
[i12]Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham: Sequential Aggregate Signatures from Trapdoor Permutations. IACR Cryptology ePrint Archive 2003: 91 (2003)
[i11]Leonid Reyzin, Scott Russell: Simple Stateless Steganography. IACR Cryptology ePrint Archive 2003: 93 (2003)
[i10]Silvio Micali, Leonid Reyzin: Physically Observable Cryptography. IACR Cryptology ePrint Archive 2003: 120 (2003)
[i9]Yevgeniy Dodis, Leonid Reyzin: Breaking and Repairing Optimistic Fair Exchange from PODC 2003. IACR Cryptology ePrint Archive 2003: 146 (2003)
[i8]Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. IACR Cryptology ePrint Archive 2003: 235 (2003)- 2002
[j1]Silvio Micali, Leonid Reyzin: Improving the Exact Security of Digital Signature Schemes. J. Cryptology 15(1): 1-18 (2002)
[c13]Leonid Reyzin, Natan Reyzin: Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying. ACISP 2002: 144-153
[c12]
[c11]
[c10]Nenad Dedic, Leonid Reyzin, Salil P. Vadhan: An Improved Pseudorandom Generator Based on Hardness of Factoring. SCN 2002: 88-101
[c9]
[i7]Leonid Reyzin, Natan Reyzin: Better than BiBa: Short One-time Signatures with Fast Signing and Verifying. IACR Cryptology ePrint Archive 2002: 14 (2002)
[i6]Gene Itkis, Leonid Reyzin: SiBIR: Signer-Base Intrusion-Resilient Signatures. IACR Cryptology ePrint Archive 2002: 54 (2002)
[i5]Yevgeniy Dodis, Leonid Reyzin: On the Power of Claw-Free Permutations. IACR Cryptology ePrint Archive 2002: 103 (2002)
[i4]Anton Kozlov, Leonid Reyzin: Forward-Secure Signatures with Fast Key Update. IACR Cryptology ePrint Archive 2002: 104 (2002)
[i3]Nenad Dedic, Leonid Reyzin, Salil P. Vadhan: An Improved Pseudorandom Generator Based on Hardness of Factoring. IACR Cryptology ePrint Archive 2002: 131 (2002)- 2001
[c8]Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith: Mutually Independent Commitments. ASIACRYPT 2001: 385-401
[c7]Silvio Micali, Kazuo Ohta, Leonid Reyzin: Accountable-subgroup multisignatures: extended abstract. ACM Conference on Computer and Communications Security 2001: 245-254
[c6]Gene Itkis, Leonid Reyzin: Forward-Secure Signatures with Optimal Signing and Verifying. CRYPTO 2001: 332-354
[c5]
[c4]Silvio Micali, Leonid Reyzin: Min-round Resettable Zero-Knowledge in the Public-Key Model. EUROCRYPT 2001: 373-393
[i2]Gene Itkis, Leonid Reyzin: Forward-Secure Signatures with Optimal Signing and Verifying. IACR Cryptology ePrint Archive 2001: 48 (2001)- 2000
[c3]Michel Abdalla, Leonid Reyzin: A New Forward-Secure Digital Signature Scheme. ASIACRYPT 2000: 116-129
[c2]Zulfikar Ramzan, Leonid Reyzin: On the Round Security of Symmetric-Key Cryptographic Primitives. CRYPTO 2000: 376-393
[i1]Michel Abdalla, Leonid Reyzin: A New Forward-Secure Digital Signature Scheme. IACR Cryptology ePrint Archive 2000: 2 (2000)
1990 – 1999
- 1999
[c1]Silvio Micali, Leonid Reyzin: Improving the Exact Security of Fiat-Shamir Signature Schemes. CQRE 1999: 167-182
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-27 20:25 CET by the dblp team



