Input locality and hardness amplification

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

Volumn 6597 LNCS, Issue , 2011, Pages 1-18

  Bogdanov, Andrej ^a   Rosen, Alon ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b INTERDISCIPLINARY CENTER   (Israel)

Author keywords

hardness amplification; input locality; one way function; parity with noise

Indexed keywords

CRYPTOGRAPHY;

EXPONENTIAL TIME; HARDNESS AMPLIFICATION; HIGH PROBABILITY; INPUT LOCALITY; LOCAL FUNCTIONS; ONE-WAY FUNCTIONS; PARITY WITH NOISE; SMALL INPUTS;

HARDNESS;

EID: 79953179313     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19571-6_1     Document Type: Conference Paper

References (17)

1. Alon, N., Spencer, J.: The Probabilistic Method. John Wiley, Chichester (1992)
2. Applebaum, B., Barak, B., Wigderson, A.: Public-key cryptography from different assumptions. In: STOC 2010, pp. 171-180 (2010)
3. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. In: FOCS 2004, pp. 166-175 (2004)
4. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with Constant Input Locality. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 92-110. Springer, Heidelberg (2007);
5. Journal version in J. Cryptology 22(4), 429-469 (2009)
6. Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: STOC 2000, pp. 435-440 (2000)
7. Bogdanov, A., Qiao, Y.: On the security of goldreich's one-way function. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol. 5687, pp. 392-405. Springer, Heidelberg (2009)
8. Cook, J., Etesami, O., Miller, R., Trevisan, L.: Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 521-538. Springer, Heidelberg (2009)
9. Goldreich, O.: Candidate One-Way Functions Based on Expander Graphs. Electronic Colloquium on Computational Complexity (ECCC) 7(90) (2000)
10. Goldreich, O., Impagliazzo, R., Levin, L.A., Venkatesan, R., Zuckerman, D.: Security Preserving Amplification of Hardness. In: FOCS 1990, pp. 318-326 (1990)
11. Goldreich, O., Krawczyk, H., Luby, M.: On the Existence of Pseudorandom Generators. SIAM J. Comput. 22(6), 1163-1175 (1993)
12. Haitner, I., Harnik, D., Reingold, O.: On the Power of the Randomized Iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 22-40. Springer, Heidelberg (2006)
13. Impagliazzo, R., Levin, L., Luby, M.: Pseudo-random Generation from One-way Functions. In: STOC 1989, pp. 12-24 (1989)
14. Impagliazzo, R., Luby, M.: One-way Functions are Essential for Complexity Based Cryptography. In: FOCS 1989, pp. 230-235 (1989)
15. Mansour, Y., Nisan, N., Tiwari, P.: The Computational Complexity of Universal Hashing. Theor. Comput. Sci. 107(1), 121-133 (1993)
16. Lin, H.C., Trevisan, L.,Wee, H.: On Hardness Amplification of One-Way Functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 34-49. Springer, Heidelberg (2005)
17. Yao, A.C.-C.: Theory and Applications of Trapdoor Functions (Extended Abstract). In: FOCS 1982, pp. 80-91 (1982)