Pseudorandom generators with long stretch and low locality from random local one-way functions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 805-815

  Applebaum, Benny ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

cryptography; densest subgraph; NC0; pseudorandomness

Indexed keywords

DENSEST-SUBGRAPH; HYPER GRAPH; INAPPROXIMABILITY; INAPPROXIMABILITY FACTOR; NC0; ONE-WAY FUNCTIONS; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS;

CRYPTOGRAPHY; POLYNOMIALS;

COMPUTATION THEORY;

EID: 84862614907     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214050     Document Type: Conference Paper

References (39)

1. D. Achlioptas. Handbook of Satisfiability, chapter Random Satisfiability, pages 243-268. IOS Press, 2009.
2. M. Alekhnovich. More on average case vs approximation complexity. In FOCS, pages 298-307. IEEE Computer Society, 2003.
3. M. Alekhnovich, E. A. Hirsch, and D. Itsykson. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. J. Autom. Reasoning, 35(1-3):51-72, 2005. (Pubitemid 44619279)
4. B. Applebaum. Pseudorandom generators with long stretch and low locality from random local one-way functions. Electronic Colloquium on Computational Complexity (ECCC), 18:7, 2011.
5. B. Applebaum, B. Barak, and A. Wigderson. Public-key cryptography from different assumptions. In Proc. of 42nd STOC, pages 171-180, 2010.
6. B. Applebaum, A. Bogdanov, and A. Rosen. A dichotomy for local small-bias generators. In Proc. of 9th TCC, pages 1-18, 2012.
7. B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography in NC0. SIAM Journal on Computing, 36(4):845-888, 2006.
8. 0. J. of Computational Complexity, 17(1):38-69, 2008.
9. S. Arora, B. Barak, M. Brunnermeier, and R. Ge. Computational complexity and information asymmetry in financial products. Commun. ACM, 54(5):101-107, 2011.
10. 1/4) approximation for densest k-subgraph. In Proc. of 42nd STOC, pages 201-210, 2010.
11. A. Bogdanov and Y. Qiao. On the security of goldreich's one-way function. In Proc. of 13th RANDOM, pages 392-405, 2009.
12. A. Bogdanov and A. Rosen. Input locality and hardness amplification. In Proc. of 8th TCC, pages 1-18, 2011.
13. A. Coja-Oghlan. Random constraint satisfaction problems. In Proc. 5th DCM, 2009.
14. J. Cook, O. Etesami, R. Miller, and L. Trevisan. Goldreich's one-way function candidate and myopic backtracking algorithms. In Proc. of 6th TCC, pages 521-538, 2009.
15. 0. In Proc. 26th MFCS, 2001.
16. N. Dedic, L. Reyzin, and S. P. Vadhan. An improved pseudorandom generator based on hardness of factoring. In Proc. 3rd SCN, 2002.
17. S. O. Etesami. Pseudorandomness against depth-2 circuits and analysis of goldreich's candidate one-way function. Technical Report EECS-2010-180, UC Berkeley, 2010.
18. U. Feige. Relations between average case complexity and approximation complexity. In Proc. of 34th STOC, pages 534-543, 2002.
19. U. Feige, D. Peleg, and G. Kortsarz. The dense k-subgraph problem. Algorithmica, 29(3):410-421, 2001. (Pubitemid 33710542)
20. A. Flaxman. Random planted 3-SAT. In M.-Y. Kao, editor, Encyclopedia of Algorithms. Springer, 2008.
21. O. Goldreich. Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090), 2000.
22. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
23. O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudorandom generators. SIAM J. Comput., 22(6):1163-1175, 1993. Preliminary version in Proc. 29th FOCS, 1988.
24. O. Goldreich, N. Nisan, and A. Wigderson. On yao's XOR-lemma. Electronic Colloquium on Computational Complexity (ECCC), 2(50), 1995.
25. O. Goldreich and V. Rosen. On the security of modular exponentiation with application to the construction of pseudorandom generators. J. Cryptology, 16(2):71-93, 2003. (Pubitemid 41201210)
26. I. Haitner, O. Reingold, and S. P. Vadhan. Efficiency improvements in constructing pseudorandom generators from one-way functions. In Proc. of 42nd STOC, pages 437-446, 2010.
27. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
28. Herzberg and Luby. Public randomness in cryptography. In Proc. of 12th CRYPTO, 1992.
29. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Cryptography with constant computational overhead. In Proc. of 40th STOC, pages 433-442, 2008.
30. D. Itsykson. Lower bound on average-case complexity of inversion of goldreich's function by drunken backtracking algorithms. In Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, pages 204-215, 2010.
31. J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean functions. In Proc. of 29th FOCS, pages 68-80, 1988.
32. S. Khot. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. In Proc. of 45th FOCS, pages 136-145, 2004.
33. L. A. Levin. One-way functions and pseudorandom generators. In Proc. of 17th STOC, pages 363-365, 1985.
34. R. Miller. Goldreich's one-way function candidate and drunken backtracking algorithms. Distinguished major thesis, University of Virginia, 2009.
35. 0. In Proc. 44th FOCS, pages 136-145, 2003.
36. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. J. ACM, 51(2):231-262, 2004.
37. S. K. Panjwani. An experimental evaluation of goldreich's one-way function. Technical report, IIT, Bombay, 2001.
38. M. Sudan, L. Trevisan, and S. P. Vadhan. Pseudorandom generators without the xor lemma. J. Comput. Syst. Sci., 62(2):236-266, 2001. (Pubitemid 32334551)
39. A. C. Yao. Theory and application of trapdoor functions. In Proc. 23rd FOCS, pages 80-91, 1982.