Simple extractors via constructions of cryptographic pseudo-random generators

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 115-127

  Zimand, Marius ^a  

^a TOWSON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SCIENCE; POLYNOMIALS;

EXTRACTORS; PERMUTATIONS; PSEUDO-RANDOM GENERATORS;

CRYPTOGRAPHY;

EID: 26444474834     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_10     Document Type: Conference Paper

References (20)

1. [BM84] Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, November 1984.
2. [DM04] Stefan Dziembowski and Ueli Maurer. Optimal randomizer efficiency in the bounded-storage model. Journal of Cryptology, 17(1):5-26, January 2004. (Conference version appeared in Proc. of STOC'02.).
3. [GT00] R. Gennaro and L. Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, 2000.
4. [HILL99] J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. Construction of a pseudo-random generator from any one-way function. SIAM Journal on Computing, 28(4), 1999.
5. [HR03] T. Hartman and R. Raz. On the distribution of the number of roots of polynomials and explicit logspace extractors. Random Structures & Algorithms, 23(3):235-263, Oct. 2003.
6. [Imp96] R. Impagliazzo. Very strong one-way functions and pseudo-random generators exist relative to a random oracle, (manuscript), January 1996.
7. [IW97] Russell Impagliazzo and Avi Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC '97), pages 220-229, New York, May 1997. Association for Computing Machinery.
8. [Lu04] C.J. Lu. Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology, 17(1):27-42, January 2004.
9. [NW94] N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
10. [RRV99] R. Raz, O. Reingold, and S. Vadhan. Extracting all the randomness and reducing the error in trevisan's extractor. In Proceedings of the 30th ACM Symposium on Theory of Computing, pages 149-158. ACM Press, May 1999.
11. [Sha02] R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin EATCS, 77:67-95, June 2002.
12. [SU01] R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001.
13. [Tre99] L. Trevisan. Constructions of near-optimal extractors using pseudo-random generators. In Proceedings of the 30th ACM Symposium on Theory of Computing, pages 141-148. ACM Press, May 1999.
14. [Tre01] L. Trevisan. Extractors and pseudorandom generators. Journal of the ACM, 48(4):860-879, 2001.
15. [TSZ01] A. Ta-Shma and D. Zuckerman. Extractor codes. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 193-199, 2001.
16. [TSZS01] A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001.
17. [Vad04] S. Vadhan. On constructing locally computable extractors and cryptosystems in the bounded-storage model. J. of Cryptology, 17(1):43-77, January 2004.
18. [Yao82] A. Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.
19. [Zim04] Marius Zimand. Computational Complexity: A Quantitative Perspective. North-Holland Mathematics Studies, vol. 196. Elsevier, 2004.
20. [Zim05] Marius Zimand. Simple extractors via constructions of cryptographic pseudo-random generators. Technical Report 0501075, Computing Research Repository, January 2005. Available at http://arxiv.org/abs/cs.CC/ 0501075.