{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T09:10:07Z","timestamp":1764666607908,"version":"3.46.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122957","type":"print"},{"value":"9783032122964","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"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-12296-4_15","type":"book-chapter","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T09:08:04Z","timestamp":1764666484000},"page":"427-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["NISQ Security and\u00a0Complexity via\u00a0Simple Classical Reasoning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2710-1170","authenticated-orcid":false,"given":"Alexandru","family":"Cojocaru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0366-7110","authenticated-orcid":false,"given":"Juan","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3994-7061","authenticated-orcid":false,"given":"Qipeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3098-6451","authenticated-orcid":false,"given":"Fang","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,3]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Bartusek, J., Khurana, D., Kumar, N.: A new framework for quantum oblivious transfer. In: Advances in Cryptology \u2013 EUROCRYPT 2023, pp. 363\u2013394. Springer (2023)","DOI":"10.1007\/978-3-031-30545-0_13"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1006\/jcss.2002.1826","volume":"64","author":"A Ambainis","year":"2002","unstructured":"Ambainis, A.: Quantum lower bounds by quantum arguments. J. Comput. Syst. Sci. 64(4), 750\u2013767 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., De Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778\u2013797 (2001)","DOI":"10.1145\/502090.502097"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kellner, M., Shmueli, O.: Post-quantum resettably-sound zero knowledge. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 62\u201389. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_3","DOI":"10.1007\/978-3-030-90459-3_3"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"944","DOI":"10.22331\/q-2023-03-09-944","volume":"7","author":"A Cojocaru","year":"2023","unstructured":"Cojocaru, A., Garay, J., Kiayias, A., Song, F., Wallden, P.: Quantum multi-solution bernoulli search with applications to bitcoin\u2019s post-quantum security. Quantum 7, 944 (2023)","journal-title":"Quantum"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Chung, K. M., Guo, S., Liu, Q., Qian, L.: Tight quantum time-space tradeoffs for function inversion. In: IEEE 61st Annual Symposium on Foundations of Computer Science \u2013 FOCS 2020, pp. 673\u2013684. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00068"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Cojocaru, A., Garay, J., Liu, Q., Song, F.: Improved quantum lifting by coherent measure-and-reprogram. In: Advances in Cryptology \u2013 ASIACRYPT 2024, pp. 158\u2013184. Springer (2024)","DOI":"10.1007\/978-981-96-0947-5_6"},{"key":"15_CR10","unstructured":"Cojocaru, A., Garay, J., Liu, Q., Song, F.: Nisq security and complexity via simple classical reasoning (2025)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Cojocaru, A., Garay, J., Song, F.: Generalized hybrid search with applications to blockchains and hash function security. In: Advances in Cryptology \u2013 ASIACRYPT 2024, pp. 65\u201393. Springer (2025)","DOI":"10.1007\/978-981-96-0947-5_3"},{"key":"15_CR12","unstructured":"Chailloux, A.: Tight quantum security of the fiat-shamir transform for commit-and-open identification schemes with applications to post-quantum signature schemes. Cryptology ePrint Archive, Paper 2019\/699 (2019). https:\/\/eprint.iacr.org\/2019\/699"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Don, J., Fehr, S., Huang, Y.H.: Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF. In: Theory of Cryptography Conference \u2013 TCC 2022, pp. 33\u201351. Springer (2022)","DOI":"10.1007\/978-3-031-22318-1_2"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Don, J., Fehr, S., Huang, Y.H., Struck, P.: On the (in)security of the buff transform. In: Advances in Cryptology \u2013 CRYPTO 2024, pp. 246\u2013275. Springer (2024)","DOI":"10.1007\/978-3-031-68376-3_8"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Don, J., Fehr, S., Majenz, C.: The measure-and-reprogram technique 2.0: multi-round fiat-shamir and more. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 602\u2013631. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_21","DOI":"10.1007\/978-3-030-56877-1_21"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Don, J., Fehr, S., Majenz, C., Schaffner, C.: Security of the fiat-shamir transformation in the quantum random-oracle model. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 356\u2013383. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_13","DOI":"10.1007\/978-3-030-26951-7_13"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Don, J., Fehr, S., Majenz, C., Schaffner, C.: Online-extractability in the quantum random-oracle model. In: Advances in Cryptology \u2013 EUROCRYPT 2022, pp. 677\u2013706. Springer (2022)","DOI":"10.1007\/978-3-031-07082-2_24"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Dong, F., Liu, Q., Wu, K.: Tight characterizations for preprocessing against cryptographic salting. In: Advances in Cryptology \u2013 CRYPTO 2024. Springer (2024)","DOI":"10.1007\/978-3-031-68385-5_12"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Grilo, A.B., H\u00f6velmanns, K., H\u00fclsing, A., Majenz, C.: Tight adaptive reprogramming in the Qrom. In: Advances in Cryptology \u2013 ASIACRYPT 2021, pp. 637\u2013667. Springer (2021)","DOI":"10.1007\/978-3-030-92062-3_22"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. J. ACM (2024). Preliminary version appeared in EUROCRYPT 2015","DOI":"10.1007\/978-3-662-46803-6_10"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Hamoudi, Y., Liu, Q., Sinha, M.: The nisq complexity of collision finding. In: Advances in Cryptology \u2013 EUROCRYPT 2024, pp. 3\u201332. Springer (2024)","DOI":"10.1007\/978-3-031-58737-5_1"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Jiang, H., Ma, Z., Zhang, Z.: Post-quantum security of key encapsulation mechanism against CCA attacks with a single decapsulation query. In: Advances in Cryptology \u2013 ASIACRYPT 2023, pp. 434\u2013468. Springer (2023)","DOI":"10.1007\/978-981-99-8730-6_14"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Katsumata, S.: A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs. In: Advances in Cryptology \u2013 CRYPTO 2021, pp. 580\u2013610. Springer (2021)","DOI":"10.1007\/978-3-030-84245-1_20"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Kosuge, H., Xagawa, K.: Probabilistic hash-and-sign with retry in the quantum random oracle model. In: Public-Key Cryptography \u2013 PKC 2024, pp. 259\u2013288. Springer (2024)","DOI":"10.1007\/978-3-031-57718-5_9"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00037-013-0066-8","volume":"22","author":"T Lee","year":"2013","unstructured":"Lee, T., Roland, J.: A strong direct product theorem for quantum query complexity. Comput. Complexity 22, 429\u2013462 (2013)","journal-title":"Comput. Complexity"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Liu, Q., Zhandry, M.: Revisiting post-quantum fiat-shamir. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 326\u2013355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_12","DOI":"10.1007\/978-3-030-26951-7_12"},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"key":"15_CR28","unstructured":"Rosmanis, A.: Quantum search with noisy oracle (2023)"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Rosmanis, A.: Hybrid quantum-classical search algorithms. ACM Trans. Quantum Comput., 5(2) (2024)","DOI":"10.1145\/3648573"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Sherstov, A.A.: Strong direct product theorems for quantum communication and query complexity. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 41\u201350 (2011)","DOI":"10.1145\/1993636.1993643"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"van Dam, W.: Quantum oracle interrogation: getting all information for almost half the price. In: Proceedings 39th Annual Symposium on Foundations of Computer Science \u2013 FOCS 1998, pp. 362\u2013367. IEEE (1998)","DOI":"10.1109\/SFCS.1998.743486"},{"key":"15_CR32","doi-asserted-by":"publisher","unstructured":"Yamakawa, T., Zhandry, M.: Classical vs quantum random oracles. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 568\u2013597. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_20","DOI":"10.1007\/978-3-030-77886-6_20"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Yamakawa, T., Zhandry, M.: Verifiable quantum advantage without structure. J. ACM, 71(3) (2024)","DOI":"10.1145\/3658665"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to construct quantum random functions. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 679\u2013687. IEEE (2012)","DOI":"10.1109\/FOCS.2012.37"},{"key":"15_CR35","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to liability. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 239\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9","DOI":"10.1007\/978-3-030-26951-7_9"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12296-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T09:08:12Z","timestamp":1764666492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12296-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,3]]},"ISBN":["9783032122957","9783032122964"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12296-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,3]]},"assertion":[{"value":"3 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}