On simulation-sound trapdoor commitments

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

Volumn 3027, Issue , 2004, Pages 382-400

  MacKenzie, Philip ^a   Yang, Ke ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

EFFICIENT CONSTRUCTION; NON-MALLEABLE; NON-MALLEABLE COMMITMENT; ONE-WAY FUNCTIONS; TRAPDOOR COMMITMENTS; UNIVERSALLY COMPOSABLE; ZERO-KNOWLEDGE PROTOCOLS;

ARTIFICIAL INTELLIGENCE;

EID: 35048882590     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_23     Document Type: Article

References (40)

1. N. Barić and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology - EUROCRYPT '97 (LNCS 1233), 480-494, 1997.
2. D. Beaver. Adaptive zero-knowledge and computational equivocation. In 28th ACM Symp. on Theory of Computing, 629-638, 1996.
3. M. Blum. Coin flipping by telephone. In IEEE Spring COMPCOM, pp. 133-137, 1982.
4. G. Brassard, D. Chaum, and C. Crépeau. Minimum Disclosure Proofs of Knowledge. JCSS, 37(2):156-189, 1988.
5. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd IEEE Symp. on Foundations of Computer Sci., 136-145, 2001.
6. R. Canetti and M. Fischlin. Universally composable commitments. In Advances in Cryptology - CRYPTO 2001 (LNCS 2139), 19-40, 2001.
7. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally composable twoparty computation. In 34th ACM Symp. on Theory of Computing, 494-503, 2002.
8. Full version in ePrint archive, Report 2002/140. http://eprint.iacr.org/, 2002.
9. S. A. Cook. The complexity of theorem-proving procedures. In 3rd IEEE Symp. on Foundations of Computer Sci., 151-158, 1971.
10. R. Cramer and I. Damgård. Zero-Knowledge Proofs for Finite Field Arithmetic, or: Can Zero-Knowledge Be for Free? In Advances in Cryptology - CRYPTO '98 (LNCS 1462), pages 424-441, 1998.
11. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology CRYPTO '94 (LNCS 839), pages 174-187, 1994.
12. R. Cramer and V. Shoup. Signature scheme based on the strong RSA assumption. In ACM Trans. on Information and System Security 3(3):161-185, 2000.
13. I. Damgård. On the existence of bit commitment schemes and zero-knowledge proofs. In Advances in Cryptology - CRYPTO '89 (LNCS 435), 17-29, 1989.
14. I. Damgård. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In Advances in Cryptology - EUROGRYPT 2000 (LNCS 1807), 418-30, 2000.
15. I. Damgård and J. Groth. Non-interactive and reusable non-malleable commitment schemes. In 35th ACM Symp. on Theory of Computing, 426-437, 2003.
16. I. Damgård and J. Nielsen. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In Advances in Cryptology - CRYPTO 2002 (LNCS 2442), 581-596, 2002. Full version in ePrint Archive, report 2001/091. http://eprint.iacr.org/, 2001.
17. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-interactive and non-malleable commitment. In 30th ACM Symp. on Theory of Computing, 141-150, 1998.
18. G. Di Crescenzo, J. Katz, R. Ostrovsky, and A. Smith. Efficient and NonInteractive Non-Malleable Commitment. In Advances in Cryptology - EUROCRYPT 2001 (LNCS 2045), 40-59, 2001.
19. D. Dolev, C. Dwork and M. Naor. Non-malleable cryptography. SIAM J. on Comput., 30(2):391-437, 2000.
20. Also in 23rd ACM Symp. on Theory of Computing, 542-552, 1991.
21. S. Even, O. Goldreich, and S. Micali. On-line/Off-line digital signatures. J. Cryptology 9(l):35-67 (1996).
22. U. Feige and A. Shamir. Witness Indistinguishable and Witness Hiding Protocols. In 22nd ACM Symp. on Theory of Computing, 416-426, 1990.
23. U. Feige and A. Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. In Advances in Cryptology - CRYPTO '89 (LNCS 435), 526-544, 1989.
24. M. Fischlin. The Cramer-Shoup strong-RSA signature scheme revisited. In Public Key Cryptography - PKC 2003 (LNCS 2567), 116-129, 2003.
25. M. Fischlin and R. Fischlin. Efficient non-malleable commitment schemes. In Advances in Cryptology - CRYPTO 2000 (LNCS 1880), 413-431, 2000.
26. J. A. Garay, P. MacKenzie, and K. Yang. Strengthening Zero-Knowledge Protocols using Signatures. In Advances in Cryptology - EUROGRYPT 2003 (LNCS 2656), 177-194, 2003.
27. R. Gennaro. Improved Proofs of Knowledge Secure under Concurrent Man-inthe-middle Attacks and their Applications. In ePrint Archive, report 2003/214. http://eprint.iacr.org/, 2003.
28. 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. ACM, 38(3):691729, 1991.
29. S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17:281-308, 1988.
30. S. Jarecki and A. Lysyanskaya. Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures. In Advances in Cryptology - EUROCRYPT 2000 (LNCS 1807), 221-242, 2000.
31. D. W. Kravitz. Digital signature algorithm. U.S. Patent 5,231,668, 27 July 1993.
32. L. A. Levin. Universal sorting problems. Problemy Peredaci Informacii, 9:115-116, 1973.
33. In Russian. Engl. trans.: Problems of Information Transmission 9:265-266.
34. P. MacKenzie and K. Yang. On simulation-sound trapdoor commitments (full version). Available on the Cryptology ePrint Archive: http://eprint.iacr.org/ 2003/252.
35. M. Naor. Bit commitment Using Pseudo-Randomness. J. Cryptology 4(2):151-158 (1991).
36. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. In Advances in Cryptology - CRYPTO '92 (LNCS 740), 196-214, 1992.
37. T. P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Advances in Cryptology - CRYPTO '91 (LNCS 576), 129-140, 1991.
38. L. Reyzin. Zero-knowledge with public keys. Ph.D. Thesis, MIT, 2001.
39. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In 22nd ACM Symp. on Theory of Computing, 387-394, 1990.
40. A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosenciphertext security. In 40th IEEE Symp. on Foundations of Computer Sci., 543553, 1999.