{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T01:12:11Z","timestamp":1793063531016,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642400834","type":"print"},{"value":"9783642400841","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40084-1_22","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T05:56:37Z","timestamp":1376459797000},"page":"380-397","source":"Crossref","is-referenced-by-count":35,"title":["Everlasting Multi-party Computation"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Unruh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"ECRYPT II: Yearly report on algorithms and keysizes. D.SPA.17 Rev. 1.0, ICT-2007-216676 (June 2011)"},{"key":"22_CR2","unstructured":"NIST: Recommendation for key management. Special Publication 800-57 Part 1 Rev. 3 (May 2011)"},{"key":"22_CR3","unstructured":"Bundesnetzagentur, B.S.I.: Algorithms for qualified electronic signatures (May 2011)"},{"key":"22_CR4","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 (1984)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: FOCS 1988, pp. 42\u201352. IEEE (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC 1988, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"issue":"17","key":"22_CR7","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)","journal-title":"Physical Review Letters"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Lo, H.K.: Insecurity of quantum secure computations. Phys. Rev. A. 56, 1154\u20131162 (August 1997) Eprint on arXiv:quant-ph\/9611031v2","DOI":"10.1103\/PhysRevA.56.1154"},{"key":"22_CR9","unstructured":"Bernstein, D.: Cost-benefit analysis of quantum cryptography. Classical and Quantum Information Assurance Foundations and Practice, Dagstuhl Seminar 09311 (2009), Abstract at http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2365 , slides at http:\/\/cr.yp.to\/talks\/2009.07.28\/slides.pdf"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-13190-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D. Unruh","year":"2010","unstructured":"Unruh, D.: Universally composable quantum multi-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 486\u2013505. Springer, Heidelberg (2010)"},{"key":"22_CR11","unstructured":"Alleaume, R., et al.: Secoqc white paper on quantum key distribution and cryptography. arXiv:quant-ph\/0701168v1 (2007)"},{"key":"22_CR12","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)"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s00145-010-9068-8","volume":"23","author":"J. M\u00fcller-Quade","year":"2010","unstructured":"M\u00fcller-Quade, J., Unruh, D.: Long-term security and universal composability. Journal of Cryptology\u00a023(4), 594\u2013671 (2010)","journal-title":"Journal of Cryptology"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"22_CR15","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":"22_CR16","unstructured":"Gesetz \u00fcber Rahmenbedingungen f\u00fcr elektronische Signaturen. Bundesgesetzblatt I 2001, 876 (May 2001), http:\/\/bundesrecht.juris.de\/sigg_2001\/index.html"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D. Unruh","year":"2012","unstructured":"Unruh, D.: Quantum proofs of knowledge. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 135\u2013152. Springer, Heidelberg (2012)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantum-storage model. In: FOCS 2005, pp. 449\u2013458 (2005)","DOI":"10.7146\/brics.v12i20.21886"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-642-20465-4_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D. Unruh","year":"2011","unstructured":"Unruh, D.: Concurrent composition in the bounded quantum storage model. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 467\u2013486. Springer, Heidelberg (2011)"},{"issue":"1","key":"22_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U. Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"Journal of Cryptology"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/11787006_17","volume-title":"Automata, Languages and Programming","author":"D. Harnik","year":"2006","unstructured":"Harnik, D., Naor, M.: On everlasting security in the hybrid bounded storage model. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 192\u2013203. Springer, Heidelberg (2006)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-24638-1_21","volume-title":"Theory of Cryptography","author":"C. Cr\u00e9peau","year":"2004","unstructured":"Cr\u00e9peau, C., Dumais, P., Mayers, D., Salvail, L.: Computational collapse of quantum state with application to oblivious transfer. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 374\u2013393. Springer, Heidelberg (2004)"},{"key":"22_CR23","unstructured":"Unruh, D.: Everlasting multi-party computation. IACR ePrint 2012\/177, Full version of this paper (2013)"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-30576-7_22","volume-title":"Theory of Cryptography","author":"R. Renner","year":"2005","unstructured":"Renner, R., K\u00f6nig, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 407\u2013425. Springer, Heidelberg (2005)"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-30577-4_32","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"D. Raub","year":"2005","unstructured":"Raub, D., Steinwandt, R., M\u00fcller-Quade, J.: On the security and composability of the one time pad. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 288\u2013297. Springer, Heidelberg (2005)"},{"key":"22_CR27","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":"Advances in Cryptology - 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 via commit-and-open. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 408\u2013427. Springer, Heidelberg (2009)"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM\u00a056(6) (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 (Basic Tools), vol.\u00a01. Cambridge University Press (August 2001)","DOI":"10.1017\/CBO9780511546891"},{"issue":"1","key":"22_CR30","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/060670997","volume":"39","author":"J. Watrous","year":"2009","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. SIAM J. Comput.\u00a039(1), 25\u201358 (2009)","journal-title":"SIAM J. Comput."},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"22_CR32","unstructured":"Wullschleger, J.: Oblivious-Transfer Amplification. PhD thesis, ETH Zurich, arXiv:cs\/0608076v3 [cs.CR] (March 2007)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40084-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T19:38:52Z","timestamp":1563651532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40084-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400834","9783642400841"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40084-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}