Mercurial commitments: Minimal assumptions and efficient constructions

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

Volumn 3876 LNCS, Issue , 2006, Pages 120-144

  Catalano, Dario ^a   Dodis, Yevgeniy ^b   Visconti, Ivan ^c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b POLYTECHNIC UNIVERSITY   (United States)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATABASE SYSTEMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; RANDOM PROCESSES; SET THEORY;

SHARED RANDOM STRING (SRS); TRAPDOOR MERCURIAL COMMITMENTS (TMC); TRUSTED PARAMETERS (TP); ZERO-KNOWLEDGE SETS;

KNOWLEDGE BASED SYSTEMS;

EID: 33745523137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_7     Document Type: Conference Paper

References (34)

1. M. Abdalla and L. Reyzin. A new forward-secure digital signature scheme. In T. Okamoto, editor, Advances in Cryptology - ASIACRYPT 2000, volume 1976 of Lecture Notes in Computer Science, pages 116-129, Kyoto, Japan, 3-7 Dec. 2000. Springer-Verlag. Full version available from the Cryptology ePrint Archive, record 2000/002, http://eprint.iacr.org/.
2. Manuel Blum, Alfredo De Santis, Silvio Micali, and Guiseppe Persiano. Noninteractive zero-knowledge. SIAM Journal of Computing, 20(6), 1991.
3. Joan Boyar, S. A. Kurtz, Mark W. Krentel. A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. In J. of Cryptology, 2(2);63-76, 1990.
4. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2);156-189, Oct. 1988.
5. Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham, Phong Q. Nguyen. Paillier's cryptosystem revisited. In ACM Conference on Computer and Communications Security 2001, pp. 206-214.
6. D. Catalano and I. Visconti. Hybrid Trapdoor Commitments and Their Applications. In 32nd International Colloquium on Automata, Languages, and Programming (ICALP 05), volume 3580 of Lecture Notes in Computer Science, pages 298-310. Springer-Verlag, 2005.
7. D. Catalano and I. Visconti. Non-Interactive Mercurial Commitments from OneWay Functions. Cryptology ePrint Archive, 2005.
8. Melissa Chase, Alexander Healy, Anna Lysysanskaya, Tal Malkin and Leonid Reyzin. Mercurial Commitments with Applications to Zero-Knowledge Sets. In Proc. of EUROCRYPT, pp. 422-439, 2005.
9. Ivan Damgård, Eiichiro Fujisaki. A Statistically-Hliding Integer Commitment Scheme Based on Groups with Hidden Order. In ASIACRYPT 2002, pp. 125-142.
10. Ivan Damgård, Mats Jurik. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. Public Key Cryptography 2001, pp. 119-136.
11. I. Damgård and J. B. Nielsen. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In M. Yung, editor, Advances in Cryptology-CRYPTO 2002, Lecture Notes in Computer Science. Springer-Verlag, 18-22 Aug. 2002.
12. I. B. Damgård, T. P. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. Journal of Cryptology, 10(3):163-194, Summer 1997.
13. Y. Dodis. Minimal Assumptions for Efficient Mercurial Commitments. Cryptology ePrint Archive, Report 2005/438.
14. Y. Dodis and L. Reyzin. On the power of claw-free permutations. In Conference on Security in Communication Networks, 2002.
15. U. Feige, D. Lapidot, and A. Shamir. Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Computing, 29(1), 1999.
16. U. Feige and A. 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 Aug. 1989.
17. U. Feige and A. Shamir. Witness indistinguishability and witness hiding protocols. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 416-426, Baltimore, Maryland, 14-16 May 1990.
18. A. Fiat and A. Shamir. How to prove yourself; Practical solutions to identification and signature problems. In A. M. Odlyzko, editor, Advances in Cryptology -CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer-Verlag, 1987, 11-15 Aug. 1986.
19. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. S. Kaliski Jr., editor, Advances in Cryptology -CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 16-30. Springer-Verlag, 17-21 Aug. 1997.
20. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
21. S. Goldwasser, S. Micali, and C. 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.
22. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2), 1988.
23. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(1):691-729, 1991.
24. L. C. Guillou and J.-J. Quisquater. A "paradoxical" identity-based signature scheme resulting from zero-knowledge. In S. Goldwasser, editor, Advances in Cryptology - CRYPTO '88, volume 403 of Lecture Notes in Computer Science, pages 216-231. Springer-Verlag, 1990, 21-25 Aug. 1988.
25. S. Halevi and S. Micali. Practical and provably-secure commitment schemes from collision-free hashing. In N. Koblitz, editor, Advances in Cryptology -CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 201-215. Springer-Verlag, 18-22 Aug. 1996.
26. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Computing, 28(4), 1999.
27. H. Krawczyk and T. Rabin. Chameleon signatures. In Network and Distributed System Security Symposium, pages 143-154. The Internet Society, 2000.
28. Silvio Micali, Michael Rabin, and Joe Kilian. Zero-knowledge sets. In Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
29. Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):51-158, 1991.
30. H. Ong and C. P. Schnorr. Fast signature generation with a Fiat Shamir-like scheme. In I. B. Damgard, editor, Advances in Cryptology - EUROCRYPT 90, volume 473 of Lecture Notes in Computer Science, pages 432-440. Springer-Verlag, 1991, 21-24 May 1990.
31. R. Ostrovsky, C. Rackoff, and A. Smith. Efficient consistency proofs for generalized queries on a committed database. In 31st International Colloquium on Automata, Languages, and Programming (ICALP 04), volume 3142 of Lecture Notes in Computer Science, pages 1041-1053. Springer-Verlag, 2004.
32. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science. Springer-Verlag, 2-6 May 1999.
33. A. Shamir and Y. Tauman. Improved online/offline signature schemes. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 355-367. Springer-Verlag, 19-23 Aug. 2001.
34. C.-P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3);161-174, 1991.