Characterizing pseudoentropy and simplifying pseudorandom generator constructions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 817-836

  Vadhan, Salil ^a,b,c   Zheng, Colin Jia ^a,c  

^a HARVARD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

computational complexity; cryptography; entropy; hardcore lemma; kl divergence; min max theorem; pseudorandomness

Indexed keywords

DISTRIBUTED RANDOM VARIABLES; HARDCORE LEMMA; KL-DIVERGENCE; LIST-DECODING; MIN-ENTROPY; MIN-MAX THEOREM; ONE-WAY FUNCTIONS; POLYNOMIAL-TIME; PSEUDORANDOM GENERATOR CONSTRUCTION; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS; RANDOMNESS EXTRACTORS; SHANNON ENTROPY; UNIVERSAL HASH FUNCTION;

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ENTROPY; HASH FUNCTIONS; RANDOM PROCESSES; RANDOM VARIABLES;

COMPUTATION THEORY;

EID: 84862597879     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214051     Document Type: Conference Paper

References (16)

1. Boaz Barak, Moritz Hardt, and Satyen Kale. The uniform hardcore lemma via approximate bregman projections. In SODA '09: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, pages 1193-1200, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
2. Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo random bits. pages 112-117, 1982.
3. Boaz Barak, Ronen Shaltiel, and Avi Wigderson. Computational analogues of entropy. In RANDOM-APPROX, pages 200-215, 2003.
4. Thomas M. Cover and Joy A. Thomas. Elements of information theory (2. ed.). Wiley, 2006.
5. Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, and Adam Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput., 38(1):97-139, 2008.
6. Benjamin Fuller and Leonid Reyzin. Computational entropy and information leakage. 2011. (available at http://www.cs.bu.edu/fac/reyzin).
7. Rosario Gennaro, Yael Gertner, Jonathan Katz, and Luca Trevisan. Bounds on the efficiency of generic cryptographic constructions. SIAM Journal on Computing, 35(1):217-246, 2005.
8. Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 25-32, Seattle, Washington, 15-17 May 1989.
9. Oded Goldreich and Bernd Meyer. Computational indistinguishability: algorithms vs. circuits. Theoretical Computer Science, 191(1-2):215-218, 1998.
10. Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, April 1984.
11. Oded Goldreich. Computational Complexity: A Conceptual Perspective. 2006.
12. Oded Goldreich and Salil Vadhan. Comparing entropies in statistical zero knowledge with applications to the structure of szk. In In Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, pages 54-73. IEEE Computer Society Press, 1998.
13. Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, and Hoeteck Wee. Universal one-way hash functions via inaccessible entropy. In EUROCRYPT, pages 616-637, 2010.
14. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364-1396 (electronic), 1999.
15. Chun-Yuan Hsiao, Chi-Jen Lu, and Leonid Reyzin. Conditional computational entropy, or toward separating pseudoentropy from compressibility. In EUROCRYPT, pages 169-186, 2007.
16. Thomas Holenstein. Key agreement from weak bit agreement. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 664-673, 2005.