{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T13:42:05Z","timestamp":1790516525014,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709350","type":"print"},{"value":"9783540709367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70936-7_3","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T07:43:44Z","timestamp":1179301424000},"page":"41-60","source":"Crossref","is-referenced-by-count":23,"title":["Long-Term Security and Universal Composability"],"prefix":"10.1007","author":[{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"186","volume-title":"45th Symposium on Foundations of Computer Science, Proceedings of FOCS 2004","author":"B. Barak","year":"2004","unstructured":"Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: 45th Symposium on Foundations of Computer Science, Proceedings of FOCS 2004, Rome, Italy, 17-19 October 2004, pp. 186\u2013195. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"3_CR2","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. JCSS\u00a037, 156\u2013189 (1988)","journal-title":"JCSS"},{"key":"3_CR3","unstructured":"Brassard, G., Cr\u00e9peau, C., Mayers, D., Salvail, L.: Defeating classical bit commitments with a quantum computer. Los Alamos preprint archive quant-ph\/9806031 (May 1999)"},{"key":"3_CR4","first-page":"493","volume-title":"34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002","author":"C. Cachin","year":"2002","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pp. 493\u2013502. ACM Press, New York (2002)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"C. Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 292\u2013306. Springer, Heidelberg (1997)"},{"key":"3_CR6","first-page":"136","volume-title":"42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136\u2013145. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. IACR ePrint Archive (December 2005) Full and revised version of Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136\u2013145. IEEE Computer Society Press, Los Alamitos (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 61\u201385. Springer, Heidelberg (2007)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1145\/509907.509980","volume-title":"34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation (Extended abstract). In: 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pp. 494\u2013503. ACM Press, New York (2002)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-45708-9_37","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 581\u2013596. Springer, Heidelberg (2002)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/978-3-540-24676-3_8","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S. Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.: On generating the initial key in the bounded-storage model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 126\u2013137. Springer, Heidelberg (2004)"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs under general assumptions. SIAM Journal on Computing\u00a029(1), 1\u201328 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography \u2013 Volume\u00a01 (Basic Tools)","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 Volume\u00a01 (Basic Tools). Cambridge University Press, Cambridge (August 2001)"},{"key":"3_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography \u2013 Volume\u00a02 (Basic Applications)","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 Volume\u00a02 (Basic Applications). Cambridge University Press, Cambridge (May 2004)"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM\u00a038(3), 690\u2013728 (1991), doi:10.1145\/116825.116852","journal-title":"Journal of the ACM"},{"key":"3_CR17","unstructured":"Hofheinz, D., M\u00fcller-Quade, J., Unruh, D.: Universally composable zero-knowledge arguments and commitments from signature cards. In: Proceedings of the 5th Central European Conference on Cryptology, MoraviaCrypt \u201905 (2005)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/SFCS.2003.1238213","volume-title":"44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation. In: 44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003, pp. 394\u2013403. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"3_CR19","unstructured":"M\u00fcller-Quade, J., Unruh, D.: Long-term security and universal composability (2006), Full version of this paper, IACR ePrint 2006\/422"},{"key":"3_CR20","volume-title":"The 2005 IEEE Information Theory Workshop On Theory and Practice in Information-Theoretic Security","author":"J. M\u00fcller-Quade","year":"2005","unstructured":"M\u00fcller-Quade, J.: Temporary assumptions\u2014quantum and classical (abstract). In: The 2005 IEEE Information Theory Workshop On Theory and Practice in Information-Theoretic Security, IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology\u00a011(2), 87\u2013108 (1998)","journal-title":"Journal of Cryptology"},{"key":"3_CR22","unstructured":"Rabin, M.O.: Hyper-encryption by virtual satellite. Science Center Research Lecture Series (December 2003)"},{"key":"3_CR23","unstructured":"Gesetz \u00fcber Rahmenbedingungen f\u00fcr elektronische Signaturen. Bundesgesetzblatt I 2001, 876 (May 2001)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70936-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:12:57Z","timestamp":1605744777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70936-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709350","9783540709367"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70936-7_3","relation":{},"subject":[]}}