{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T23:13:53Z","timestamp":1780528433207,"version":"3.54.1"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587368","type":"print"},{"value":"9783031587375","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58737-5_1","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T07:01:52Z","timestamp":1714201312000},"page":"3-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The NISQ Complexity of\u00a0Collision Finding"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3762-0612","authenticated-orcid":false,"given":"Yassine","family":"Hamoudi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3994-7061","authenticated-orcid":false,"given":"Qipeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5702-2049","authenticated-orcid":false,"given":"Makrand","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S.: Impossibility of succinct quantum proofs for collision-freeness. Quantum Information & Computation 12(1-2), 21\u201428 (2012). https:\/\/doi.org\/10.26421\/QIC12.1-2-3","DOI":"10.26421\/QIC12.1-2-3"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Kothari, R., Kretschmer, W., Thaler, J.: Quantum lower bounds for approximate counting via Laurent polynomials. In: Proceedings of the 35th Computational Complexity Conference (CCC) (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2020.7","DOI":"10.4230\/LIPIcs.CCC.2020.7"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/1008731.1008735","volume":"51","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4), 595\u2013605 (2004). https:\/\/doi.org\/10.1145\/1008731.1008735","journal-title":"J. ACM"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Alagic, G., Bai, C., Katz, J., Majenz, C.: Post-quantum security of the Even-Mansour cipher. In: Proceedings of the 41st International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). pp. 458\u2013487 (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_17","DOI":"10.1007\/978-3-031-07082-2_17"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Alagic, G., Majenz, C., Russell, A., Song, F.: Quantum-access-secure message authentication via blind-unforgeability. In: Proceedings of the 39th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). pp. 788\u2013817 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_27","DOI":"10.1007\/978-3-030-45727-3_27"},{"issue":"4","key":"1_CR6","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). https:\/\/doi.org\/10.1006\/jcss.2002.1826","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Hamburg, M., Unruh, D.: Quantum security proofs using semi-classical oracles. In: Proceedings of the 39th International Cryptology Conference (CRYPTO), pp. 269\u2013295 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_10","DOI":"10.1007\/978-3-030-26951-7_10"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s00453-007-9022-9","volume":"55","author":"A Ambainis","year":"2009","unstructured":"Ambainis, A., \u0160palek, R., de Wolf, R.: A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs. Algorithmica 55(3), 422\u2013461 (2009). https:\/\/doi.org\/10.1007\/s00453-007-9022-9","journal-title":"Algorithmica"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Arora, A.S., Gheorghiu, A., Singh, U.: Oracle separations of hybrid quantum-classical circuits (2022). https:\/\/doi.org\/10.48550\/arXiv.2201.01904, arXiv:2201.01904 [quant-ph]","DOI":"10.48550\/arXiv.2201.01904"},{"issue":"5","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","volume":"38","author":"B Barak","year":"2009","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. SIAM J. Comput. 38(5), 1661\u20131694 (2009). https:\/\/doi.org\/10.1137\/070709244","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778\u2013797 (2001). https:\/\/doi.org\/10.1145\/502090.502097","journal-title":"J. ACM"},{"issue":"5","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.V.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411\u20131473 (1997). https:\/\/doi.org\/10.1137\/S0097539796300921","journal-title":"SIAM J. Comput."},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Bindel, N., Hamburg, M., H\u00f6velmanns, K., H\u00fclsing, A., Persichetti, E.: Tighter proofs of CCA security in the quantum random oracle model. In: Proceedings of the 17th Conference on Theory of Cryptography (TCC), pp. 61\u201390 (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_3","DOI":"10.1007\/978-3-030-36033-7_3"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Blocki, J., Lee, S., Zhou, S.: On the security of proofs of sequential work in a post-quantum world. In: Proceedings of the 2nd Conference on Information-Theoretic Cryptography (ITC), pp. 22:1\u201322:27 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.22","DOI":"10.4230\/LIPIcs.ITC.2021.22"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN), pp. 163\u2013169 (1998). https:\/\/doi.org\/10.1007\/bfb0054319","DOI":"10.1007\/bfb0054319"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theoret. Comput. Sci. 288(1), 21\u201343 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00144-X","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"6001","DOI":"10.1038\/s41467-023-41217-6","volume":"14","author":"S Chen","year":"2023","unstructured":"Chen, S., Cotler, J., Huang, H.Y., Li, J.: The complexity of NISQ. Nature Commun. 14(1), 6001 (2023). https:\/\/doi.org\/10.1038\/s41467-023-41217-6","journal-title":"Nature Commun."},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Chia, N.H., Chung, K.M., Lai, C.Y.: On the need for large quantum depth. J. ACM 70(1) (2023). https:\/\/doi.org\/10.1145\/3570637","DOI":"10.1145\/3570637"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Chia, N.H., Hung, S.H.: Classical verification of quantum depth (2022). https:\/\/doi.org\/10.48550\/arXiv.2205.04656, arXiv:2205.04656 [quant-ph]","DOI":"10.48550\/arXiv.2205.04656"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Manohar, P., Spooner, N.: Succinct arguments in the quantum random oracle model. In: Proceedings of the 17th Conference on Theory of Cryptography (TCC), pp. 1\u201329 (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_1","DOI":"10.1007\/978-3-030-36033-7_1"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Fehr, S., Huang, Y.H., Liao, T.N.: On the compressed-oracle technique, and post-quantum security of proofs of sequential work. In: Proceedings of the 40th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 598\u2013629 (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_21","DOI":"10.1007\/978-3-030-77886-6_21"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Guo, S., Liu, Q., Qian, L.: Tight quantum time-space tradeoffs for function inversion. In: Proceedings of the 61st Symposium on Foundations of Computer Science (FOCS), pp. 673\u2013684 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00068","DOI":"10.1109\/FOCS46700.2020.00068"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Liao, T.N., Qian, L.: Lower bounds for function inversion with quantum advice. In: Proceedings of the 1st Conference on Information-Theoretic Cryptography (ITC), pp. 8:1\u20138:15 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2020.8","DOI":"10.4230\/LIPIcs.ITC.2020.8"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Coudron, M., Menda, S.: Computations with greater quantum depth are strictly more powerful (relative to an oracle). In: Proceedings of the 52nd Symposium on Theory of Computing (STOC), pp. 889\u2014901 (2020). https:\/\/doi.org\/10.1145\/3357713.3384269","DOI":"10.1145\/3357713.3384269"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Czajkowski, J., Majenz, C., Schaffner, C., Zur, S.: Quantum lazy sampling and game-playing proofs for quantum indifferentiability (2019). https:\/\/doi.org\/10.48550\/arXiv.1904.11477. arXiv:1904.11477 [quant-ph]","DOI":"10.48550\/arXiv.1904.11477"},{"issue":"1907","key":"1_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. Ser. A 439(1907), 553\u2013558 (1992). https:\/\/doi.org\/10.1098\/rspa.1992.0167","journal-title":"Proc. R. Soc. Lond. Ser. A"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Don, J., Fehr, S., Huang, Y.H.: Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF. In: Proceedings of the 20th Conference on Theory of Cryptography (TCC), pp. 33\u201351 (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_2","DOI":"10.1007\/978-3-031-22318-1_2"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Grover, L.K., Radhakrishnan, J.: Quantum search for multiple items using parallel queries (2004). https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0407217, arXiv:quant-ph\/0407217","DOI":"10.48550\/arXiv.quant-ph\/0407217"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Guo, S., Li, Q., Liu, Q., Zhang, J.: Unifying presampling via concentration bounds. In: Proceedings of the 19th Conference on Theory of Cryptography (TCC), pp. 177\u2013208 (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_7","DOI":"10.1007\/978-3-030-90459-3_7"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Hamoudi, Y., Liu, Q., Sinha, M.: The NISQ complexity of collision finding (2024). https:\/\/doi.org\/10.48550\/ARXIV.2211.12954, arXiv:2211.12954 [quant-ph]","DOI":"10.48550\/ARXIV.2211.12954"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Hamoudi, Y., Magniez, F.: Quantum time-space tradeoff for finding multiple collision pairs. ACM Trans. Comput. Theory 15(1-2) (2023). https:\/\/doi.org\/10.1145\/3589986","DOI":"10.1145\/3589986"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Hasegawa, A., Gall, F.L.: An optimal oracle separation of classical and quantum hybrid schemes. In: Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC), pp. 6:1\u20136:14 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2022.6","DOI":"10.4230\/LIPIcs.ISAAC.2022.6"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Hhan, M., Xagawa, K., Yamakawa, T.: Quantum random oracle model with auxiliary input. In: Proceedings of the 25th International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT), pp. 584\u2013614 (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_21","DOI":"10.1007\/978-3-030-34578-5_21"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Hosoyamada, A., Iwata, T.: 4-round Luby-Rackoff construction is a qPRP. In: Proceedings of the 25th International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT), pp. 145\u2013174 (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_6","DOI":"10.1007\/978-3-030-34578-5_6"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Jaeger, J., Song, F., Tessaro, S.: Quantum key-length extension. In: Proceedings of the 19th Conference on Theory of Cryptography (TCC), pp. 209\u2013239 (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_8","DOI":"10.1007\/978-3-030-90459-3_8"},{"issue":"2","key":"1_CR36","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00453-016-0206-z","volume":"79","author":"S Jeffery","year":"2017","unstructured":"Jeffery, S., Magniez, F., de Wolf, R.: Optimal parallel quantum query algorithms. Algorithmica 79(2), 509\u2013529 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0206-z","journal-title":"Algorithmica"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Chapman & Hall\/CRC, 1st edn. (2007). https:\/\/doi.org\/10.1201\/9781420010756","DOI":"10.1201\/9781420010756"},{"issue":"5","key":"1_CR38","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1137\/05063235X","volume":"36","author":"H Klauck","year":"2007","unstructured":"Klauck, H., \u0160palek, R., de Wolf, R.: Quantum and classical strong direct product theorems and optimal time-space tradeoffs. SIAM J. Comput. 36(5), 1472\u20131493 (2007). https:\/\/doi.org\/10.1137\/05063235X","journal-title":"SIAM J. Comput."},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Liu, Q., Zhandry, M.: On finding quantum multi-collisions. In: Proceedings of the 38th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 189\u2013218 (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_7","DOI":"10.1007\/978-3-030-17659-4_7"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Liu, Q., Zhandry, M.: Revisiting post-quantum Fiat-Shamir. In: Proceedings of the 39th International Cryptology Conference (CRYPTO), pp. 326\u2013355 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_12","DOI":"10.1007\/978-3-030-26951-7_12"},{"key":"1_CR41","doi-asserted-by":"publisher","unstructured":"Merkle, R.C.: A certified digital signature. In: Proceedings of the 9th International Conference on the Theory and Applications of Cryptology (CRYPTO), pp. 347\u2013363 (1989). https:\/\/doi.org\/10.1007\/0-387-34805-0_21","DOI":"10.1007\/0-387-34805-0_21"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Nayebi, A., Aaronson, S., Belovs, A., Trevisan, L.: Quantum lower bound for inverting a permutation with advice. Quantum Inform. Comput. 15(11 &12), 901\u2013913 (2015). https:\/\/doi.org\/10.26421\/QIC15.11-12-1","DOI":"10.26421\/QIC15.11-12-1"},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Regev, O., Schiff, L.: Impossibility of a quantum speed-up with a faulty oracle. In: Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 773\u2014781 (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_63","DOI":"10.1007\/978-3-540-70575-8_63"},{"key":"1_CR44","doi-asserted-by":"publisher","unstructured":"Rosmanis, A.: Tight bounds for inverting permutations via compressed oracle arguments (2021). https:\/\/doi.org\/10.48550\/arXiv.2103.08975. arXiv:2103.08975 [quant-ph]","DOI":"10.48550\/arXiv.2103.08975"},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Rosmanis, A.: Hybrid quantum-classical search algorithms (2022). https:\/\/doi.org\/10.48550\/arXiv.2202.11443, arXiv:2202.11443 [quant-ph]d","DOI":"10.48550\/arXiv.2202.11443"},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Rosmanis, A.: Quantum search with noisy oracle (2023). https:\/\/doi.org\/10.48550\/ARXIV.2309.14944, arXiv:2309.14944 [quant-ph]","DOI":"10.48550\/ARXIV.2309.14944"},{"key":"1_CR47","doi-asserted-by":"publisher","unstructured":"Sherstov, A.A., Thaler, J.: Vanishing-error approximate degree and QMA complexity. Chicago J. Theor. Comput. Sci. 2023(3) (2023). https:\/\/doi.org\/10.4086\/cjtcs.2023.003","DOI":"10.4086\/cjtcs.2023.003"},{"issue":"5","key":"1_CR48","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1_CR49","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997). https:\/\/doi.org\/10.1137\/S0097539796298637","journal-title":"SIAM J. Comput."},{"key":"1_CR50","doi-asserted-by":"publisher","unstructured":"Sun, X., Zheng, Y.: Hybrid decision trees: Longer quantum time is strictly more powerful (2019). https:\/\/doi.org\/10.48550\/arXiv.1911.13091. arXiv:1911.13091 [cs.CC]","DOI":"10.48550\/arXiv.1911.13091"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C Zalka","year":"1999","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60, 2746\u20132751 (1999). https:\/\/doi.org\/10.1103\/PhysRevA.60.2746","journal-title":"Phys. Rev. A"},{"key":"1_CR52","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. In: Proceedings of the 39th International Cryptology Conference (CRYPTO), pp. 239\u2013268 (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","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58737-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:04:05Z","timestamp":1777248245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58737-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587368","9783031587375"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58737-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}