Universally composable commitments using random oracles

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

Volumn 2951, Issue , 2004, Pages 58-76

  Hofheinz, Dennis ^a   Müller Quade, Jörn ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Commitment; Cryptographic protocols; Random oracle; Universal composition

Indexed keywords

CRYPTOGRAPHY; HASH FUNCTIONS;

COMMITMENT; COMMITMENT PROTOCOLS; COMMON REFERENCE STRING; COMMON REFERENCE STRING MODELS; CRYPTOGRAPHIC PROTOCOLS; RANDOM ORACLE; UNIVERSAL COMPOSABILITY; UNIVERSALLY COMPOSABLE;

BINS;

EID: 35048859832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_4     Document Type: Article

References (15)

1. [BBP03] Mihir Bellare, Alexandra Boldyreva, and Adriana Palacio. An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. IACR ePrint Archive, August 2003. Online available at http://eprint.iacr.org/2003/ 077.ps.
2. [BR93] Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security, Proceedings of CCS 1993, pages 62-73. ACM Press, 1993. Pull version online available at http://www.cs.ucsd.edu/users/mihir/ papers/ro.ps.
3. [Can01] Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pages 136-145. IEEE Computer Society, 2001. Full version online available at http://eprint.iacr.org/2000/067.ps.
4. [CF01] Ran Canetti and Marc Fischlin. Universally composable commitments. In Joe Kilian, editor, Advances in Cryptology, Proceedings of CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 19-40. Springer-Verlag, 2001. Full version online available at http://eprint.iacr.org/2001/055.ps.
5. [CGH98] Ran Canetti, Oded Goldreich, and Shai Halevi. The random oracle methodology, revisited. In Thirtieth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1998, pages 209-218. ACM Press, 1998. Preliminary version, extended version online available at http://eprint.iacr.org/1998/011. ps.
6. [CLOS02] Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pages 494-503. ACM Press, 2002. Extended abstract, full version online available at http://eprint.iacr.org/2002/140.ps.
7. [Dam90] Ivan Bjerre Damgård. A design principle for hash functions. In Gilles Brassard, editor, Advances in Cryptology, Proceedings of CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 416-427. Springer-Verlag, 1990.
8. [DG03] Ivan Damgård and Jens Groth. Non-interactive and reusable non-malleable commitment schemes. In 35th Annual ACM Symposium on Theory of Computing, Proceedings of STOC SOUS, pages 426-437. ACM Press, 2003. Pull version online available at http://eprint.iacr.org/2003/080.ps.
9. [DN02] Ivan Damgård and Jesper Buus Nielsen. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In Moti Yung, editor, Advances in Cryptology, Proceedings of CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 581-596. Springer-Verlag, 2002. Pull version online available at http://eprint.iacr.org/ 2001/091.
10. [GMW87] Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In Nineteenth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1987, pages 218-229. ACM Press, 1987. Extended abstract.
11. [Go102] Oded Goldreich. Secure multi-party computation. Online available at http : //www.wisdom.weizmann. ac. il/~oded/PS/prot.ps, October 2002.
12. [GTK03] Shafi Goldwasser and Yael Tauman Kalai. On the (in)security of the Fiat-Shamir paradigm. In 44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003, pages 102-113. IEEE Computer Society, 2003. Full version online available at http://eprint.iacr.org/2003/034.
13. [HMQS03a] Dennis Hofheinz, Jörn Müller-Quade, and Rainer Steinwandt. Initiatorresilient universally composable key exchange. In Einar Snekkenes and Dieter Gollmann, editors, Computer Security, Proceedings of ESORICS 2003, volume 2808 of Lecture Notes in Computer Science, pages 61-84. Springer-Verlag, 2003. Online available at http://eprint.iacr.org/2003/063.ps.
14. [HMQS03b] Dennis Hofheinz, Jörn Müller-Quade, and Rainer Steinwandt. On modeling IND-CCA security in cryptographic protocols. IACR ePrint Archive, February 2003. Online available at http://eprint.iacr.org/2003/024.ps.
15. [Nie02] Jesper B. Nielsen. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In Moti Yung, editor, Advances in Cryptology, Proceedings of CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 111-126. Springer-Verlag, 2002.