Extractors and pseudorandom generators

Journal of the ACM

Volumn 48, Issue 4, 2001, Pages 860-879

  Trevisan, Luca ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Error correcting codes; Extractors; Pseudorandomness

Indexed keywords

ERROR-CORRECTING CODES; EXTRACTORS; PSEUDORANDOMNESS;

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL METHODS; ERROR CORRECTION; SET THEORY; STATISTICAL METHODS;

INFORMATION THEORY;

EID: 0005314594     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/502090.502099     Document Type: Article

References (40)

1. ANDREEV, A. E., CLEMENTI, A. E. F., AND ROLIM, J. D. P. 1998. A new general derandomization method. J. ACM 45, 1 (Jan.), 179-213.
2. ANDREEV, A., CLEMENTI, A., ROLIM, J., AND TREVISAN, L. 1999. Weak random sources, hitting sets, and BPP simulations. SIAM J. Comput. 28, 6, 2103-2116.
3. ARVIND, V., AND KÖBLER, J. 1997. On resource-bounded measure and pseudorandomness. In Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 1346. Springer-Verlag, New York, pp. 235-249.
4. BABAI, L., FORTNOW, L., NISAN, N., AND WIODERSON, A. 1993. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comput. Compl. 3, 4, 307-318.
5. BELLARE, M., GOLDREICH, O., AND SUDAN, M. 1998. Free bits, PCP's and nonapproximability - towards tight results. SIAM J. Comput. 27, 3, 804-915.
6. BELLARE, M., AND ROMPEL, J. 1994. Randomness-efficient oblivious sampling. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 276-287.
7. BLUM, M., AND MICALI, S. 1984. How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13, 4, 850-864.
8. CHOR, B., AND GOLDREICH, O. 1988. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17, 2 (Apr.), 230-261.
9. COHEN, A., AND WIGDERSON, A. 1989. Dispersers, deterministic amplification, and weak random sources. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 14-19.
10. GOLDREICH, O. 1999. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer-Verlag, New York.
11. GOLDREICH, O., NISAN, N., AND WIGDERSON, A. 1995. On Yao's XOR lemma. Tech. Rep. TR95-50. Electronic Colloquium on Computational Complexity, http://eccc.uni-trier.de/eccc/.
12. GOLDREICH, O., AND WIGDERSON, A. 1997. Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Struct. Algor. 11, 4, 315-343.
13. GOLDREICH, O., AND ZUCKERMAN, D. 1997. Another proof that BPP ⊆ PH (and more). Tech. Rep. TR97-045. Electronic Colloquium on Computational Complexity, http://eccc.uni-trier.de/eccc/.
14. GOLDWASSER, S., AND MICALI, S. 1984. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2, 270-299.
15. IMPAGLIAZZO, R. 1995. Hard-core distributions for somewhat hard problems. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 538-545.
16. IMPAGLIAZZO, R., AND WIGDERSON, A. 1997. P=BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-6). ACM, New York, pp. 220-229.
17. IMPAGLIAZZO, R., AND WIGDERSON, A. 1998. Randomness versus time: De-randomization under a uniform assumption. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 734-743.
18. KLIVANS, A., AND VAN MELKEBEEK, D. 1999. Graph nonisomorphism has subexponential size proofs unless the polynomial-time, hierarchy collapses. In Proceedings of the 31st ACM Symposium on Theory of Computing (Atlanta, Ga., May 1-4). ACM, New York, pp. 659-667.
19. LEIGHTON, F. 1992. Introduction to Parallel Algorithms and Architectures. Morgan-Kaufmann, San Mateo, Calif.
20. MACWILLIAMS, F., AND SLOANE, N. 1977. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, The Netherlands.
21. NISAN, N. 1991. Pseudorandom bits for constant depth circuits. Combinatorica 12, 4, 63-70.
22. NISAN, N. 1996. Extracting randomness: How and why. In Proceedings of the 11th IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, Calif., pp. 44-58.
23. NISAN, N., AND TA-SHMA, A. 1999. Extrating randomness : A survey and new constructions. J. Comput. Syst. Sci. 58, 1, 148-173.
24. NISAN, N., AND WIGDERSON, A. 1994. Hardness vs randomness. J. Comput. Syst. Sci. 49, 149-167.
25. NISAN, N., AND ZUCKERMAN, D. 1993. More deterministic simulation in Logspace. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 235-244.
26. RADHAKRISHNAN, J., AND TA-SHMA, A. 1997. Tight bounds for depth-two superconcentrators. In Pro-ceedings of the 38th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 585-594.
27. RAZ, R., REINGOLD, O., AND VADHAN, S. 1999. Extracting all the randomness and reducing the error in Trevisan's extractors. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (Atlanta, Ga., May 1-4). ACM, New York, pp. 149-158.
28. SAKS, M., SRINIVASAN, A., AND ZHOU, S. 1998. Explicit OR-dispersers with polylogarithmic degree. J. ACM 45, 1 (Jan.), 123-154.
29. SANTHA, M., AND VAZIRANI, U. 1986. Generating quasi-random sequences from slightly random sources. J. Comput. Syst. Sci. 33, 75-87.
30. SRINIVASAN, A., AND ZUCKERMAN, D. 1994. Computing with very weak random sources. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 264-275.
31. SUDAN, M., TREVISAN, L., AND VADHAN, S. 1999. Pseudorandom generators without the XOR lemma. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (Atlanta, Ga., May 1-4). ACM, New York, pp. 537-546.
32. TA-SHMA, A. 1996. On extracting randomness from weak random sources. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 276-285.
33. TA-SHMA, A. 1998. Almost optimal dispersers. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (Dallas, Tex., May 23-26). ACM, New York, pp. 196-202.
34. VAZIRANI, U., AND VAZIRANI, V. 1985. Random polynomial time is equal to slightly random polynomial time. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 417-428.
35. VON NEUMANN, J. 1951. Various techniques used in connection with random digits. NBS, Appl. Math. Seri. 12, 36-38.
36. WIGDERSON, A., AND ZUCKERMAN, D. 1993. Expanders that beat the eigenvalue bound: Explicit construction and applications. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 245-251.
37. YAO, A. 1982. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 80-91.
38. ZUCKERMAN, D. 1990. General weak random sources. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 534-543.
39. ZUCKERMAN, D. 1996a. On unapproximable versions of NP-complete problems. SIAM J. Comput. 25, 6, 1293-1304.
40. ZUCKERMAN, D. 1996b. Randomness-optimal sampling, extractors and constructive leader election. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 286-295.