{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:32:20Z","timestamp":1780392740690,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642103650","type":"print"},{"value":"9783642103667","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10366-7_4","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T03:08:44Z","timestamp":1259636924000},"page":"52-69","source":"Crossref","is-referenced-by-count":14,"title":["Quantum-Secure Coin-Flipping and Applications"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carolin","family":"Lunemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","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":"4_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"key":"4_CR3","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":"4_CR4","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\u2014CRYPTO 2009","author":"I.B. Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Lunemann, C., Salvail, L., Schaffner, C.: Improving the security of quantum protocols via commit-and-open. In: Halevi, S. (ed.) Advances in Cryptology\u2014CRYPTO 2009. LNCS, vol.\u00a05677, pp. 408\u2013427. Springer, Heidelberg (2009), http:\/\/arxiv.org\/abs\/0902.3918"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-540-28628-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"I.B. Damg\u00e5rd","year":"2004","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Salvail, L.: Zero-knowledge proofs and string commitments withstanding quantum attacks. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 254\u2013272. Springer, Heidelberg (2004)"},{"key":"4_CR6","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.B. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I.B., 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)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B., Goldreich, O., Wigderson, A.: Hashing functions can simplify zero-knowledge protocol design (too). Technical Report RS-94-39, BRICS, Department of Computer Science, Aarhus University, Denmark (1994)","DOI":"10.7146\/brics.v1i39.21604"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/978-3-642-00457-5_21","volume-title":"TCC 2009","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":"4_CR9","series-title":"Basic Tools","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Tools, vol.\u00a0I. Cambridge University Press, Cambridge (2001)"},{"key":"4_CR10","unstructured":"Goldreich, O.: Zero-knowledge twenty years after its invention (2002), http:\/\/www.wisdom.weizmann.ac.il\/~oded\/papers.html"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th Annual ACM Symposium on Theory of Computing (STOC), pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"4_CR12","unstructured":"van de Graaf, J.: Towards a formal definition of security for quantum protocols. PhD thesis, Universit\u00e9 de Montr\u00e9al (1997)"},{"key":"4_CR13","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":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-540-24587-2_20","volume-title":"Algorithms and Computation","author":"H. Kobayashi","year":"2003","unstructured":"Kobayashi, H.: Non-interactive quantum perfect and statistical zero-knowledge. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 178\u2013188. Springer, Heidelberg (2003)"},{"issue":"2","key":"4_CR15","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. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"4_CR16","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":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Limits on the power of quantum statistical zero-knowledge. In: 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 459\u2013468 (2002)","DOI":"10.1109\/SFCS.2002.1181970"},{"key":"#cr-split#-4_CR20.1","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. SIAM Journal on Computing\u00a039.1, 25-58 (2009)","DOI":"10.1137\/060670997"},{"key":"#cr-split#-4_CR20.2","unstructured":"Preliminary version in 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 296-305 (2006)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"W.K. Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature\u00a0299, 802\u2013803 (1982)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10366-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T14:40:07Z","timestamp":1739457607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10366-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642103650","9783642103667"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10366-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}