Leonid Reyzin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Leonid Reyzin has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Benjamin Fuller
Connecticut Voting Technology Research Center, University of Connecticut, Storrs, Connecticut, USA
3 shared publications - Adam Smith
Pennsylvania State University
2 shared publications - Gene Itkis
Department of Computer Science Boston University 111 Cummington Street Boston 02215 MA
2 shared publications - Omer Paneth
Massachusetts Institute of Technology, Cambridge, USA
2 shared publications - Ran Canetti
Boston University, Boston, USA
2 shared publications - Scott Russell
Department of Computer Science Boston University 111 Cummington Street Boston 02215 MA
2 shared publications
Latest Publications
- 23 November 2020
- Published by Springer Nature in Journal of Cryptology
- Vol. 34 (1) , 1-33
Reusable Fuzzy Extractors for Low-Entropy Distributions
- 23 November 2020
- Published by Springer Nature in Journal of Cryptology
- Vol. 34 (1) , 1-33
Reusable Fuzzy Extractors for Low-Entropy Distributions
- 28 April 2016
- Published by Springer Nature
- p. 117-146
Reusable Fuzzy Extractors for Low-Entropy Distributions
- 28 April 2016
- Published by Springer Nature
- p. 117-146
Reusable Fuzzy Extractors for Low-Entropy Distributions
- 13 December 2013
- Published by Springer Nature in Journal of Cryptology
- Vol. 28 (3) , 671-717
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- 13 December 2013
- Published by Springer Nature in Journal of Cryptology
- Vol. 28 (3) , 671-717
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- 28 March 2012
- Published by Springer Nature in Journal of Cryptology
- Vol. 26 (2) , 251-279
Mercurial Commitments with Applications to Zero-Knowledge Sets
- 28 March 2012
- Published by Springer Nature in Journal of Cryptology
- Vol. 26 (2) , 251-279
Mercurial Commitments with Applications to Zero-Knowledge Sets
- Open Access
Upper and Lower Bounds on Black-Box Steganography
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negative side, we show that the number of samples the sender must obtain from the channel is exponential in the rate of the stegosystem. On the positive side, we present the first secret-key stegosystem that essentially matches this lower bound regardless of the entropy of the underlying channel. Furthermore, for high-entropy channels, we present the first secret-key stegosystem that matches this lower bound statelessly (i.e., without requiring synchronized state between sender and receiver).
Open AccessUpper and Lower Bounds on Black-Box Steganography
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negative side, we show that the number of samples the sender must obtain from the channel is exponential in the rate of the stegosystem. On the positive side, we present the first secret-key stegosystem that essentially matches this lower bound regardless of the entropy of the underlying channel. Furthermore, for high-entropy channels, we present the first secret-key stegosystem that matches this lower bound statelessly (i.e., without requiring synchronized state between sender and receiver).
- 8 April 2008
- Published by Springer Nature in Journal of Cryptology
- Vol. 22 (3) , 365-394
Upper and Lower Bounds on Black-Box Steganography
- 8 April 2008
- Published by Springer Nature in Journal of Cryptology
- Vol. 22 (3) , 365-394
Upper and Lower Bounds on Black-Box Steganography
- 1 January 2008
- Published by Springer Nature
- p. 115-136
Authenticated Index Structures for Outsourced Databases
- 1 January 2008
- Published by Springer Nature
- p. 115-136
Authenticated Index Structures for Outsourced Databases