{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:52:53Z","timestamp":1771703573755,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642227912","type":"print"},{"value":"9783642227929","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22792-9_23","type":"book-chapter","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T15:32:14Z","timestamp":1312558334000},"page":"411-428","source":"Crossref","is-referenced-by-count":32,"title":["Classical Cryptographic Protocols in a Quantum World"],"prefix":"10.1007","author":[{"given":"Sean","family":"Hallgren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","first-page":"543","volume-title":"FOCS","author":"B. Barak","year":"2005","unstructured":"Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In: FOCS, pp. 543\u2013552. IEEE, Los Alamitos (2005)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-46035-7_23","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"D. Beaver","year":"2002","unstructured":"Beaver, D.: On deniability in quantum key exchange. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 352\u2013367. Springer, Heidelberg (2002)"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1145\/100216.100287","volume-title":"STOC","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: STOC, pp. 503\u2013513. ACM, New York (1990)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"23_CR5","first-page":"249","volume-title":"FOCS","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, pp. 249\u2013260. IEEE, Los Alamitos (2006)"},{"key":"23_CR6","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":"23_CR7","unstructured":"Ben-Or, M., Mayers, D.: General security definition and composability for quantum and classical protocols, arxiv:quant-ph\/0409062v2 (September 2004)"},{"key":"23_CR8","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":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-38424-3_4","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"G. Brassard","year":"1991","unstructured":"Brassard, G., Cr\u00e9peau, C.: Quantum bit commitment and coin tossing protocols. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 49\u201361. Springer, Heidelberg (1991)"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"23_CR11","first-page":"136","volume-title":"FOCS","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE, Los Alamitos (2001)"},{"key":"23_CR12","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":"23_CR13","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1145\/509907.509980","volume-title":"STOC","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503. ACM, New York (2002)"},{"key":"23_CR14","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":"23_CR15","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/509907.510000","volume-title":"STOC","author":"C. Cr\u00e9peau","year":"2002","unstructured":"Cr\u00e9peau, C., Gottesman, D., Smith, A.: Secure multi-party quantum computation. In: STOC, pp. 643\u2013652. ACM, New York (2002)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11426639_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"C. Cr\u00e9peau","year":"2005","unstructured":"Cr\u00e9peau, C., Gottesman, D., Smith, A.: Approximate quantum error-correcting codes and secret sharing schemes. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 285\u2013301. Springer, Heidelberg (2005)"},{"key":"23_CR17","unstructured":"Cr\u00e9peau, C., Salvail, L., Simard, J.-R., Tapp Classical, A.: quantum strategies for two-prover bit commitments. In: Quantum Information Processing, QIP (2006), http:\/\/crypto.cs.mcgill.ca\/~crepeau\/PDF\/CSST06.pdf"},{"key":"23_CR18","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), Full version at arXiv:0902.3918v4"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-74143-5_19","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Fehr, S., Salvail, L., Schaffner, C.: Secure identification and qkd in the bounded-quantum-storage model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 342\u2013359. Springer, Heidelberg (2007)"},{"issue":"6","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1137\/060651343","volume":"37","author":"I. Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded-quantum-storage model. SIAM J. Comput.\u00a037(6), 1865\u20131890 (2008)","journal-title":"SIAM J. Comput."},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-10366-7_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"I. Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Lunemann, C.: Quantum-secure coin-flipping and applications. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 52\u201369. Springer, Heidelberg (2009)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45539-6_21","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"P. Dumais","year":"2000","unstructured":"Dumais, P., Mayers, D., Salvail, L.: Perfectly concealing quantum bit commitment from any quantum one-way permutation. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 300\u2013315. Springer, Heidelberg (2000)"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-00457-5_21","volume-title":"Theory of Cryptography","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":"23_CR24","first-page":"526","volume-title":"CRYPTO","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: CRYPTO, pp. 526\u2013544. Springer, Heidelberg(1990)"},{"key":"23_CR25","first-page":"218","volume-title":"STOC","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229. ACM, New York (1987)"},{"issue":"3","key":"23_CR26","doi-asserted-by":"publisher","first-page":"691","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 for all languages in np have zero-knowledge proof systems. J. ACM\u00a038(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"23_CR27","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput.\u00a018, 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1206035.1206039","volume":"54","author":"S. Hallgren","year":"2007","unstructured":"Hallgren, S.: Polynomial-time quantum algorithms for Pell\u2019s equation and the principal ideal problem. J. ACM\u00a054(1), 1\u201319 (2007)","journal-title":"J. ACM"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-540-70583-3_48","volume-title":"Automata, Languages and Programming","author":"S. Hallgren","year":"2008","unstructured":"Hallgren, S., Kolla, A., Sen, P., Zhang, S.: Making classical honest verifier zero knowledge protocols secure against quantum attacks. 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. 592\u2013603. Springer, Heidelberg (2008)"},{"key":"23_CR30","first-page":"169","volume-title":"Symposium on Security and Privacy","author":"D. Hofheinz","year":"2006","unstructured":"Hofheinz, D., Unruh, D.: Simulatable security and polynomially bounded concurrent composability. In: Symposium on Security and Privacy, pp. 169\u2013183. IEEE, Los Alamitos (2006)"},{"key":"23_CR31","first-page":"423","volume-title":"STOC","author":"G. Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Games for exchanging information. In: STOC, pp. 423\u2013432. ACM, New York (2008)"},{"issue":"5","key":"23_CR32","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/090755886","volume":"39","author":"E. Kushilevitz","year":"2010","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. SIAM J. Comput.\u00a039(5), 2090\u20132112 (2010)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"23_CR33","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00145-002-0143-7","volume":"16","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. J. Cryptology\u00a016(3), 143\u2013184 (2003)","journal-title":"J. Cryptology"},{"issue":"3","key":"23_CR34","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00145-008-9021-2","volume":"22","author":"Y. Lindell","year":"2009","unstructured":"Lindell, Y.: General composition and universal composability in secure multiparty computation. J. Cryptology\u00a022(3), 395\u2013428 (2009)","journal-title":"J. Cryptology"},{"issue":"5410","key":"23_CR35","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1126\/science.283.5410.2050","volume":"283","author":"H.-K. Lo","year":"1999","unstructured":"Lo, H.-K., Chau, H.F.: Unconditional security of quantum key distribution over arbitrarily long distances. Science\u00a0283(5410), 2050\u20132056 (1999)","journal-title":"Science"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Lunemann, C., Nielsen, J.B.: Fully simulatable quantum-secure coin-flipping and applications. In: Africacrypt (February 2011); arXiv:1102.0887","DOI":"10.1007\/978-3-642-21969-6_2"},{"issue":"3","key":"23_CR37","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/382780.382781","volume":"48","author":"D. Mayers","year":"2001","unstructured":"Mayers, D.: Unconditional security in quantum cryptography. J. ACM\u00a048(3), 351\u2013406 (2001)","journal-title":"J. ACM"},{"issue":"2","key":"23_CR38","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"23_CR39","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":"23_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 160\u2013176. Springer, Heidelberg (2003)"},{"key":"23_CR41","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/1007352.1007394","volume-title":"STOC","author":"M. Prabhakaran","year":"2004","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC, pp. 242\u2013251. ACM, New York (2004)"},{"key":"#cr-split#-23_CR42.1","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM??56(6) (2009);","DOI":"10.1145\/1568318.1568324"},{"key":"#cr-split#-23_CR42.2","unstructured":"Preliminary version in STOC 2005"},{"issue":"5","key":"23_CR43","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"23_CR44","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1103\/PhysRevLett.85.441","volume":"85","author":"P.W. Shor","year":"2000","unstructured":"Shor, P.W., Preskill, J.: Simple proof of security of the BB84 quantum key distribution protocol. Phys. Rev. Lett.\u00a085(2), 441\u2013444 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"23_CR45","unstructured":"Unruh, D.: Simulatable security for quantum protocols, arXiv:quant-ph\/0409125v2 (2004)"},{"key":"23_CR46","unstructured":"Unruh, D.: Quantum proofs of knowledge, IACR ePrint 2010\/212 (April 2010)"},{"key":"23_CR47","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); arXiv:0910.2912v1"},{"key":"23_CR48","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":"23_CR49","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); Preliminary version in STOC 2006","journal-title":"SIAM J. Comput."},{"key":"23_CR50","first-page":"352","volume-title":"FOCS","author":"A.C.-C. Yao","year":"1993","unstructured":"Yao, A.C.-C.: Quantum circuit complexity. In: FOCS, pp. 352\u2013361. IEEE, Los Alamitos (1993)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22792-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T15:17:47Z","timestamp":1686237467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22792-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642227912","9783642227929"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22792-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}