Mutually independent commitments

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

Volumn 2248, Issue , 2001, Pages 385-401

  Liskov, Moses ^a   Lysyanskaya, Anna ^a   Micali, Silvio ^a   Reyzin, Leonid ^b   Smith, Adam ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

COMMITMENT PROBLEM; COMMITMENT SCHEME; MUTUALLY INDEPENDENTS; NON-MALLEABILITY; NON-MALLEABLE; SECRET VALUE;

CRYPTOGRAPHY;

EID: 33745918093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_23     Document Type: Conference Paper

References (27)

1. Manuel Blum, Alfredo De Santis, Silvio Micali, and Giuseppe Persiano. Noninteractive zero-knowledge. SIAM Journal on Computing, 20(6):1084–1118, December 1991.
2. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850–863, November 1984.
3. A. Beimel, T. Malkin, and S. Micali. The all-or-nothing nature of two-party secure computation. In Michael Wiener, editor, Advances in Cryptology—CRYPTO’99, volume 1666 of Lecture Notes in Computer Science, pages 80–97. Springer-Verlag, 15–19 August 1999.
4. Ronald Cramer, Ivan Damg˚ard, and Philip MacKenzie. Efficient zeroknowledge proofs of knowledge without intractability assumptions. In Public Key Cryptography (PKC 2000), pages 354–372. Springer-Verlag, 2000.
5. R. Canetti and M. Fischlin. Universally composable commitments. In Joe Kilian, editor, Advances in Cryptology—CRYPTO 2001, Lecture Notes in Computer Science. Springer-Verlag, 19–23 August 2001.
6. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In 26th IEEE Symposium on Foundations of Computer Science, pages 383–395, 1985.
7. Benny Chor and Michael Rabin. Achieving independence in logarithmic number of rounds. In Principles of Distributed Computing (PODC 87), pages 260–268. ACM, 1987.
8. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against chosen ciphertext attack. In Hugo Krawczyk, editor, Advances in Cryptology—CRYPTO’98, volume 1462 of Lecture Notes in Computer Science. Springer-Verlag, 23–27 August 1998.
9. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM, 30:391–437, 2000.
10. Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano. Necessary and sufficient assumptions for non-interactive zero-knowledge proofs of knowledge for all np relations. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Automata Languages and Programming: 27th International Colloquim (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 451–462. Springer-Verlag, July 9–15 2000.
11. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-interactive and nonmalleable commitment. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, Texas, 23–26 May 1998.
12. G. Di Crescenzo, J. Katz, R. Ostrovsky, and A. Smith. Efficient and noninteractive non-malleable commitment. In Birgit Pfitzmann, editor, Advances in Cryptology—EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 40–59. Springer-Verlag, 6–10 May 2001.
13. Alfredo De Santis and Giuseppe Persiano. Zero-knowledge proofs of knowledge without interaction. In 33rd Annual Symposium on Foundations of Computer Science, pages 427–436, Pittsburgh, Pennsylvania, 24–27 October 1992. IEEE.
14. M. Fischlin and R. Fischlin. Efficient non-malleable commitment schemes. In Mihir Bellare, editor, Advances in Cryptology—CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science. Springer-Verlag, 20–24 August 2000.
15. Uriel Feige, Amos Fiat, and Adi Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1(2):77–94, 1988.
16. Uriel Feige and Adi Shamir. Zero knowledge proofs of knowledge in two rounds. In G. Brassard, editor, Advances in Cryptology—CRYPTO’89, volume 435 of Lecture Notes in Computer Science, pages 526–545. Springer-Verlag, 1990, 20–24 August 1989.
17. Rosario Gennaro. Achieving independence efficiently and securely. In Principles of Distributed Computing (PODC 95), pages 130–136. ACM, 1995.
18. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 25–32, Seattle, Washington, 15–17 May 1989.
19. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270–299, April 1984.
20. Shafi Goldwasser, Silvio Micali, and Charles Rackoff. Knowledge complexity of interactive proofs. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 291–304, Providence, Rhode Island, 6–8 May 1985.
21. Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281–308, April 1988.
22. J. Katz, R. Ostrovsky, and A. Smith. Personal Communication.
23. Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151–158, 1991.
24. Torben Pryds Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology—CRYPTO’91, volume 576 of Lecture Notes in Computer Science, pages 129–140. Springer-Verlag, 1992, 11–15 August 1991.
25. Amit Sahai. Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security. In 40th Annual Symposium on Foundations of Computer Science, New York, October 1999. IEEE.
26. C. P. Schnorr. Efficient identification and signatures for smart cards. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology—EUROCRYPT 89, volume 434 of Lecture Notes in Computer Science, pages 688–689. Springer-Verlag, 1990, 10–13 April 1989.
27. Martin Tompa and Heather Woll. Random self-reducibility and zero knowledge interactive proofs of possession of information. In 28th Annual Symposium on Foundations of Computer Science, pages 472–482, Los Angeles, California, 12–14 October 1987. IEEE.