{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T13:29:38Z","timestamp":1748525378978,"version":"3.40.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031910975","type":"print"},{"value":"9783031910982","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91098-2_3","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T08:43:55Z","timestamp":1745743435000},"page":"53-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hard Quantum Extrapolations in\u00a0Quantum Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1112-8822","authenticated-orcid":false,"given":"Luowen","family":"Qian","sequence":"first","affiliation":[]},{"given":"Justin","family":"Raizes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7071-6272","authenticated-orcid":false,"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-031-15802-5_8","volume-title":"CRYPTO 2022","author":"P Ananth","year":"2022","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from pseudorandom quantum states. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 208\u2013236. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_8"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/060648829","volume":"37","author":"D Aharonov","year":"2007","unstructured":"Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation. SIAM J. Comput. 37(1), 47\u201382 (2007). https:\/\/doi.org\/10.1137\/060648829","journal-title":"SIAM J. Comput."},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Canetti, R., Qian, L.: On the computational hardness needed for quantum cryptography. In: 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), vol. 251 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2023.24","DOI":"10.4230\/LIPIcs.ITCS.2023.24"},{"key":"3_CR4","unstructured":"Bostanci, J., Efron, Y., Metger, T., Poremba, A., Qian, L., Yuen, H.: Unitary complexity and the uhlmann transformation problem (2023). arXiv: 2306.13073"},{"key":"3_CR5","unstructured":"Batra, R., Jain, R.: Commitments are equivalent to one-way state generators. In: 2024 IEEE 65th Symposium on Foundations of Computer Science (FOCS) (2024)"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Bostanci, J., Qian, L., Spooner, N., Yuen, H.: An efficient quantum parallel repetition theorem and applications. In: Proceedings of the 56th Annual ACM SIGACT Symposium on Theory of Computing (2024). https:\/\/doi.org\/10.1145\/3618260.3649603","DOI":"10.1145\/3618260.3649603"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-24676-3_6","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"I Damg\u00e5rd","year":"2004","unstructured":"Damg\u00e5rd, I., Pedersen, T., Salvail, L.: On the key-uncertainty of quantum ciphers and the computational security of one-way quantum transmission. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 91\u2013108. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_6"},{"key":"3_CR8","unstructured":"Gottesman, D., Chuang, I.: Quantum digital signatures (2001). arXiv: quant-ph\/0105032"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986). https:\/\/doi.org\/10.1145\/6490.6503","journal-title":"J. ACM"},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(90)90010-U","volume":"34","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O.: A note on computational indistinguishability. Inf. Process. Lett. 34(6), 277\u2013281 (1990). https:\/\/doi.org\/10.1016\/0020-0190(90)90010-U","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"3_CR11","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). https:\/\/doi.org\/10.1137\/S0097539793244708","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/BF01035528","volume":"13","author":"AS Holevo","year":"1972","unstructured":"Holevo, A.S.: On quasiequivalence of locally normal states. Theor. Math. Phys. 13(2), 1071\u20131082 (1972). https:\/\/doi.org\/10.1007\/BF01035528","journal-title":"Theor. Math. Phys."},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: 30th Annual Symposium on Foundations of Computer Science, pp. 230\u2013235 (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63483","DOI":"10.1109\/SFCS.1989.63483"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Levin, L.A.: No better ways to generate hard NP instances than picking uniformly at random. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, vol. 2, pp. 812\u2013821 (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89604","DOI":"10.1109\/FSCS.1990.89604"},{"issue":"12","key":"3_CR15","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/14\/12\/019","volume":"14","author":"ID Ivanovic","year":"1981","unstructured":"Ivanovic, I.D.: Geometrical description of quantal state determination. J. Phys. A: Math. General 14(12), 3241 (1981). https:\/\/doi.org\/10.1088\/0305-4470\/14\/12\/019","journal-title":"J. Phys. A: Math. General"},{"issue":"7","key":"3_CR16","doi-asserted-by":"publisher","first-page":"L363","DOI":"10.1088\/0305-4470\/25\/7\/014","volume":"25","author":"ID Ivanovic","year":"1992","unstructured":"Ivanovic, I.D.: An inequality for the sum of entropies of unbiased quantum measurements. J. Phys. A: Math. General 25(7), L363 (1992). https:\/\/doi.org\/10.1088\/0305-4470\/25\/7\/014","journal-title":"J. Phys. A: Math. General"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Kretschmer, W., Qian, L., Sinha, M., Tal, A.: Quantum cryptography in algorithmica. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 1589\u20131602 (2023). https:\/\/doi.org\/10.1145\/3564246.3585225","DOI":"10.1145\/3564246.3585225"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. In: 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021), vol. 197 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2021.2","DOI":"10.4230\/LIPIcs.TQC.2021.2"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Khurana, D., Tomer, K.: Commitments from quantum one-wayness. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 968\u2013978 (2024). https:\/\/doi.org\/10.1145\/3618260.3649654","DOI":"10.1145\/3618260.3649654"},{"key":"3_CR20","unstructured":"Khurana, D., Tomer, K.: Founding quantum cryptography on quantum advantage, or, towards cryptography from #PHardness (2024). arXiv: 2409.15248"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1988). https:\/\/doi.org\/10.1137\/0217022","journal-title":"SIAM J. Comput."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Metger, T., Poremba, A., Sinha, M., Yuen, H.: Simple constructions of linear-depth t-designs and pseudorandom unitaries (2024). arXiv: 2404.12647","DOI":"10.1109\/FOCS61266.2024.00038"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-031-68394-7_5","volume-title":"CRYPTO 2024","author":"G Malavolta","year":"2024","unstructured":"Malavolta, G., Walter, M.: Robust quantum public-key encryption with applications to quantum key distribution. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14926, pp. 126\u2013151. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_5"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-031-15802-5_10","volume-title":"CRYPTO 2022","author":"T Morimae","year":"2022","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 269\u2013295. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Tony Metger and Henry Yuen. \u201cstateQIP = statePSPACE\u201d. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). 2023, pp. 1349\u20131356. https:\/\/doi.org\/10.1109\/FOCS57990.2023.00082. arXiv: 2301.07730v2","DOI":"10.1109\/FOCS57990.2023.00082"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: One-wayness in quantum cryptography. In: 19th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2024), vol. 310 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2024.4","DOI":"10.4230\/LIPIcs.TQC.2024.4"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge (2010). https:\/\/doi.org\/10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Nehoran, B., Zhandry, M.: A computational separation between quantum no-cloning and no-telegraphing. In: 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), vol. 287, pp. 82:1\u201382:23 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2024.82","DOI":"10.4230\/LIPIcs.ITCS.2024.82"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 387\u2013394 (1990). https:\/\/doi.org\/10.1145\/100216.100269","DOI":"10.1145\/100216.100269"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1103\/PhysRevLett.85.441","volume":"85","author":"PW Shor","year":"2000","unstructured":"Shor, P.W., Preskill, J.: Simple proof of security of the BB84 quantum key distribution protocol. Phys. Rev. Lett. 85, 441\u2013444 (2000). https:\/\/doi.org\/10.1103\/PhysRevLett.85.441","journal-title":"Phys. Rev. Lett."},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Watrous, J.: Limits on the power of quantum statistical zeroknowledge. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings, pp. 459\u2013468 (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181970","DOI":"10.1109\/SFCS.2002.1181970"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-031-22972-5_22","volume-title":"ASIACRYPT 2022","author":"J Yan","year":"2022","unstructured":"Yan, J.: General properties of quantum bit commitments (extended abstract). In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13794, pp. 628\u2013657. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_22"},{"issue":"1","key":"3_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-020-09372-x","volume":"34","author":"M Zhandry","year":"2021","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. or: quantum money from cryptographic assumptions. J. Cryptol. 34(1), 1\u201356 (2021). https:\/\/doi.org\/10.1007\/s00145-020-09372-x","journal-title":"J. Cryptol."},{"key":"3_CR34","unstructured":"Zhandry, M.: Quantum minimalism. In: Minimal Complexity Assumptions for Cryptography Workshop, Simons Institute (2023). https:\/\/mzhandry.github.io\/talks.html"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91098-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T08:43:59Z","timestamp":1745743439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91098-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910975","9783031910982"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91098-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}