Long-term security and universal composability

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

Volumn 4392 LNCS, Issue , 2007, Pages 41-60

  Müller Quade, Jörn ^a   Unruh, Dominique ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Commitment; Long term security; Universal composability; Zero knowledge

Indexed keywords

ALGORITHMS; KNOWLEDGE MANAGEMENT; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

LONG-TERM SECURITY; UNIVERSAL COMPOSABILITY; ZERO-KNOWLEDGE;

SECURITY OF DATA;

EID: 38049062044     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_3     Document Type: Conference Paper

References (23)

1. Boaz Barak, Ran Canetti, Jesper Buus Nielsen, and Rafael Pass. Universally composable protocols with relaxed set-up assumptions. In 45th Symposium on Foundations of Computer Science, Proceedings of FOCS 2004, 17-19 October 2004, Rome, Italy, pages 186-195. IEEE Computer Society, October 2004.
2. Gilles Brassard, David Chaum, and Claude Crépeau. Minimum disclosure proofs of knowledge, 1988. JCSS, 37:156-189.
3. Gilles Brassard, Claude Crépeau, Dominic Mayers, and Louis Salvail. Defeating classical bit commitments with a quantum computer. Los Alamos preprint archive quant-ph/9806031, May 1999.
4. Christian Cachin, Claude Crépeau, and Julien Marcil. Oblivious transfer with a memory-bounded receiver. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pages 493-502. ACM Press, 2002.
5. Christian Cachin and Ueli Maurer. Unconditional security against memory-bounded adversaries. In Burton S. Kaliski Jr., editor, Advances in Cryptology, Proceedings of CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 292-306. Springer-Verlag, 1997.
6. 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.
7. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. IACR ePrint Archive, December 2005. Full and revised version of [6].
8. Ran Canetti, Yevgeniy Dodis, Rafael Pass, and Shabsi Walfish. Universally composable security with global setup. These proceedings.
9. Ran Canetti and Marc Fischlin. Universally composable commitments. In Joe Kilian, editor, Advances in Cryptology, Proceedings of CRYPTO '01, volume 2139 of Lecture Notes in Computer Science, pages 19-40. Springer-Verlag, 2001.
10. 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.
11. 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 '02, volume 2442 of Lecture Notes in Computer Science, pages 581-596. Springer-Verlag, 2002.
12. Stefan Dziembowski and Ueli Maurer. On generating the initial key in the bounded-storage model. In Christian Cachin and Jan Camenisch, editors, Advances in Cryptology, Proceedings of EUROCRYPT '04, volume 3027 of Lecture Notes in Computer Science, pages 126-137. Springer-Verlag, 2004.
13. Uriel Feige, Dror Lapidot, and Adi Shamir. Multiple non-interactive zero knowledge proofs under general assumptions. SIAM Journal on Computing, 29(1):1-28, 1999.
14. Oded Goldreich. Foundations of Cryptography - Volume 1 (Basic Tools). Cambridge University Press, August 2001.
15. Oded Goldreich. Foundations of Cryptography - Volume 2 (Basic Applications). Cambridge University Press, May 2004.
16. Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(3):690-728, 1991.
17. Dennis Hofheinz, Jörn Müller-Quade, and Dominique Unruh. Universally composable zero-knowledge arguments and commitments from signature cards. In Proceedings of the 5th Central European Conference on Cryptology, MoraviaCrypt '05, 2005.
18. Yehuda Lindell. General composition and universal composability in secure multi-party computation. In 44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003, pages 394-403. IEEE Computer Society, 2003.
19. Jörn Müller-Quade and Dominique Unruh. Long-term security and universal composability, 2006. Full version of this paper, IACR ePrint 2006/422.
20. Jörn Müller-Quade. Temporary assumptions - quantum and classical. In The 2005 IEEE Information Theory Workshop On Theory and Practice in Information-Theoretic Security, 2005. abstract.
21. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, and Moti Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology, 11(2):87-108, March 1998.
22. Michael O. Rabin. Hyper-encryption by virtual satellite. Science Center Research Lecture Series, December 2003.
23. Gesetz über Rahmenbedingungen fur elektronische Signaturen. Bundesgesetzblatt I 2001, 876, May 2001.