On the security of Goldreich's one-way function

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 392-405

  Bogdanov, Andrej ^a   Qiao, Youming ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH PROBABILITY; ONE-WAY FUNCTIONS;

AMPLIFICATION; COMBINATORIAL OPTIMIZATION; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350589609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_30     Document Type: Conference Paper

References (12)

1. 0. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 166-175 (2004)
2. 0. In:Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 260-271. Springer, Heidelberg (2006)
3. 0. Technical Report TR09-011, Electronic Colloquium on Computational Complexity (ECCC) (2009)
4. [CEMT09] Cook, J., Etesami, O., Miller, R., Trevisan, L.: Goldreich's one-way function candidate and myopic backtracking algorithms. In: Proceedings of the 6th Theory of Cryptography Conference (TCC), pp. 521-538 (2009)
5. [Coj06] Coja-Oghlan, A.: An adaptive spectral heuristic for partitioning random graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 691-702. Springer, Heidelberg (2006)
6. [Fla03] Flaxman, A.: A spectral technique for random satisfiable 3CNF formulas. In: SODA 2003: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, Baltimore, Maryland, pp. 357-363 (2003)
7. [Gol00] Goldreich, O.: Candidate one-way functions based on expander graphs. Technical Report TR00-090, Electronic Colloquium on Computational Complexity (ECCC) (2000)
8. [KV06] Krivelevich, M., Vilenchik, D.: Solving random satisfiable 3CNF formulas in expected polynomial time. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, pp. 454-463. ACM Press, New York (2006)
9. [LN90] Linial, N., Nisan, N.: Approximate inclusion-exclusion. Combinatorica 10(4), 349-365 (1990)
10. 0. In: Proceedings of the 44th Annual Symposium on Foundations of Computer Science, pp. 136-145 (2003)
11. [SS85] Schmidt, J.P., Shamir, E.: Component structure in the evolution of random hypergraphs. Combinatorica 5(1), 81-94 (1985)
12. [Vil07] Vilenchik, D.: It's all about the support: a new perspective on the satisfiability problem. Journal on Satisfiability, Boolean Modeling, and Computation 3, 125-139 (2007)