On hardness amplification of one-way functions

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 34-49

  Lin, Henry ^a   Trevisan, Luca ^a   Wee, Hoeteck ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

BLACK-BOX REDUCTION; HITTERS; ONE-WAY FUNCTION; PERMUTATION;

FUNCTIONS;

EID: 24144471490     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_3     Document Type: Conference Paper

References (20)

1. [GGK03] Rosario Gennaro, Yael Gertner, and Jonathan Katz. Lower bounds on the efficiency of encryption and digital signature schemes. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 417-425, 2003.
2. +90] Oded Goldreich, Russell Impagliazzo, Leonid Levin, Ramarathnam Venkatesan, and David Zuckerman. Security preserving amplification of hardness. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 318-326, 1990.
3. +00] Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, and Mahesh Viswanathan. The relationship between public key encryption and oblivious transfer. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 325-335, 2000.
4. [GMR01] Yael Gertner, Tal Malkin, and Omer Reingold. On the impossibility of basing trapdoor functions on trapdoor predicates. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 126-135, 2001.
5. [Gol97] Oded Goldreich. A sample of samplers - a computational perspective on sampling. Technical Report TR97-020, Electronic Colloquium on Computational Complexity, 1997.
6. [Gol01] Oded Goldreich. The Foundations of Cryptography - Volume 1. Cambridge University Press, 2001.
7. [GT00] Rosario Gennaro and Luca Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 305-313, 2000.
8. [HILL99] J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28 (4): 1364-1396, 1999.
9. [IL89] Russell Impagliazzo and Michael Luby. One-way functions are essential for complexity based cryptography. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 230-235, 1989.
10. [Imp96] Russell Impagliazzo. Very strong one-way functions and pseudo-random generators exist relative to a random oracle. Unpublished manuscript, 1996.
11. [IR89] Russell Impagliazzo and Steven Rudich. Limits on the provable consequences of one-way permutations. In Proceedings of the 21st ACM Symposium on Theory of Computing, pages 44-61, 1989.
12. [KSS00] J. Kahn, M. Saks, and C. Smyth. A dual version of Reimer's inequality and a proof of rudich's conjecture. In Proceedings of the 15th IEEE Conference on Computational Complexity, 2000.
13. [KST99] J.H. Kim, D.R. Simon, and P. Tetali. Limits on the efficiency of one-way permutations-based hash functions. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 535-542, 1999.
14. [Lub96] M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
15. [RTS97] J. Radhakrishnan and A. Ta-Shma. Tight bounds for depth-two superconcentrators. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 585-594, 1997.
16. [RTV04] Omer Reingold, Luca Trevisan, and Salil Vadhan. Notions of reducibility between cryptographic primitives. In Proceedings of the 1st Theory of Cryptography Conference, pages 1-20. LNCS 2951, 2004.
17. [Rud88] S. Rudich. Limits on the provable consequences of one-way functions. PhD thesis, University of California at Berkeley, 1988.
18. [Rud91] S. Rudich. The use of interaction in public cryptosystems. In Proceedings of CRYPTO'91, pages 242-251, 1991.
19. [TS98] A. Ta-Shma. Almost optimal dispersers. In Proceedings of the 30th ACM Symposium on Theory of Computing, 1998.
20. [Yao82] A.C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.