skip to main content
article

The unified theory of pseudorandomness: guest column

Published:01 September 2007Publication History
Skip Abstract Section

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.

References

  1. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83--96, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In Proc. 35th FOCS, pages 276--287, 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. B. Chor and O. Goldreich. On the power of two-point based sampling. J. Complexity, 5(1):96--106, Mar. 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle Scholar
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Gillman. A Chernoff bound for random walks on expander graphs. SIAM J. Comput., 27(4):1203--1220, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. O. Goldreich. A sample of samplers - a computational perspective on sampling (survey). Electronic Colloquium on Computational Complexity (ECCC), 4(20), 1997.Google ScholarGoogle Scholar
  11. O. Goldreich. Modern cryptography, probabilistic proofs and pseudorandomness. Springer-Verlag, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Goldwasser and S. Micali. Probabilistic encryption. J. Computer & System Sci., 28(2):270--299, Apr. 1984.Google ScholarGoogle ScholarCross RefCross Ref
  13. V. Guruswami. Algorithmic Results in List Decoding, volume 2, number 2 of Foundations and Trends in Theoretical Computer Science. now publishers, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In Proc. 22nd CCC, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bull. of the AMS, 43(4):439--561, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  17. V. Kabanets. Derandomization: a brief overview. Bull. of the EATCS, 76:88--103, 2002.Google ScholarGoogle Scholar
  18. P. Miltersen. Handbook of Randomized Computing, chapter Derandomizing Complexity Classes. Kluwer, 2001.Google ScholarGoogle Scholar
  19. N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions. J. Computer & System Sci., 58(1):148--173, February 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. N. Nisan and A. Wigderson. Hardness vs randomness. J. Computer & System Sci., 49(2):149--167, Oct. 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. N. Nisan and D. Zuckerman. Randomness is linear in space. J. Computer & System Sci., 52(1):43--52, Feb. 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarCross RefCross Ref
  24. R. Shaltiel. Recent developments in extractors. In Current Trends in Theoretical Computer Science, vol. 1: Algorithms and Complexity. World Scientific, 2004.Google ScholarGoogle Scholar
  25. M. Sudan. List decoding: Algorithms and applications. SIGACT News, 31(1):16--27, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. J. Computer & System Sci., 62:236--266, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd STOC, pages 143--152, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. A. Ta-Shma and D. Zuckerman. Extractor codes. IEEE Trans. Information Theory, 50(12):3015--3025, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. L. Trevisan. Extractors and pseudorandom generators. J. ACM, 48(4):860--879, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. L. Trevisan. Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:347--424, 2004.Google ScholarGoogle Scholar
  31. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  32. S. Vadhan. Lecture notes on pseudorandomness. http://eecs.harvard.edu/~salil/cs225, Spring 2007.Google ScholarGoogle Scholar
  33. A. C. Yao. Theory and applications of trapdoor functions (extended abstract). In Proc. 23rd FOCS, pages 80--91, 1982.Google ScholarGoogle ScholarCross RefCross Ref
  34. D. Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16(4/5):367--391, Oct./Nov. 1996.Google ScholarGoogle ScholarCross RefCross Ref
  35. D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures & Algorithms, 11(4):345--367, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The unified theory of pseudorandomness: guest column

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM SIGACT News
            ACM SIGACT News  Volume 38, Issue 3
            September 2007
            143 pages
            ISSN:0163-5700
            DOI:10.1145/1324215
            Issue’s Table of Contents

            Copyright © 2007 Author

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 September 2007

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!