Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor

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

Volumn 2442, Issue , 2002, Pages 581-596

  Damgård, Ivan ^a   Nielsen, Jesper Buus ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EXPANSION;

ADAPTIVE ADVERSARY; EXPANSION FACTORS; MODULAR EXPONENTIATIONS; PAILLIER CRYPTOSYSTEM; TRAPDOOR COMMITMENTS; UNIVERSAL COMPOSABILITY; UNIVERSALLY COMPOSABLE; ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE;

CRYPTOGRAPHY;

EID: 84937437506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45708-9_37     Document Type: Conference Paper

References (8)

1. Can01. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42th Annual Symposium on Foundations of Computer Science. IEEE, 2001
2. CD98. Ronald Cramer and Ivan Damgaard. Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free. In Hugo Krawczyk, editor, Advances in Cryptology - Crypto ’98, pages 424–441, Berlin, 1998. Springer- Verlag. Lecture Notes in Computer Science Volume 1462
3. CDS94. R. Cramer, I. B. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Yvo Desmedt, editor, Advances in Cryptology - Crypto ’94, pages 174–187, Berlin, 1994 Springer-Verlag. Lecture Notes in Computer Science Volume 839
4. CF01. Ran Canetti and Marc Fischlin. Universally composable commitments. In J. Kilian, editor, Advances in Cryptology - Crypto 2001, pages 19–40, Berlin, 2001. Springer-Verlag. Lecture Notes in Computer Science Volume 2139
5. Dam00. Ivan Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. In Bart Preneel, editor, Advances in Cryptology- EuroCrypt 2000, pages 418–430, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 1807
6. KMO89. Joe Kilian, Silvio Micali, and Rafail Ostrovsky. Minimum resource zeroknowledge proofs (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, pages 474–479, Research Triangle Park, North Carolina, 30 October–1 November 1989. IEEE
7. OU98. Tatsuaki Okamoto and Shigenori Uchiyama. A new public-key cryptosystem as secure as factoring. In K. Nyberg, editor, Advances in Cryptology - EuroCrypt ’98, pages 308–318, Berlin, 1998. Springer-Verlag. Lecture Notes in Computer Science Volume 1403
8. Pai99. P. Paillier. Public-key cryptosystems based on composite degree residue classes. In Jacques Stern, editor, Advances in Cryptology - EuroCrypt ’99, pages 223–238, Berlin, 1999. Springer-Verlag. Lecture Notes in Computer Science Volume 1592