{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:18:03Z","timestamp":1778167083565,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032252906","type":"print"},{"value":"9783032252913","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-25291-3_15","type":"book-chapter","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:55:10Z","timestamp":1778165710000},"page":"431-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Quantum Time-Space Tradeoffs for\u00a0Permutation Inversion"],"prefix":"10.1007","author":[{"family":"Akshima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tyler","family":"Besselman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai-Min","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyao","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzu-Yi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Alagic, G., Bai, C., Poremba, A., Shi, K.: On the two-sided permutation inversion problem. arXiv preprint arXiv:2306.13729 (2023)","DOI":"10.62056\/a0qj89n4e"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Ambainis, A.: Quantum lower bounds by quantum arguments. In: Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, pp. 636\u2013643 (2000). https:\/\/doi.org\/10.1145\/335305.335394","DOI":"10.1145\/335305.335394"},{"key":"15_CR3","unstructured":"Belovs, A., Yolcu, D.: One-way ticket to Las Vegas and the quantum adversary. arXiv preprint arXiv:2301.02003 (2023)"},{"issue":"5","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997). https:\/\/doi.org\/10.1137\/S0097539796300933","journal-title":"SIAM J. Comput."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2020.11.013","volume":"855","author":"S Cao","year":"2021","unstructured":"Cao, S., Xue, R.: Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives. Theoret. Comput. Sci. 855, 16\u201342 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR6","unstructured":"Carolan, J.: Compressed permutation oracles. Cryptology ePrint Archive, Paper 2025\/1734 (2025). https:\/\/eprint.iacr.org\/2025\/1734"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Guo, S., Liu, Q., Qian, L.: Tight quantum time-space tradeoffs for function inversion. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 673\u2013684. IEEE Computer Society, Los Alamitos (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00068","DOI":"10.1109\/FOCS46700.2020.00068"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-319-96884-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Coretti","year":"2018","unstructured":"Coretti, S., Dodis, Y., Guo, S.: Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 693\u2013721. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_23"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-030-36030-6_16","volume-title":"Theory of Cryptography","author":"H Corrigan-Gibbs","year":"2019","unstructured":"Corrigan-Gibbs, H., Kogan, D.: The function-inversion problem: barriers and opportunities. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 393\u2013421. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_16"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-14623-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A De","year":"2010","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 649\u2013665. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_35"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-90459-3_7","volume-title":"Theory of Cryptography","author":"S Guo","year":"2021","unstructured":"Guo, S., Li, Q., Liu, Q., Zhang, J.: Unifying presampling via concentration bounds. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 177\u2013208. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_7"},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M Hellman","year":"1980","unstructured":"Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26(4), 401\u2013406 (1980). https:\/\/doi.org\/10.1109\/TIT.1980.1056220","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-030-34578-5_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Hhan","year":"2019","unstructured":"Hhan, M., Xagawa, K., Yamakawa, T.: Quantum random oracle model with auxiliary input. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 584\u2013614. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_21"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Liu, Q.: Non-uniformity and quantum advice in the quantum random oracle model. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I, vol. 14004, pp. 117\u2013143. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_5","DOI":"10.1007\/978-3-031-30545-0_5"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Majenz, C., Malavolta, G., Walter, M.: Permutation superposition oracles for quantum query lower bounds. arXiv preprint arXiv:2407.09655 (2024)","DOI":"10.1145\/3717823.3718266"},{"key":"15_CR17","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2011.v007a002","author":"A Nayak","year":"2011","unstructured":"Nayak, A.: Inverting a permutation is as hard as unordered search. Theory Comput. (2011). https:\/\/doi.org\/10.4086\/toc.2011.v007a002","journal-title":"Theory Comput."},{"issue":"11&12","key":"15_CR18","first-page":"901","volume":"15","author":"A Nayebi","year":"2015","unstructured":"Nayebi, A., Aaronson, S., Belovs, A., Trevisan, L.: Quantum lower bound for inverting a permutation with advice. Quantum Inf. Comput. 15(11&12), 901\u2013913 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"15_CR19","unstructured":"Rosmanis, A.: Lower bounds on quantum query and learning graph complexities. Ph.d. thesis, University of Waterloo (2014)"},{"key":"15_CR20","unstructured":"Rosmanis, A.: Tight bounds for inverting permutations via compressed oracle arguments. arXiv preprint arXiv:2103.08975 (2022)"},{"key":"15_CR21","unstructured":"Unruh, D.: Compressed permutation oracles (and the collision-resistance of sponge\/SHA3). Cryptology ePrint Archive, Paper 2021\/062 (2021). https:\/\/eprint.iacr.org\/2021\/062"},{"key":"15_CR22","unstructured":"Unruh, D.: Towards compressed permutation oracles. Cryptology ePrint Archive, Paper 2023\/770 (2023). https:\/\/eprint.iacr.org\/2023\/770"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 523\u2013532. ACM (2005)","DOI":"10.1145\/1060590.1060669"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Coherent functions and program checkers. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 84\u201394 (1990)","DOI":"10.1145\/100216.100226"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-26951-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. 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"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25291-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:55:19Z","timestamp":1778165719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25291-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032252906","9783032252913"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25291-3_15","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":"8 May 2026","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}