{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:08:04Z","timestamp":1794348484234,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540741428","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74143-5_19","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T09:51:33Z","timestamp":1186653093000},"page":"342-359","source":"Crossref","is-referenced-by-count":32,"title":["Secure Identification and QKD in the Bounded-Quantum-Storage Model"],"prefix":"10.1007","author":[{"given":"Ivan B.","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Serge","family":"Fehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis","family":"Salvail","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Schaffner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"6","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TIT.2002.1003845","volume":"48","author":"Y. Aumann","year":"2002","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory\u00a048(6), 1668\u20131680 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR2","first-page":"493","volume-title":"FOCS","author":"C. Cachin","year":"1998","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: FOCS. 39th Annual IEEE Symposium on Foundations of Computer Science, pp. 493\u2013502. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Renner, R., Salvail, L., Schaffner, C.: A tight high-order entropic quantum uncertainty relation with applications. In: CRYPTO 2007 Proceedings (2007)","DOI":"10.1007\/978-3-540-74143-5_20"},{"key":"19_CR4","first-page":"449","volume-title":"FOCS","author":"I.B. Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantum-storage model. In: FOCS. 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 449\u2013458. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"19_CR5","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Salvail, L., Schaffner, C.: Secure identification and QKD in the bounded-quantum-storage model (2007), Available at http:\/\/eprint.iacr.org\/2007\/"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11818175_14","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"Y. Dodis","year":"2006","unstructured":"Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Robust fuzzy extractors and authenticated key agreement from close secrets. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 232\u2013250. Springer, Heidelberg (2006)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1145\/1060590.1060688","volume-title":"STOC","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Smith, A.: Correcting errors without leaking partial information. In: STOC. 37th Annual ACM Symposium on Theory of Computing, pp. 654\u2013663. ACM Press, New York (2005)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/978-3-540-24676-3_8","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S. Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.M.: On generating the initial key in the bounded-storage model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 126\u2013137. Springer, Heidelberg (2004)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Elliott, C., Pearson, D., Troxel, G.: Quantum cryptography in practice. In: SIGCOMM 2003. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 227\u2013238 (2003)","DOI":"10.1145\/863955.863982"},{"key":"19_CR10","unstructured":"Fehr, S., Schaffner, C.: Randomness extraction via delta-biased masking in the presence of a quantum attacker (2007), Available at http:\/\/eprint.iacr.org\/2007\/"},{"key":"19_CR11","first-page":"210","volume-title":"STOC","author":"U. Feige","year":"1987","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero knowledge proofs of identity. In: STOC. 19th Annual ACM Symposium on Theory of Computing, pp. 210\u2013217. ACM Press, New York (1987)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO 1986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/3-540-39200-9_33","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Gennaro","year":"2003","unstructured":"Gennaro, R., Lindell, Y.: A framework for password-based authenticated key exchange. In: Biham, E. (ed.) Advances in Cryptology \u2013 EUROCRPYT 2003. LNCS, vol.\u00a02656, pp. 524\u2013543. Springer, Heidelberg (2003)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","first-page":"473","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Katz","year":"2001","unstructured":"Katz, J., Ostrovsky, R., Yung, M.: Efficient password-authenticated key exchange using human-memorable passwords. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 473\u2013492. Springer, Heidelberg (2001)"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1103\/PhysRevA.56.1154","volume":"56","author":"H.-K. Lo","year":"1997","unstructured":"Lo, H.-K.: Insecurity of quantum secure computations. Physical Review A\u00a056(2), 1154\u20131162 (1997)","journal-title":"Physical Review A"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00145-004-0142-y","volume":"18","author":"H.-K. Lo","year":"2005","unstructured":"Lo, H.-K., Chau, H.F., Ardehali, M.: Efficient quantum key distribution scheme and a proof of its unconditional security. Journal of Cryptology\u00a018(2), 133\u2013165 (2005)","journal-title":"Journal of Cryptology"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-46877-3_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"U.M. Maurer","year":"1991","unstructured":"Maurer, U.M.: A provably-secure strongly-randomized cipher. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 361\u2013373. Springer, Heidelberg (1991)"},{"key":"19_CR18","unstructured":"Nielsen, J.B., Pedersen, T.B., Salvail, L.: Secure two-party quantum computation against semi-honest adversaries (in preparation)"},{"key":"19_CR19","unstructured":"Renner, R.: Security of Quantum Key Distribution. PhD thesis, ETH Z\u00fcrich (2005), http:\/\/arxiv.org\/abs\/quant-ph\/0512258"},{"key":"19_CR20","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":"19_CR21","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)"},{"issue":"6","key":"19_CR22","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1109\/TIT.1983.1056765","volume":"29","author":"C. Thommesen","year":"1983","unstructured":"Thommesen, C.: The existence of binary linear concatenated codes with reed - solomon outer codes which asymptotically meet the gilbert- varshamov bound. IEEE Transactions on Information Theory\u00a029(6), 850\u2013853 (1983)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:18:06Z","timestamp":1605745086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741428"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_19","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5","asserted-by":"object"}]},"subject":[]}}