New and improved constructions of nonmalleable cryptographic protocols

SIAM Journal on Computing

Volumn 38, Issue 2, 2008, Pages 702-752

  Pass, Rafael ^a   Rosen, Alon ^b  

^a School of Operations Research and Information Engineering   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Cryptography; Man in the middle; Nonblack box simulation; Nonmalleability; Round complexity; Zero knowledge

Indexed keywords

MAN-IN-THE-MIDDLE; NONBLACK-BOX SIMULATION; NONMALLEABILITY; ROUND-COMPLEXITY; ZERO-KNOWLEDGE;

COMPUTER NETWORKS; FUNCTIONS; MODULAR CONSTRUCTION; PROBABILITY DENSITY FUNCTION;

CRYPTOGRAPHY;

EID: 55249123399     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060671553     Document Type: Conference Paper

References (38)

1. B. BARAK, How to go beyond the black-box simulation barrier, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001, pp. 106 115.
2. B. BARAK, Constant-round coin-tossing or realizing the shared random string model, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, 2002, pp. 345 - 355.
3. B. BARAK AND O. GOLDREICH, Universal arguments and their applications, in Proceedings of the 17th IEEE Conference on Computational Complexity, 2002, pp. 194-203.
4. M. BELLARE AND O. GOLDREICH, On defining proofs of knowledge, in Advances in Cryptology - CRYPTO'92, Lecture Notes in Comput. Sci. 740, Springer, Berlin, 1993, pp. 390-420.
5. M. BLUM, Coin flipping by telephone, in Advances in Cryptology - CRYPTO 1981, Springer, Berlin, pp. 11-15.
6. G. BRASSARD, D. CHAUM, AND C. CREPEAU, Minimum disclosure proofs of knowledge, J. Comput. System Sci., 37 (1988), pp. 156-189.
7. R. CANETTI AND M. FISCHLIN, Universally compos able commitments, in Advances in Cryptology - CRYPTO 2001, Lecture Notes in Comput. Sci. 2139, Springer, Berlin, pp. 19 - 40.
8. I. DAMGÅRD, A design principle for hash functions, in Advances in Cryptology - CRYPTO 1989, Springer, Berlin, pp. 416 - 427.
9. I. DAMGÅRD AND J. GROTH, Non-interactive and reusable nonmalleable commitment schemes, in Proceedings of the 35th ACM Symposium on Theory of Computing, 2003, pp. 426 - 437.
10. I. DAMGÅRD, T. PEDERSEN, AND B. PFITZMANN, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, J. Cryptology, 10 (1997), pp. 163 - 194.
11. A. DE SANTIS, G. DI CRESCENZO, R. OSTROVSKY, G. PERSIANO, AND A. SAHAI, Robust non-interactive zero knowledge, in Advances in Cryptology - CRYPTO, Springer, Berlin, 2001, pp. 566-598.
12. G. DI CRESCENZO, J. KATZ, R. OSTROVSKY, AND A. SMITH, Efficient and non-interactive nonmalleable commitment, in Advances in Cryptology - EURO CRYPT 2001, Springer, Berlin, pp. 40-59.
13. G. DI CRESCENZO, Y. ISHAI, AND R. OSTROVSKY, Non-interactive and nonmalleable commitment, in Proceedings of the 30th ACM Symposium on Theory of Computing, 1998, pp.141-150.
14. D. DOLEV, C. DWORK, AND M. NAOR, Nonmalleable cryptography, SIAM J. Comput., 30 (2000), pp. 391-437.
15. U. FEIGE, D. LAPIDOT, AND A. SHAMIR, Multiple noninteractive zero knowledge proofs under general assumptions, SIAM J. Comput., 29 (1999), pp. 1 - 28.
16. U. FEIGE AND A. SHAMIR, Witness indistinguishability and witness hiding protocols, in Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 416 - 426.
17. M. FISCHLIN AND R. FISCHLIN, Efficient nonmalleable commitment schemes, in Advances in Cryptology - CRYPTO 2000, Lecture Notes in Comput. Sci. 1880, Springer, Berlin, 2000, pp. 413-431.
18. O. GOLDREICH, Foundation of Cryptography - Basic Tools, Cambridge University Press, Cambridge, UK, 2001.
19. O. GOLDREICH AND A. KAHAN, HOW to construct constant-round zero-knowledge proof systems for NP, J. Cryptology, 9 (1996), pp. 167-189.
20. O. GOLD REICH AND Y. LINDELL, Session-key generation using human passwords only, in Advances in Cryptology - CRYPTO 2001, Springer, Berlin, pp. 408-432.
21. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, J. Assoc. Comput. Mach., 38 (1991), pp. 691-729.
22. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, How to play any mental game - a completeness theorem for protocols with honest majority, in Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, pp. 218-229.
23. O. GOLDREICH AND Y. OREN, Definitions and, properties of zero-knowledge proof systems, J. Cryptology, 7 (1994), pp. 1-32.
24. S. GOLDWASSER AND S. MICALI, Probabilistic encryption, J. Comput. System Sci., 28 (1984), pp. 270-299.
25. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proof systems, SIAM J. Comput., 18 (1989), pp. 186-208.
26. J. HASTAD, R. IMPAGLIAZZO, L.A. LEVIN, AND M. LUBY, A pseudorandom generator from any one-way function, SIAM J. Comput., 28 (1999), pp. 1364-1396.
27. J. KILIAN, A note on efficient zero-knowledge proofs and arguments, in Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp. 723 - 732.
28. P. D. MACKENZIE, M. K. RE ITER, AND K. YANG, Alternatives to nonmalleability: Definitions, constructions, and applications, in Proceedings of the 1st Theory of Cryptology Conference, 2004, pp. 171-190.
29. R. C. MERKLE, A certified digital signature, in Advances in Cryptology-CRYPTO 1989, Springer, Berlin, pp. 218-238.
30. S. MICALI, Computationally sound proofs, SIAM J. Comput., 30 (2000), pp. 1253-1298.
31. M. NAOR, Bit commitment using pseudorandomness, J. Cryptology, 4 (1991), pp. 151-158.
32. M. NAOR, R. OSTROVSKY, R. VENKATESAN, AND M. YUNG, Perfect zero-know ledge arguments for NP using any one-way permutation, J. Cryptology, 11 (1998), pp. 87 - 108.
33. M. NAOR AND M. YUNG, Universal one-way hash functions and their cryptographic applications, in Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 33 - 43.
34. M. NGUYEN AND S. VADHAN, Simpler session-key generation from short random passwords, in Proceedings of the 1st Theory of Cryptology Conference, 2004, pp. 428 - 445.
35. R. PASS Bounded-concurrent secure multi-party computation with a dishonest majority, in Proceedings of the 36th ACM Symposium on Theory of Computing, 2004, pp. 232 - 241.
36. R. PASS AND A. ROSEN, Bounded-concurrent secure two-party computation in a constant number of rounds, in Proceedings of the 34th Symposium on Foundations of Computer Science, 2003, pp. 404-413.
37. R. PASS AND A. ROSEN, Concurrent nonmalleable commitments, in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, 2005, pp. 563-572.
38. A. SAHAI, Nonmalleable non-interactive zero knowledge and adaptive chosen-ciphertext security, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999, pp. 543-553.