{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:01:18Z","timestamp":1790499678027,"version":"4.1.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T00:00:00Z","timestamp":1520294400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00145-018-9278-z","type":"journal-article","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T20:36:38Z","timestamp":1520368598000},"page":"965-1011","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Everlasting Multi-party Computation"],"prefix":"10.1007","volume":"31","author":[{"given":"Dominique","family":"Unruh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,6]]},"reference":[{"key":"9278_CR1","unstructured":"R. Alleaume, J. Bouda, C. Branciard, T. Debuisschert, M. Dianati, N. Gisin, M. Godfrey, P. Grangier, T. Langer, A. Leverrier, N. Lutkenhaus, P. Painchault, M. Peev, A. Poppe, T. Pornin, J. Rarity, R. Renner, G. Ribordy, M. Riguidel, L. Salvail, A. Shields, H. Weinfurter, A. Zeilinger, Secoqc white paper on quantum key distribution and cryptography (2007). arXiv:quant-ph\/0701168v1"},{"key":"9278_CR2","unstructured":"C.H. Bennett, G. Brassard, Quantum cryptography: Public-key distribution and coin tossing, in IEEE International Conference on Computers, Systems and Signal Processing 1984, (IEEE Computer Society, 1984), pp 175\u2013179"},{"key":"9278_CR3","unstructured":"Bundesnetzagentur and BSI. Algorithms for qualified electronic signatures, (May 2011)"},{"key":"9278_CR4","doi-asserted-by":"crossref","unstructured":"C.H. Bennett, G. Brassard, C. Cr\u00e9peau, M.-H. Skubiszewska, Practical quantum oblivious transfer, in Crypto \u201991. LNCS, vol. 576, (Springer, 1991), pp. 351\u2013366","DOI":"10.1007\/3-540-46766-1_29"},{"key":"9278_CR5","unstructured":"D. Bernstein, 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":"9278_CR6","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, M. Horodecki, D.W. Leung, D. Mayers, J. Oppenheim, The universal composable security of quantum key distribution, in TCC 2005. LNCS, vol. 3378 (Springer, 2005) pp. 386\u2013406. Preprint at arXiv:quant-ph\/0409078v1","DOI":"10.1007\/978-3-540-30576-7_21"},{"key":"9278_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in FOCS 2001. (IEEE Computer Society, 2001), pp. 136\u2013145. Full and revised version is IACR ePrint 2000\/067","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9278_CR8","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, P. Dumais, D. Mayers, L. Salvail, Computational collapse of quantum state with application to oblivious transfer, in TCC 2004. LNCS, vol. 2951 (Springer, 2004), pp. 374\u2013393","DOI":"10.1007\/978-3-540-24638-1_21"},{"key":"9278_CR9","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Dodis, R. Pass, S. Walfish, Universally composable security with global setup, in Theory of Cryptography, Proceedings of TCC 2007, Lecture Notes in Computer Science, vol. 4392 (Springer, March 2007), pp. 61\u201385. Preprint on IACR ePrint 2006\/432","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"9278_CR10","doi-asserted-by":"crossref","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments, in Crypto 2001. LNCS, vol. 2139 (Springer, 2001), pp .19\u201340. Full version is IACR ePrint 2001\/055","DOI":"10.1007\/3-540-44647-8_2"},{"key":"9278_CR11","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, J. Kilian, Achieving oblivious transfer using weakened security assumptions (extended abstract), in FOCS 1988. (IEEE, 1988), pp. 42\u201352.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"9278_CR12","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, S. Fehr, C. Lunemann, L. Salvail, C. Schaffner, Improving the security of quantum protocols, in Crypto 2009. LNCS, vol. 5677 (Springer, 2009), pp. 408\u2013427. Full version is arXiv:0902.3918v3","DOI":"10.1007\/978-3-642-03356-8_24"},{"key":"9278_CR13","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, S. Fehr, L. Salvail, C. Schaffner, Cryptography in the bounded quantum-storage model, in FOCS 2005. (2005), pp. 449\u2013458. Full version is arXiv:quant-ph\/0508222v2","DOI":"10.1109\/SFCS.2005.30"},{"key":"9278_CR14","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor, in M. Yung, editor, Advances in Cryptology, Proceedings of CRYPTO \u201902, LNCS, vol. 2442, (Springer, 2002), pp. 581\u2013596. Full version online available at http:\/\/eprint.iacr.org\/2001\/091","DOI":"10.1007\/3-540-45708-9_37"},{"key":"9278_CR15","unstructured":"ECRYPT II. Yearly report on algorithms and keysizes. D.SPA.17 Rev. 1.0, ICT-2007-216676, (2011)"},{"key":"9278_CR16","unstructured":"Gesetz \u00fcber Rahmenbedingungen f\u00fcr elektronische Signaturen. Bundesgesetzblatt I 2001, 876, (May 2001) Online available at http:\/\/bundesrecht.juris.de\/sigg_2001\/index.html"},{"key":"9278_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography\u2014Volume\u00a01 (Basic Tools)","author":"O Goldreich","year":"2001","unstructured":"O. Goldreich, Foundations of Cryptography \u2013 (Basic Tools). Cambridge University Press, Cambridge (2001)"},{"key":"9278_CR18","unstructured":"D. Harnik, M. Naor, On everlasting security in the hybrid bounded storage model, in M. Bugliesi, B. Preneel, V. Sassone, I. Wegener, editors, ICALP 2006. LNCS, vol. 4052, (Springer, 2006), pp. 192\u2013203."},{"key":"9278_CR19","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, D. Unruh, Comparing two notions of simulatability, in TCC 2005. LNCS, vol. 3378, (Springer, 2005), pp. 86\u2013103","DOI":"10.1007\/978-3-540-30576-7_6"},{"key":"9278_CR20","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, D. Unruh, Simulatable security and polynomially bounded concurrent composition, in IEEE Symposium on Security and Privacy 2006. (IEEE Computer Society, 2006), pp. 169\u2013182. Full version is IACR ePrint 2006\/130.","DOI":"10.1109\/SP.2006.36"},{"key":"9278_CR21","unstructured":"D. Hofheinz, D. Unruh, J. M\u00fcller-Quade, Universally composable zero-knowledge arguments and commitments from signature cards. Tatra Mt. Math. Pub., pp. 93\u2013103 (2007)"},{"key":"9278_CR22","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer\u2014efficiently, in Crypto \u201908. LNCS, vol. 5157, (2008), pp. 572\u2013591"},{"key":"9278_CR23","doi-asserted-by":"crossref","unstructured":"J. Kilian, Founding cryptography on oblivious transfer, in STOC (1988), pp. 20\u201331. ACM","DOI":"10.1145\/62212.62215"},{"key":"9278_CR24","doi-asserted-by":"crossref","unstructured":"H.-K. Lo, Insecurity of quantum secure computations. Phys. Rev. A 56:1154\u20131162, (Aug 1997). Eprint on arXiv:quant-ph\/9611031v2","DOI":"10.1103\/PhysRevA.56.1154"},{"key":"9278_CR25","unstructured":"U. Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptol. 5(1), 53\u201366, (1992). Online available at ftp:\/\/ftp.inf.ethz.ch\/pub\/crypto\/publications\/Maurer92b.pdf ."},{"key":"9278_CR26","doi-asserted-by":"crossref","unstructured":"D.\u00a0Mayers, Unconditionally secure quantum bit commitment is impossible. Phys Rev. Lett. 78(17), 3414\u20133417 (1997). Preprint at arXiv:quant-ph\/9605044v2 .","DOI":"10.1103\/PhysRevLett.78.3414"},{"issue":"4","key":"9278_CR27","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s00145-010-9068-8","volume":"23","author":"J M\u00fcller-Quade","year":"2010","unstructured":"J. M\u00fcller-Quade, D. Unruh, Long-term security and universal composability. J. Cryptol., 23(4):594\u2013671, (2010)","journal-title":"J. Cryptol."},{"key":"9278_CR28","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information. Cambridge University Press, Cambridge 2000."},{"key":"9278_CR29","unstructured":"NIST. Recommendation for key management. Special Publication 800-57 Part 1 Rev. 3, May (2011)"},{"issue":"6","key":"9278_CR30","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"O. Regev. On lattices learning with errors, random linear codes, and cryptography. J. ACM 56(6): 34 (2009)","journal-title":"J. ACM"},{"key":"9278_CR31","unstructured":"R. Renner, R. K\u00f6nig, Universally composable privacy amplification against quantum adversaries, in J. Kilian, editor, TCC 2005. Lecture Notes in Computer Science, vol. 3378, (Springer, 2005), pp. 407\u2013425. Full version on arXiv:quant-ph\/0403133v2 ."},{"key":"9278_CR32","doi-asserted-by":"crossref","unstructured":"D. Raub, J. M\u00fcller-Quade, R. Steinwandt, On the security and composability of the one time pad, in P. Vojt\u00e1s, M. Bielikov\u00e1, B. Charron-Bost, O. S\u00fdkora, editors, Theory and Practice of Computer Science, Proceedings of SOFSEM 2005. Lecture Notes in Computer Science, vol. 3381, (Springer, 2005), pp. 288\u2013297. Extended version online available at http:\/\/eprint.iacr.org\/2004\/113.ps","DOI":"10.1007\/978-3-540-30577-4_32"},{"key":"9278_CR33","unstructured":"D. Unruh, Protokollkomposition und Komplexit\u00e4t. PhD thesis, Universit\u00e4t Karlsruhe (TH), Berlin, 2006. In German, online available at http:\/\/crypto.m2ci.org\/unruh\/publications\/unruh07protokollkomposition.html"},{"key":"9278_CR34","doi-asserted-by":"crossref","unstructured":"D. Unruh. Universally composable quantum multi-party computation, in Eurocrypt 2010. LNCS, (Springer, 2010), pp. 486\u2013505. Preprint on arXiv:0910.2912 .","DOI":"10.1007\/978-3-642-13190-5_25"},{"key":"9278_CR35","unstructured":"D. Unruh, Concurrent composition in the bounded quantum storage model, in Eurocrypt 2011. LNCS, vol. 6632, (Springer, 2011), pp. 467\u2013486. Preprint on IACR ePrint 2010\/229."},{"key":"9278_CR36","unstructured":"D. Unruh, Quantum proofs of knowledge, in Eurocrypt 2012. LNCS, vol. 7237, (Springer, 2012), pp. 135\u2013152. Preprint on IACR ePrint 2010\/212."},{"key":"9278_CR37","doi-asserted-by":"publisher","unstructured":"D. Unruh, Everlasting multi-party computation, in R. Canetti, J.A. Garay, editors, Crypto 2013. LNCS, vol. 8043, (Springer, 2013), pp. 380\u2013397. https:\/\/doi.org\/10.1007\/978-3-642-40084-1_22 .","DOI":"10.1007\/978-3-642-40084-1_22"},{"issue":"1","key":"9278_CR38","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/060670997","volume":"39","author":"J Watrous","year":"2009","unstructured":"J. Watrous. Zero-knowledge against quantum attacks. SIAM J. Comput. 39(1):25\u201358, (2009)","journal-title":"SIAM J. Comput."},{"key":"9278_CR39","doi-asserted-by":"crossref","unstructured":"J. Wullschleger, Oblivious-Transfer Amplification. PhD thesis, ETH Zurich, March 2007. arXiv:cs\/0608076v3 .","DOI":"10.1007\/978-3-540-72540-4_32"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-018-9278-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9278-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9278-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T12:27:58Z","timestamp":1751459278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-018-9278-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,6]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9278"],"URL":"https:\/\/doi.org\/10.1007\/s00145-018-9278-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,6]]},"assertion":[{"value":"23 August 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}