{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T01:18:55Z","timestamp":1773537535107,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705826","type":"print"},{"value":"9783540705833","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_49","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"604-615","source":"Crossref","is-referenced-by-count":11,"title":["Composable Security in the Bounded-Quantum-Storage Model"],"prefix":"10.1007","author":[{"given":"Stephanie","family":"Wehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrg","family":"Wullschleger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd IEEE FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"issue":"1","key":"49_CR2","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)","journal-title":"SIGACT News"},{"key":"49_CR3","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"issue":"6","key":"49_CR4","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-44750-4_9","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"C. Cr\u00e9peau","year":"1995","unstructured":"Cr\u00e9peau, C., van de Graaf, J., Tapp, A.: Committed oblivious transfer and private multi-party computation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 110\u2013123. Springer, Heidelberg (1995)"},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M. Blum","year":"1983","unstructured":"Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News\u00a015(1), 23\u201327 (1983)","journal-title":"SIGACT News"},{"key":"49_CR8","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, 3414\u20133417 (1997)","journal-title":"Physical Review Letters"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","volume":"78","author":"H.K. Lo","year":"1997","unstructured":"Lo, H.K., Chau, H.F.: Is quantum bit commitment really possible? Physical Review Letters\u00a078, 3410\u20133413 (1997)","journal-title":"Physical Review Letters"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"52326","DOI":"10.1103\/PhysRevA.69.052326","volume":"69","author":"A. Kitaev","year":"2004","unstructured":"Kitaev, A., Mayers, D., Preskill, J.: Superselection rules and quantum protocols. Physical Review A\u00a069, 052326 (2004)","journal-title":"Physical Review A"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"12310","DOI":"10.1103\/PhysRevA.65.012310","volume":"65","author":"R. Spekkens","year":"2002","unstructured":"Spekkens, R., Rudolph, T.: Degrees of concealment and bindingness in quantum bit commitment protocols. Physical Review A\u00a065, 012310 (2002)","journal-title":"Physical Review A"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/BFb0055740","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"L. Salvail","year":"1998","unstructured":"Salvail, L.: Quantum bit commitment from a physical assumption. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 338\u2013353. Springer, Heidelberg (1998)"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"250501","DOI":"10.1103\/PhysRevLett.97.250501","volume":"97","author":"H. Buhrman","year":"2006","unstructured":"Buhrman, H., Christandl, M., Hayden, P., Lo, H.K., Wehner, S.: Security of quantum bit string commitment depends on the information measure. Physical Review Letters\u00a097, 250501 (2006)","journal-title":"Physical Review Letters"},{"key":"49_CR14","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, H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 351\u2013366. Springer, Heidelberg (1992)"},{"issue":"12","key":"49_CR15","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1080\/09500349414552301","volume":"41","author":"C. Cr\u00e9peau","year":"1994","unstructured":"Cr\u00e9peau, C.: Quantum oblivious transfer. J. of Mod. Opt.\u00a041(12), 2455\u20132466 (1994)","journal-title":"J. of Mod. Opt."},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the Bounded Quantum-Storage Model. In: 46th IEEE FOCS, pp. 449\u2013458 (2005)","DOI":"10.7146\/brics.v12i20.21886"},{"key":"49_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Fehr, S., Renner, R., Salvail, L., Schaffner, C.: A tight high-order entropic uncertainty relation with applications in the bounded quantum-storage model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622. Springer, Heidelberg (2007)"},{"key":"49_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"49_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 377\u2013391. Springer, Heidelberg (1992)"},{"issue":"1","key":"49_CR20","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. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th IEEE FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: IEEE SP, p. 184 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"49_CR23","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A universally composable cryptographic library (2003), http:\/\/eprint.iacr.org\/2003\/015"},{"key":"49_CR24","unstructured":"van de Graaf, J.: Towards a formal definition of security for quantum protocols. Ph.D. thesis (1998), http:\/\/www.cs.mcgill.ca\/~crepeau\/PS\/these-jeroen.ps"},{"key":"49_CR25","unstructured":"Smith, A.: Multi-party quantum computation. Masters Thesis (2001), quant-ph\/0111030"},{"key":"49_CR26","unstructured":"Ben-Or, M., Mayers, D.: General security definition and composability for quantum and classical protocols (2004), quant-ph\/0409062"},{"key":"49_CR27","unstructured":"Unruh, D.: Simulatable security for quantum protocols (2004), quant-ph\/0409125"},{"key":"49_CR28","unstructured":"Unruh, D.: Formal security in quantum cryptology. Student research project, Institut f\u00fcr Algorithmen und Kognitive Systeme. University of Karlsruhe (2002)"},{"key":"49_CR29","unstructured":"Fehr, S., Schaffner, C.: Composing quantum protocols in a classical environment (2008), arxiv:0804.1059"},{"key":"49_CR30","unstructured":"Estren, G.: Universally composable committed oblivious transfer and multi-party computation assuming only basic black-box. M.Sc. thesis, School of Computer Science. McGill University (2004)"},{"key":"49_CR31","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"49_CR32","volume-title":"Quantum Information: An introduction","author":"M. Hayashi","year":"2006","unstructured":"Hayashi, M.: Quantum Information: An introduction. Springer, Heidelberg (2006)"},{"key":"49_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"49_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11593447_11","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"R. Renner","year":"2005","unstructured":"Renner, R., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 199\u2013216. Springer, Heidelberg (2005)"},{"key":"49_CR35","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018, 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"49_CR36","unstructured":"Renner, R.: Security of Quantum Key Distribution. PhD thesis, ETH Zurich, Switzerland (2005), http:\/\/arxiv.org\/abs\/quant-ph\/0512258"},{"key":"49_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515. Springer, Heidelberg (2007)"},{"key":"49_CR38","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks (2005), quant-ph\/0511020","DOI":"10.1145\/1132516.1132560"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:04Z","timestamp":1605762484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}