Abstract
We survey the close connections between a variety of "pseudorandom objects," namely pseudorandom generators, expander graphs, list-decodable error-correcting codes, randomness extractors, averaging samplers, and hardness amplifiers.
- N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83--96, 1986. Google Scholar
Digital Library
- L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307--318, 1993. Google Scholar
Digital Library
- M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In Proc. 35th FOCS, pages 276--287, 1994.Google Scholar
Digital Library
- M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Computing, 13(4):850--864, Nov. 1984. Google Scholar
Digital Library
- B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Computing, 17(2):230--261, Apr. 1988. Google Scholar
Digital Library
- B. Chor and O. Goldreich. On the power of two-point based sampling. J. Complexity, 5(1):96--106, Mar. 1989. Google Scholar
Digital Library
- A. E. F. Clementi, J. D. P. Rolim, and L. Trevisan. Recent advances towards proving P=BPP. Bull. of the EATCS, 64:96--103, 1998.Google Scholar
- D. Galvin and P. Tetali. Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. Random Structures & Algorithms, 28(4):427--443, 2006. Google Scholar
Digital Library
- D. Gillman. A Chernoff bound for random walks on expander graphs. SIAM J. Comput., 27(4):1203--1220, 1998. Google Scholar
Digital Library
- O. Goldreich. A sample of samplers - a computational perspective on sampling (survey). Electronic Colloquium on Computational Complexity (ECCC), 4(20), 1997.Google Scholar
- O. Goldreich. Modern cryptography, probabilistic proofs and pseudorandomness. Springer-Verlag, 1999. Google Scholar
Digital Library
- S. Goldwasser and S. Micali. Probabilistic encryption. J. Computer & System Sci., 28(2):270--299, Apr. 1984.Google Scholar
Cross Ref
- V. Guruswami. Algorithmic Results in List Decoding, volume 2, number 2 of Foundations and Trends in Theoretical Computer Science. now publishers, 2006. Google Scholar
Digital Library
- V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In Proc. 22nd CCC, 2007. Google Scholar
Digital Library
- J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Computing, 28(4):1364--1396, 1999. Google Scholar
Digital Library
- S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bull. of the AMS, 43(4):439--561, 2006.Google Scholar
Cross Ref
- V. Kabanets. Derandomization: a brief overview. Bull. of the EATCS, 76:88--103, 2002.Google Scholar
- P. Miltersen. Handbook of Randomized Computing, chapter Derandomizing Complexity Classes. Kluwer, 2001.Google Scholar
- N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions. J. Computer & System Sci., 58(1):148--173, February 1999. Google Scholar
Digital Library
- N. Nisan and A. Wigderson. Hardness vs randomness. J. Computer & System Sci., 49(2):149--167, Oct. 1994. Google Scholar
Digital Library
- N. Nisan and D. Zuckerman. Randomness is linear in space. J. Computer & System Sci., 52(1):43--52, Feb. 1996. Google Scholar
Digital Library
- J. Radhakrishnan and A. Ta-Shma. Bounds for dispersers, extractors, and depth-two super-concentrators. SIAM J. Discrete Math., 13(1):2--24, 2000. Google Scholar
Digital Library
- J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math., 8(2):223--250, 1995. Google Scholar
Cross Ref
- R. Shaltiel. Recent developments in extractors. In Current Trends in Theoretical Computer Science, vol. 1: Algorithms and Complexity. World Scientific, 2004.Google Scholar
- M. Sudan. List decoding: Algorithms and applications. SIGACT News, 31(1):16--27, 2000. Google Scholar
Digital Library
- M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. J. Computer & System Sci., 62:236--266, 2001. Google Scholar
Digital Library
- A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd STOC, pages 143--152, 2001. Google Scholar
Digital Library
- A. Ta-Shma and D. Zuckerman. Extractor codes. IEEE Trans. Information Theory, 50(12):3015--3025, 2004. Google Scholar
Digital Library
- L. Trevisan. Extractors and pseudorandom generators. J. ACM, 48(4):860--879, 2001. Google Scholar
Digital Library
- L. Trevisan. Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:347--424, 2004.Google Scholar
- L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity (CCC '02), pages 129--138, Montréal, CA, May 2002. IEEE. Google Scholar
Digital Library
- S. Vadhan. Lecture notes on pseudorandomness. http://eecs.harvard.edu/~salil/cs225, Spring 2007.Google Scholar
- A. C. Yao. Theory and applications of trapdoor functions (extended abstract). In Proc. 23rd FOCS, pages 80--91, 1982.Google Scholar
Cross Ref
- D. Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16(4/5):367--391, Oct./Nov. 1996.Google Scholar
Cross Ref
- D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures & Algorithms, 11(4):345--367, 1997. Google Scholar
Digital Library
Index Terms
The unified theory of pseudorandomness: guest column
Recommendations
Pseudorandomness
ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and ProgrammingWe postulate that a distribution is pseudorandom if it cannot be told apart from the uniform distribution by any efficient procedure. This yields a robust definition of pseudorandom generators as efficient deterministic programs stretching short random ...
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06: Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer ScienceA number of recent results have constructed randomness extractors and pseudorandom generators (PRGs) directly from certain error-correcting codes. The underlying construction in these results amounts to picking a random index into the codeword and ...






Comments