New and improved constructions of non-malleable cryptographic protocols

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 533-542

  Pass, Rafael ^a   Rosen, Alon ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cryptography; Man in the middle; Non black box simulation; Non malleability; Round complexity; Zero knowledge

Indexed keywords

COMPUTER SIMULATION; FUNCTIONS; NETWORK PROTOCOLS; POLYNOMIALS;

MAN-IN-THE-MIDDLE; NON BLACK-BOX SIMULATION; NON-MALLEABILITY; ROUND-COMPLEXITY; ZERO-KNOWLEDGE;

CRYPTOGRAPHY;

EID: 34848838622     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060670     Document Type: Conference Paper

References (32)

1. B. Barak. How to go Beyond the Black-Box Simulation Barrier. In 42nd FOCS, pages 106-115, 2001.
2. B. Barak. Constant-Round Coin-Tossing or Realizing the Shared Random String Model. In 43rd FOCS, p. 345-355, 2002.
3. B. Barak and O. Goldreich. Universal Arguments and their Applications. 17th CCC, pages 194-203, 2002.
4. B. Barak and Y. Lindell. Strict Polynomial-Time in Simulation and Extraction. In 34th STOC, p. 484-493, 2002.
5. R. Canetti and M. Fischlin. Universally Composable Commitments. In Crypto2001, Springer LNCS 2139, pages 19-40, 2001.
6. I. Damgård and J. Groth. Non-interactive and Reusable Non-Malleable Commitment Schemes. In 35th STOC, pages 426-437, 2003.
7. I. Damgård, T. Pedersen and B. Pfitzmann. On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures. In Crypto93, pages 250-265, 1993.
8. A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-interactive Zero Knowledge. In CRYPTO 2001, pages 566-598, 2001.
9. G. Di Crescenzo, J. Katz, R. Ostrovsky and A. Smith. Efficient and Non-interactive Non-malleable Commitment. In EUROCRYPT 2001, pages 40-59, 2001.
10. G. Di Crescenzo, Y. Ishai and R. Ostrovsky. Non-Interactive and Non-Malleable Commitment. In 30th STOC, pages 141-150, 1998
11. D. Dolev, C. Dwork and M. Naor. Non-Malleable Cryptography. SIAM Jour, on Computing, Vol. 30(2), pages 391-437, 2000.
12. Preliminary version in 23rd STOC, pages 542-552, 1991
13. U. Feige, D. Lapidot and A. Shamir. Multiple Noninteractive Zero Knowledge Proofs under General Assumptions. Siam Jour. on Computing 1999, Vol. 29(1), pages 1-28.
14. U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, p. 416-426, 1990.
15. M. Fischlin and R. Fischlin. Efficient Non-malleable Commitment Schemes. In CRYPTO 2000, Springer LNCS Vol. 1880, pages 413-431, 2000.
16. O. Goldreich. Foundation of Cryptography - Basic Tools. Cambridge University Press, 2001.
17. O. Goldreich and Y. Lindell. Session-Key Generation Using Human Passwords Only. In CRYPTO 2001, p. 408-432, 2001.
18. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38(1), pages 691-729, 1991.
19. O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218-229, 1987.
20. S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, Vol. 28(2), pages 270-299, 1984.
21. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Jour. on Computing, Vol. 18(1), pages 186-208, 1989.
22. J. Håstad, R. Impaglíazzo, L.A. Levin and M. Luby. Construction of Pseudorandom Generator from any One-Way Function. SIAM Jour. on Computing, Vol. 28 (4), pages 1364-1396, 1999.
23. J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments. In 24th STOC, pages 723-732, 1992.
24. Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 34th STOC, pages 683-692, 2003.
25. P. D. MacKenzie, M. K. Reiter, K. Yang: Alternatives to Non-malleability: Definitions, Constructions, and Applications. TCC 2004, pages 171-190, 2004.
26. S. Micali. CS Proofs. SIAM Jour. on Computing, Vol. 30 (4), pages 1253-1298, 2000.
27. M. Naor. Bit Commitment using Pseudorandomness. Jour. of Cryptology, Vol. 4, pages 151-158, 1991.
28. M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. In 21st STOC, pages 33-43, 1989.
29. M. Nguyen and S. Vadhan. Simpler Session-Key Generation from Short Random Passwords. In 1st TCC, p. 428-445, 2004.
30. R. Pass. Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In 36th STOC, 2004, pages 232-241, 2004.
31. R. Pass and A. Rosen. Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In 34th FOCS, pages 404-413, 2003.
32. A. Sahai. Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In 40th FOCS, pages 543-553, 1999.