{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:20:45Z","timestamp":1775794845282,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-10536-3_10","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:41:12Z","timestamp":1767321672000},"page":"264-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bit Security of\u00a0Quantum Key Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0597-8297","authenticated-orcid":false,"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]},{"given":"Evangelos","family":"Gkoumas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4), 702\u2013732 (2004). (Preliminary Version in 43rd FOCS, 2002). https:\/\/doi.org\/10.1016\/j.jcss.2003.11.006","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"10_CR2","unstructured":"Barker, E.: NIST SP 800-57 Part 1 Rev. 5: recommendation for key management: part 1 \u2013 general. Technical report, National Institute of Standards and Technology (2020)"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Boaron, A., et al.: Secure quantum key distribution over 421 km of optical fiber. Phys. Rev. Lett. 121, 190502 (2018). https:\/\/doi.org\/10.1103\/PhysRevLett.121.190502. https:\/\/link.aps.org\/doi\/10.1103\/PhysRevLett.121.190502","DOI":"10.1103\/PhysRevLett.121.190502"},{"issue":"4\u20135","key":"10_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschr. Phys."},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Bunandar, D., Govia, L., Krovi, H., Englund, D.: Numerical finite-key analysis of quantum key distribution. npj Quant. Inf. 6 (2020). https:\/\/doi.org\/10.1038\/s41534-020-00322-w","DOI":"10.1038\/s41534-020-00322-w"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bundesamt f\u00fcr Sicherheit in der Informationstechnik: BSI TR-02102-1: cryptographic mechanisms: recommendations and key lengths. Technical report, Bundesamt f\u00fcr Sicherheit in der Informationstechnik (2024)","DOI":"10.1007\/978-3-658-23669-4_104-1"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Chen, L.: Recommendation for key derivation using pseudorandom functions. Technical report. NIST Special Publication (SP) 800-108-r1-upd1. National Institute of Standards and Technology (NIST), Gaithersburg, MD (2024). https:\/\/doi.org\/10.6028\/NIST.SP.800-108r1-upd1","DOI":"10.6028\/NIST.SP.800-108r1-upd1"},{"key":"10_CR8","unstructured":"Cogliati, B., Fouque, P.A., Goubin, L., Minaud, B.: New security proofs and techniques for hash-and-sign with retry signature schemes. Cryptology ePrint Archive, Paper 2024\/609 (2024). https:\/\/eprint.iacr.org\/2024\/609"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-540-28628-8_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Gennaro, R., H\u00e5stad, J., Krawczyk, H., Rabin, T.: Randomness extraction and key derivation using the CBC, Cascade and HMAC modes. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 494\u2013510. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_30"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Fouque, P.A., Pointcheval, D., Zimmer, S.: HMAC is a randomness extractor and applications to TLS. In: Abe, M., Gligor, V. (eds.) 3rd ACM Symposium on Information, Computer and Communications Security, ASIACCS 08, Tokyo, Japan, 18\u201320 March 2008, pp. 21\u201332. ACM Press (2008). https:\/\/doi.org\/10.1145\/1368310.1368317","DOI":"10.1145\/1368310.1368317"},{"key":"10_CR11","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. Cryptology ePrint Archive, Paper 2010\/610 (2010). https:\/\/eprint.iacr.org\/2010\/610"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"10_CR13","doi-asserted-by":"publisher","first-page":"192503","DOI":"10.1007\/s11432-023-3972-y","volume":"67","author":"X He","year":"2024","unstructured":"He, X., Sun, X., Zhang, J.: Quantum search with prior knowledge. Sci. China Inf. Sci. 67(9), 192503 (2024). https:\/\/doi.org\/10.1007\/s11432-023-3972-y","journal-title":"Sci. China Inf. Sci."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-642-14623-7_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H Krawczyk","year":"2010","unstructured":"Krawczyk, H.: Cryptographic extraction and key derivation: the HKDF scheme. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 631\u2013648. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_34"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Krawczyk, H., Eronen, P.: HMAC-based Extract-and-Expand Key Derivation Function (HKDF). RFC 5869, May 2010. https:\/\/doi.org\/10.17487\/RFC5869. https:\/\/www.rfc-editor.org\/info\/rfc5869","DOI":"10.17487\/RFC5869"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Lee, K.: Bit security as cost to demonstrate advantage 1(1), 1 (2024). https:\/\/doi.org\/10.62056\/an5txol7","DOI":"10.62056\/an5txol7"},{"key":"10_CR17","unstructured":"Lenstra, A.K.: Key lengths. In: Bidgoli, H. (ed.) The Handbook of Information Security, pp. 617\u2013635. Wiley, Hoboken (2005). Contribution to The Handbook of Information Security"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Liu, H., et al.: Tight finite-key analysis for quantum key distribution without monitoring signal disturbance. npj Quant. Inf. 7 (2021). https:\/\/doi.org\/10.1038\/s41534-021-00428-9","DOI":"10.1038\/s41534-021-00428-9"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Schultz-Wu, M.: Bit security: optimal adversaries, equivalence results, and a toolbox for computational-statistical security analysis. In: Boyle, E., Mahmoody, M. (eds.) Theory of Cryptography - 22nd International Conference, TCC 2024, Proceedings, Part II. LNCS, Milan, Italy, 2\u20136 December 2024, vol. 15365, pp. 224\u2013254. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78017-2_8","DOI":"10.1007\/978-3-031-78017-2_8"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78381-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"D Micciancio","year":"2018","unstructured":"Micciancio, D., Walter, M.: On the bit security of cryptographic primitives. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 3\u201328. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_1"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Mizutani, A., Curty, M., Imoto, N., Tamaki, K.: Finite-key security analysis of quantum key distribution with imperfect light sources. New J. Phys. 17 (2015). https:\/\/doi.org\/10.1088\/1367-2630\/17\/9\/093011","DOI":"10.1088\/1367-2630\/17\/9\/093011"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-18073-6_7","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"A Montanaro","year":"2011","unstructured":"Montanaro, A.: Quantum search with advice. In: van Dam, W., Kendon, V.M., Severini, S. (eds.) TQC 2010. LNCS, vol. 6519, pp. 77\u201393. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18073-6_7"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Quade, J., Renner, R.: Composability in quantum cryptography. New J. Phys. 11, 085006 (2009). https:\/\/api.semanticscholar.org\/CorpusID:7735175","DOI":"10.1088\/1367-2630\/11\/8\/085006"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Portmann, C., Renner, R.: Security in quantum cryptography. Rev. Mod. Phys. 94, 025008 (2022). https:\/\/doi.org\/10.1103\/RevModPhys.94.025008. https:\/\/link.aps.org\/doi\/10.1103\/RevModPhys.94.025008","DOI":"10.1103\/RevModPhys.94.025008"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 3378, pp. 407\u2013425. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_22"},{"issue":"5","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.2514\/1.J062267","volume":"61","author":"R Renner","year":"2023","unstructured":"Renner, R., Wolf, R.: Quantum advantage in cryptography. AIAA J. 61(5), 1895\u20131910 (2023). https:\/\/doi.org\/10.2514\/1.J062267","journal-title":"AIAA J."},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Rescorla, E.: The Transport Layer Security (TLS) Protocol Version 1.3. RFC 8446 (2018). https:\/\/doi.org\/10.17487\/RFC8446, https:\/\/www.rfc-editor.org\/info\/rfc8446","DOI":"10.17487\/RFC8446"},{"key":"10_CR28","unstructured":"Stebila, D., Fluhrer, S., Gueron, S.: Hybrid key exchange in TLS 1.3. Internet-Draft: draft-ietf-tls-hybrid-design-11. Internet Engineering Task Force (2024, work in progress). https:\/\/datatracker.ietf.org\/doc\/draft-ietf-tls-hybrid-design\/11\/"},{"key":"10_CR29","unstructured":"Steinberger, J.: Improved security bounds for key-alternating ciphers via Hellinger distance. Cryptology ePrint Archive, paper 2012\/481 (2012). https:\/\/eprint.iacr.org\/2012\/481"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1038\/ncomms1631","volume":"3","author":"M Tomamichel","year":"2012","unstructured":"Tomamichel, M., Gisin, N., Renner, R.: Tight finite-key analysis for quantum cryptography. Nat. Commun. 3, 634 (2012). https:\/\/doi.org\/10.1038\/ncomms1631","journal-title":"Nat. Commun."},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"14","DOI":"10.22331\/q-2017-07-14-14","volume":"1","author":"M Tomamichel","year":"2017","unstructured":"Tomamichel, M., Leverrier, A.: A largely self-contained and complete security proof for quantum key distribution. Quantum 1, 14 (2017). https:\/\/doi.org\/10.22331\/q-2017-07-14-14","journal-title":"Quantum"},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"5524","DOI":"10.1109\/TIT.2011.2158473","volume":"57","author":"M Tomamichel","year":"2011","unstructured":"Tomamichel, M., Schaffner, C., Smith, A., Renner, R.: Leftover hashing against quantum side information. IEEE Trans. Inf. Theor. 57, 5524\u20135535 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2158473","journal-title":"IEEE Trans. Inf. Theor."},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Viamontes, G.F., Markov, I.L., Hayes, J.P.: Is Quantum search practical? Comput. Sci. Eng. 7(3), 62\u201370 (2005). https:\/\/doi.org\/10.1109\/MCSE.2005.53","DOI":"10.1109\/MCSE.2005.53"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-030-92078-4_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"S Watanabe","year":"2021","unstructured":"Watanabe, S., Yasunaga, K.: Bit security as\u00a0computational cost for\u00a0winning games with\u00a0high probability. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 161\u2013188. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_6"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Yasunaga, K.: Replacing probability distributions in security games via Hellinger distance. In: Tessaro, S. (ed.) 2nd Conference on Information-Theoretic Cryptography, ITC 2021. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0199, pp. 17:1\u201317:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.17. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ITC.2021.17","DOI":"10.4230\/LIPIcs.ITC.2021.17"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60(4), 2746\u20132751 (1999). https:\/\/doi.org\/10.1103\/physreva.60.2746. http:\/\/dx.doi.org\/10.1103\/PhysRevA.60.2746","DOI":"10.1103\/physreva.60.2746"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1038\/s41586-022-04891-y","volume":"607","author":"W Zhang","year":"2022","unstructured":"Zhang, W., et al.: A device-independent quantum key distribution system for distant users. Nature 607, 687\u2013691 (2022). https:\/\/doi.org\/10.1038\/s41586-022-04891-y","journal-title":"Nature"},{"key":"10_CR38","doi-asserted-by":"publisher","unstructured":"Zuckerman, D.: General weak random sources. In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, USA, 22\u201324 October 1990, pp. 534\u2013543. IEEE Computer Society Press (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89574","DOI":"10.1109\/FSCS.1990.89574"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:41:14Z","timestamp":1767321674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}