On pseudorandom generators with linear stretch in NC0

Computational Complexity

Volumn 17, Issue 1, 2008, Pages 38-69

  Applebaum, Benny ^a   Ishai, Yuval ^b   Kushilevitz, Eyal ^b  

^a Princeton University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Constant depth circuits; Cryptography; nc0; Pseudorandom generators

Indexed keywords

EID: 45049086177     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-007-0237-6     Document Type: Conference Paper

References (31)

1. M. ALEKHNOVICH (2003). More on average case vs approximation complexity. In Proc. 44th FOCS, 298-307.
2. N. ALON, L. BABAI & A. ITAI (1986). A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms 7(4), 567-583.
3. N. ALON & Y. ROICHMAN (1994). Random Cayley graphs and expanders. Random Struct. Algorithms 5(2), 271-285.
4. 0. SIAM J. Comput. 36(4), 845-888. Preliminary version in Proc. 45th FOCS, 2004.
5. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN & M. SZEGEDY (1998). Proof verification and hardness of approximation problems. J. of the ACM 45(3), 501-555. Preliminary version in Proc. 33rd FOCS, 1992.
6. S. ARORA & S. SAFRA (1998). Probabilistic checking of proofs: A new characterization of NP. J. of the ACM 45(1), 70-122. Preliminary version in Proc. 33rd FOCS, 1992.
7. B. BARAK, R. SHALTIEL & A. WIGDERSON (2003). Computational analogues of entropy. In Proc. 7th Conference on Randomization and Computation, (RANDOM).
8. A. BLUM, M. FURST, M. KEARNS & R. J. LIPTON (1994). Cryptographic primitives based on hard learning problems. In Advances in Cryptology: Proc. of CRYPTO '93, volume 773 of LNCS, 278-291.
9. M. BLUM & S. MICALI (1984). How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 850-864. Preliminary version in Proc. 23rd FOCS, 1982.
10. M. CAPALBO, O. REINGOLD, S. VADHAN & A. WIGDERSON (2002). Randomness conductors and constant-degree lossless expanders. In Proc. 34th STOC, 659-668.
11. 0. In Proc. 26th MFCS, 272-284.
12. Y. DODIS & A. SMITH (2005). Correcting errors without leaking partial information. In Proc. 37th STOC, 654-663.
13. U. FEIGE (2002). Relations between average case complexity and approximation complexity. In Proc. of 34th STOC, 534-543.
14. O. GOLDREICH (2000). Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC) 7(090).
15. O. GOLDREICH (2001a). Foundations of cryptography: Basic tools. Cambridge University Press.
16. O. GOLDREICH (2001b). Randomized methods in computation - Lecture notes. http://www.wisdom.weizmann.ac.il/~oded/rnd.html. O. GOLDREICH (2004). Foundations of cryptography: Basic applications. Cambridge University Press.
17. O. GOLDREICH, H. KRAWCZYK & M. LUBY (1993). On the existence of pseudorandom generators. SIAM J. Comput. 22(6), 1163-1175. Preliminary version in Proc. 29th FOCS, 1988.
18. O. GOLDREICH & A. WIGDERSON (1997). Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Struct. Algorithms 11(4), 315-343.
19. J. HÅSTAD, R. IMPAGLIAZZO, L. A. LEVIN & M. LUBY (1999). A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364-1396.
20. J. HÅSTAD, A. W. SCHRIFT & A. SHAMIR (1993). The discrete logarithm modulo a composite hides O(n) bits. JCSS 47(3), 376-404. Preliminary version in Proc. 22nd STOC, 1990.
21. 0. In Proc. 44th FOCS, 136-145.
22. J. NAOR & M. NAOR (1993). Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22(4), 838-856. Preliminary version in Proc. 22th STOC, 1990.
23. M. NAOR (1991). Bit commitment using pseudorandomness. J. of Cryptology 4, 151-158.
24. M. NAOR & O. REINGOLD (2004). Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231-262. Preliminary version in Proc. 38th FOCS, 1997.
25. CH. PAPADIMITRIOU & M. YANNAKAKIS (1991). Optimization, approximation, and complexity classes. J. of Computer and Systems Sciences 43, 425-440. Preliminary version in Proc. 20th STOC, 1988.
26. J. RADHAKRISHNAN & A. TA-SHMA (2000). Tight bounds for depth-two superconcentrators. SIAM J. Discrete Math. 13(1), 2-24. Preliminary version in Proc. 38th FOCS, 1997.
27. A. SAHAI & S. VADHAN (2003). A complete problem for statistical zero knowledge. J. of the ACM 50(2), 1-54.
28. A. SHPILKA (2006). Constructions of low-degree and error-correcting ε-biased generators. In Proc. 21st Conference on Computational Complexity (CCC), 33-45.
29. A. TA-SHMA, CH. UMANS & D. ZUCKERMAN (2001). Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd STOC, 143-152.
30. E. VIOLA (2005). On constructing parallel pseudorandom generators from one-way functions. In Proc. 20th Conference on Computational Complexity (CCC), 183-197.
31. A. C.-C. YAO (1982). Theory and application of trapdoor functions. In Proc. 23rd FOCS, 80-91.