Efficiency improvements in constructing pseudorandom generators from one-way functions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 437-446

  Haitner, Iftach ^a   Reingold, Omer ^a   Vadhan, Salil ^b  

^a MICROSOFT RESEARCH   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

one way function; pseudorandom generator; security preserving

Indexed keywords

EFFICIENCY IMPROVEMENT; NEW CONSTRUCTION; ONE-WAY FUNCTIONS; PSEUDORANDOM GENERATORS;

COMPUTATION THEORY;

EID: 77954721007     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806750     Document Type: Conference Paper

References (28)

1. 0. SIAM Journal on Computing, 36, 2006.
2. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, Apr. 1988.
3. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1(2):77-94, 1988.
4. O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), pages 25-32, 1989.
5. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33 (4):792-807, 1986.
6. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(1):691-729, 1991. Preliminary version in FOCS'86.
7. O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudorandom generators. SIAM Journal on Computing, 22(6):1163-1175, 1993.
8. I. Haitner, O. Reingold, S. Vadhan, and H. Wee. Inaccessible entropy. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC).
9. I. Haitner, D. Harnik, and O. Reingold. On the power of the randomized iterate. In Advances in Cryptology - CRYPTO 2006, 2006.
10. I. Haitner, D. Harnik, and O. Reingold. Efficient pseudorandom generators from exponentially hard one-way functions. In Automata, Languages and Programming, 24th International Colloquium, ICALP, 2006.
11. I. Haitner, M. Nguyen, S. J. Ong, O. Reingold, and S. Vadhan. Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM Journal on Computing, 39(3):1153-1218, 2009.
12. I. Haitner, O. Reingold, S. Vadhan, and H. Wee. Inaccessible entropy. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC '09), pages 611-620, 31 May-2 June 2009.
13. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364-1396, 1999. Preliminary versions in STOC'89 and STOC'90.
14. T. Holenstein. Key agreement from weak bit agreement. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 664-673, 2005.
15. T. Holenstein. Pseudorandom generators from one-way functions: A simple construction for any hardness. In Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, 2006.
16. T. Holenstein. Strengthening key agreement using hardcore sets - PhD thesis, 2006.
17. R. Impagliazzo. A personal view of average-case complexity. In Proceedings of the Tenth Annual Structure in Complexity Theory Conference, pages 134-147. IEEE Computer Society, 1995.
18. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pages 248-253, 1989.
19. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudorandom generation from one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), pages 12-24. ACM Press, 1989.
20. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373-386, 1988.
21. M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991. Preliminary version in CRYPTO'89.
22. A. A. Razborov and S. Rudich. Natural proofs. Journal of Computer and System Sciences, 55(1):24-35, Aug. 1997.
23. M. Sudan. Decoding of Reed-Solomon codes beyond the error correction bound. J. of Complexity, 13:180-193, 1997. (Pubitemid 127172728)
24. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62:236-266, 2001.
25. S. P. Vadhan. Constructing locally computable extractors and cryptosystems in the bounded-storage model. Journal of Cryptology, 17(1):43-77, January 2004.
26. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
27. A. C. Yao. Protocols for secure computations. pages 160-164, 1982.
28. D. Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16(4/5):367-391, Oct./Nov. 1996.