skip to main content
10.1145/509907.509997acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Pseudo-random generators for all hardnesses

Published:19 May 2002Publication History

ABSTRACT

(MATH) We construct the first pseudo-random generators with logarithmic seed length that convert s bits of hardness into sΩ(1) bits of 2-sided pseudo-randomness for any s}. This improves [8] and gives a direct proof of the optimal hardness vs. randomness tradeoff in [15]. A key element in our construction is an augmentation of the standard low-degree extension encoding that exploits the field structure of the underlying space in a new way.

References

  1. A. Andreev, A. Clementi, and J. Rolim. A new general derandomization method. J. ACM, 45(1), 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput., 13(4):850--864, Nov. 1984.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. O. Goldreich, S. Vadhan, and A. Wigderson. Simplified derandomization of BPP using a hitting set generator. Technical Report TR00-004, Electronic Colloquium on Computational Complexity, January 2000.]]Google ScholarGoogle Scholar
  4. V. Guruswami and M. Sudan. List decoding algorithms for certain concatenated codes. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. V. Guruswami and M. Sudan. Extensions to the Johnson bound. Manuscript, February 2001.]]Google ScholarGoogle Scholar
  6. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. In Sixteenth Annual IEEE Conference on Computational Complexity, pages 1--12, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Near-optimal conversion of hardness into pseudo-randomness. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Extractors and pseudo-randomn generators with optimal seed-length. In Proceedings of the Thirty-second Annual ACM Symposium on the Theory of Computing, 21--23 May 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 220--229, El Paso, Texas, 4--6 May 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. V. Kabanets. Easiness assumptions and hardness tests: Trading time for zero error. In Fifteenth Annual IEEE Conference on Computational Complexity, pages 150--157, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. R. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. J. Lu. Derandomizing arthur-merlin games under uniform assumptions. In 11th Annual International Symposium on Algorithms And Computation, pages 302--312, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. B. Miltersen and N. V. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2):149--167, Oct. 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity, 13, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the xor lemma. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. In Proceedings of the 42th Annual IEEE Symposium on Foundations of Computer Science, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. L. Trevisan. Construction of extractors using pseudorandom generators. In Proceedings of the 31st ACM Symposium on Theory of Computing, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. R. Urbanke. Modern coding theory -- SS2001. Technical Report DSC-LTHC, EPFL, 2001. Available from http://lthcwww.epfl.ch/content.php?title=coding2001!]]Google ScholarGoogle Scholar
  21. A. C. Yao. Theory and applications of trapdoor functions (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 80--91, Chicago, Illinois, 3--5 Nov. 1982. IEEE.]]Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Pseudo-random generators for all hardnesses

            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
            • Published in

              cover image ACM Conferences
              STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
              May 2002
              840 pages
              ISBN:1581134959
              DOI:10.1145/509907

              Copyright © 2002 ACM

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 19 May 2002

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              STOC '02 Paper Acceptance Rate91of287submissions,32%Overall Acceptance Rate1,469of4,586submissions,32%

            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!