Security amplification for interactive cryptographic primitives

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

Volumn 5444 LNCS, Issue , 2009, Pages 128-145

  Dodis, Yevgeniy ^a   Impagliazzo, Russell ^b   Jaiswal, Ragesh ^c   Kabanets, Valentine ^d  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Och Spine at New York Presbyterian Hospitals   (United States)

^d SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION-RESISTANT HASH FUNCTIONS; CRYPTOGRAPHIC PRIMITIVES; DIGITAL SIGNATURE; DIRECT PRODUCT; ENCRYPTION SCHEMES; MESSAGE AUTHENTICATION CODES; NON-INTERACTIVE; ONE-WAY FUNCTIONS; OPTIMAL SECURITY; PSEUDO-RANDOM FUNCTIONS; SECURITY AMPLIFICATION; VERIFIABLE PUZZLES; XOR LEMMA;

AUTHENTICATION; HASH FUNCTIONS; SECURITY OF DATA;

AMPLIFICATION;

EID: 70350281850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00457-5_9     Document Type: Conference Paper

References (21)

1. Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: Proceedings of the Thirty-Eighth Annual IEEE Symposium on Foundations of Computer Science, pp. 374-383 (1997)
2. Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 17-33. Springer, Heidelberg (2005)
3. Coron, J.S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229-235. Springer, Heidelberg (2000)
4. Canetti, R., Rivest, R., Sudan, M., Trevisan, L., Vadhan, S., Wee, H.: Amplifying collision resistance: A complexity-theoretic treatment. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 264-283. Springer, Heidelberg (2007)
5. Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 342-360. Springer, Heidelberg (2004)
6. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 25-32 (1989)
7. Goldreich, O., Nisan, N.,Wigderson, A.: On Yao's XOR-Lemma. Electronic Colloquium on Computational Complexity, TR95-050 (1995)
8. Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, New York (2001)
9. Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-type direct product theorems. Journal of Cryptology (published online September 2008); preliminary version in CRYPTO 2007
10. Impagliazzo, R., Jaiswal, R., Kabanets, V.,Wigderson, A.: Uniform direct-product theorems: Simplified, optimized, and derandomized. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 579-588 (2008)
11. Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: Proceedings of the Thirty-Sixth Annual IEEE Symposium on Foundations of Computer Science, pp. 538-545 (1995)
12. Impagliazzo, R.,Wigderson, A.: P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 220-229 (1997)
13. Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica 7(4), 357-363 (1987)
14. Luby, M., Rackoff, C.: Pseudorandom permutation generators and cryptographic composition. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 356-363 (1986)
15. Myers, S.: Efficient Amplification of the Security of Weak Pseudo-Random Function Generators. J. Cryptology 16(1), 1-24 (2003)
16. Myers, S.: On the development of block-ciphers and pseudorandom function generators using the composition and XOR operators. Master's thesis, University of Toronto (1999)
17. Naor, M., Reingold, O.: From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 267-282. Springer, Heidelberg (1998)
18. Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryptology, 29-66 (1999)
19. Pass, R., Venkitasubramaniam, M.: An efficient parallel repetition theorem for Arthur-Merlin games. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 420-429 (2007)
20. Pietrzak, K.,Wikstrom, D.: Parallel repetition of computationally sound protocols revisited. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 86-102. Springer, Heidelberg (2007)
21. Yao, A.C.: Theory and applications of trapdoor functions. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Foundations of Computer Science, pp. 80-91 (1982)