{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:13:29Z","timestamp":1794377609739,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131899","type":"print"},{"value":"9783642131905","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13190-5_25","type":"book-chapter","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T09:16:46Z","timestamp":1274260606000},"page":"486-505","source":"Crossref","is-referenced-by-count":87,"title":["Universally Composable Quantum Multi-party Computation"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Unruh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"249","volume-title":"FOCS 2006","author":"M. Ben-Or","year":"2006","unstructured":"Ben-Or, M., Cr\u00e9peau, C., Gottesman, D., Hassidim, A., Smith, A.: Secure multiparty quantum computation with (only) a strict honest majority. In: FOCS 2006, pp. 249\u2013260. IEEE Computer Society, Los Alamitos (2006)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/978-3-540-30576-7_21","volume-title":"Theory of Cryptography","author":"M. Ben-Or","year":"2005","unstructured":"Ben-Or, M., Horodecki, M., Leung, D.W., Mayers, D., Oppenheim, J.: The universal composable security of quantum key distribution. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 386\u2013406. Springer, Heidelberg (2005); Preprint at arXiv:quant-ph\/0409078v1"},{"key":"25_CR3","unstructured":"Ben-Or, M., Mayers, D.: General security definition and composability for quantum & classical protocols. arXiv:quant-ph\/0409062v2 (September 2004)"},{"key":"25_CR4","first-page":"175","volume-title":"IEEE International Conference on Computers, Systems and Signal Processing 1984","author":"C.H. Bennett","year":"1984","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: Public-key distribution and coin tossing. In: IEEE International Conference on Computers, Systems and Signal Processing 1984, pp. 175\u2013179. IEEE Computer Society, Los Alamitos (1984)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-46766-1_29","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C.H. Bennett","year":"1992","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Skubiszewska, M.-H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 351\u2013366. Springer, Heidelberg (1992)"},{"key":"25_CR6","first-page":"362","volume-title":"FOCS 1993","author":"G. Brassard","year":"1993","unstructured":"Brassard, G., Cr\u00e9peau, C., Jozsa, R., Langlois, D.: A quantum bit commitment scheme provably unbreakable by both parties. In: FOCS 1993, Los Alamitos, CA, USA, pp. 362\u2013371. IEEE Computer Society, Los Alamitos (1993)"},{"key":"#cr-split#-25_CR7.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136???145. IEEE Computer Society, Los Alamitos (2001);","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-25_CR7.2","unstructured":"Full and revised version is IACR ePrint 2000\/067"},{"key":"25_CR8","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); Full version is IACR ePrint 2001\/055"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-03356-8_24","volume-title":"CRYPTO 2009","author":"I. Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Fehr, S., Lunemann, C., Salvail, L., Schaffner, C.: Improving the security of quantum protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 408\u2013427. Springer, Heidelberg (2009)"},{"key":"#cr-split#-25_CR10.1","doi-asserted-by":"crossref","unstructured":"Damg??rd, I., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantum-storage model. In: FOCS 2005, pp. 449???458 (2005);","DOI":"10.7146\/brics.v12i20.21886"},{"key":"#cr-split#-25_CR10.2","unstructured":"Full version is arXiv:quant-ph\/0508222v2"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/978-3-642-00457-5_21","volume-title":"TCC 2009","author":"S. Fehr","year":"2009","unstructured":"Fehr, S., Schaffner, C.: Composing quantum protocols in a classical environment. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 350\u2013367. Springer, Heidelberg (2009)"},{"key":"25_CR12","unstructured":"Hofheinz, D., M\u00fcller-Quade, J.: A paradox of quantum universal composability. In: 4th European QIPC Workshop, poster (2003), http:\/\/www.quiprocone.org\/Hot%20Topics%20posters\/muellerquade_poster.pdf"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008), http:\/\/www.springerlink.com\/content\/0l5v1l524816u652\/"},{"issue":"7","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1103\/PhysRevLett.83.1447","volume":"83","author":"A. Kent","year":"1999","unstructured":"Kent, A.: Unconditionally secure bit commitment. PRL\u00a083(7), 1447\u20131450 (1999)","journal-title":"PRL"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/62212.62215","volume-title":"STOC 1988","author":"J. Kilian","year":"1988","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC 1988, pp. 20\u201331. ACM Press, New York (1988)"},{"issue":"17","key":"25_CR16","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D. Mayers","year":"1997","unstructured":"Mayers, D.: Unconditionally Secure Quantum Bit Commitment is Impossible. Physical Review Letters\u00a078(17), 3414\u20133417 (1997); Preprint at arXiv:quant-ph\/9605044v2","journal-title":"Physical Review Letters"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-70936-7_3","volume-title":"Theory of Cryptography","author":"J. M\u00fcller-Quade","year":"2007","unstructured":"M\u00fcller-Quade, J., Unruh, D.: Long-term security and universal composability. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 41\u201360. Springer, Heidelberg (2007)"},{"key":"25_CR18","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: 22nd IEEE Symposium on Security & Privacy, pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"25_CR20","unstructured":"Unruh, D.: Simulatable security for quantum protocols (September 2004), arXiv:quant-ph\/0409125v2"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Universally composable quantum multi-party computation (October 2009), arXiv:0910.2912 [quant-ph], Full version of this paper","DOI":"10.1007\/978-3-642-13190-5_25"},{"key":"25_CR22","unstructured":"van de Graaf, J.: Towards a formal definition of security for quantum protocols. PhD thesis, D\u00e9partment d\u2019informatique et de r.o., Universit\u00e9 de Montr\u00e9al (1998), http:\/\/www.cs.mcgill.ca\/~crepeau\/PS\/these-jeroen.ps"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/1132516.1132560","volume-title":"STOC 2006","author":"J. Watrous","year":"2006","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. In: STOC 2006, pp. 296\u2013305. ACM, New York (2006)"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/978-3-540-70583-3_49","volume-title":"Automata, Languages and Programming","author":"S. Wehner","year":"2008","unstructured":"Wehner, S., Wullschleger, J.: Composable security in the bounded-quantum-storage model. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 604\u2013615. Springer, Heidelberg (2008); Full version is arXiv:0709.0492v1 [quant-ph]"},{"issue":"1","key":"25_CR25","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News\u00a015(1), 78\u201388 (1983) (manuscript written ca.\u00a01970)","journal-title":"SIGACT News"},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/225058.225085","volume-title":"STOC 1995","author":"A.C.-C. Yao","year":"1995","unstructured":"Yao, A.C.-C.: Security of quantum protocols against coherent measurements. In: STOC 1995, pp. 67\u201375. ACM, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13190-5_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T20:52:54Z","timestamp":1635367974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13190-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131899","9783642131905"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5_25","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}