{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:11:46Z","timestamp":1775754706791,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032226945","type":"print"},{"value":"9783032226952","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-22695-2_3","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:29:42Z","timestamp":1775752182000},"page":"71-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tighter Bit-Security Bounds in\u00a0Quantum Key Search via\u00a0the\u00a0Chebyshev Distance"],"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":[]},{"given":"Gonne","family":"Kretschmer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"3_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). https:\/\/doi.org\/10.1016\/j.jcss.2003.11.006, (Preliminary Version in 43rd FOCS, 2002)","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Bunandar, D., Govia, L., Krovi, H., Englund, D.: Numerical finite-key analysis of quantum key distribution. NPJ Quantum Inf. 6 (2020). https:\/\/doi.org\/10.1038\/s41534-020-00322-w","DOI":"10.1038\/s41534-020-00322-w"},{"key":"3_CR3","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":"3_CR4","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","DOI":"10.1137\/060651380"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Durrett, R.: Probability: Theory and Examples. Cambridge Series in Statistical and Probabilistic Mathematics, 5th edn. Cambridge University Press (2019)","DOI":"10.1017\/9781108591034"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Fischlin, M., Gkoumas, E.: Bit security of quantum key search. In: Selected Areas in Cryptography \u2013 SAC 2025. Lecture Notes in Computer Science, vol. 16207. Springer (2025)","DOI":"10.1007\/978-3-032-10536-3_10"},{"key":"3_CR7","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"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Symposium on the Theory of Computing (1989). https:\/\/api.semanticscholar.org\/CorpusID:207679529","DOI":"10.1145\/73007.73010"},{"key":"3_CR9","doi-asserted-by":"crossref","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)","DOI":"10.1137\/S0097539793244708"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"He, X., Sun, X., Zhang, J.: Quantum search with prior knowledge. SCIENCE CHINA Inf. Sci. 67(9), 192503 (2024)","DOI":"10.1007\/s11432-023-3972-y"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Krawczyk, H.: New hash functions for message authentication. In: Guillou, L.C., Quisquater, J.J. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u201995. Lecture Notes in Computer Science, vol.\u00a0921, pp. 301\u2013310. Saint-Malo, France (1995). https:\/\/doi.org\/10.1007\/3-540-49264-X_24","DOI":"10.1007\/3-540-49264-X_24"},{"key":"3_CR12","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":"3_CR13","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Schultz-Wu, M.: Bit security: optimal adversaries, equivalence results, and a toolbox for computational-statistical security analysis. Cryptology ePrint Archive, Paper 2024\/1506 (2024). https:\/\/eprint.iacr.org\/2024\/1506","DOI":"10.1007\/978-3-031-78017-2_8"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Walter, M.: On the bit security of cryptographic primitives. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02018, Part\u00a0I. Lecture Notes in Computer Science, vol. 10820, pp. 3\u201328. Tel Aviv, Israel (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_1","DOI":"10.1007\/978-3-319-78381-9_1"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Montanaro, A.: Quantum search with advice. In: van Dam, W., Kendon, V.M., Severini, S. (eds.) Theory of Quantum Computation, Communication, and Cryptography, pp. 77\u201393. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-18073-6_7"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Moody, D., Perlner, R., Regenscheid, A., Robinson, A., Cooper, D.: Transition to post-quantum cryptography standards. NIST Internal Report NIST IR 8547 (Initial Public Draft), National Institute of Standards and Technology (2024). https:\/\/doi.org\/10.6028\/NIST.IR.8547.ipd","DOI":"10.6028\/NIST.IR.8547.ipd"},{"key":"3_CR17","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":"3_CR18","doi-asserted-by":"publisher","unstructured":"Polyanskiy, Y., Wu, Y.: Information Theory: From Coding to Learning (2025). https:\/\/doi.org\/10.1017\/9781108966351","DOI":"10.1017\/9781108966351"},{"key":"3_CR19","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":"3_CR20","doi-asserted-by":"publisher","unstructured":"Renner, R., K\u00f6nig, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, 10\u201312 February 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03378, pp. 407\u2013425. Springer (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_22","DOI":"10.1007\/978-3-540-30576-7_22"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Renner, R., Wolf, R.: Quantum advantage in cryptography. AIAA J. 61(5), 1895\u20131910 (2023)","DOI":"10.2514\/1.J062267"},{"key":"3_CR22","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":"3_CR23","doi-asserted-by":"publisher","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","DOI":"10.22331\/q-2017-07-14-14"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Watanabe, S., Yasunaga, K.: Bit security as computational cost for winning games with high probability. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02021, Part\u00a0III. Lecture Notes in Computer Science, vol. 13092, pp. 161\u2013188. Singapore (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_6","DOI":"10.1007\/978-3-030-92078-4_6"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Wolf, R.: Quantum Key Distribution: An Introduction with Exercises. Lecture Notes in Physics, vol.\u00a0988. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-73991-1, print ISBN: 978-3030739904; eBook ISBN: 978-3030739911","DOI":"10.1007\/978-3-030-73991-1"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Wolf, R.: Quantum Key Distribution Protocols, pp. 91\u2013116. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73991-1_4","DOI":"10.1007\/978-3-030-73991-1_4"},{"key":"3_CR27","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"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22695-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:29:45Z","timestamp":1775752185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22695-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226945","9783032226952"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22695-2_3","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":"10 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint-Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}