{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:16:36Z","timestamp":1778166996325,"version":"3.51.4"},"publisher-location":"Cham","reference-count":27,"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_21","type":"book-chapter","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:56:36Z","timestamp":1778165796000},"page":"603-632","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Cryptographic Futility of Non-collapsing Measurements"],"prefix":"10.1007","author":[{"given":"Alper","family":"\u00c7akan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dakshita","family":"Khurana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Morimae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuki","family":"Shirakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kabir","family":"Tomer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00224-013-9527-3","volume":"55","author":"S Aaronson","year":"2014","unstructured":"Aaronson, S.: The equivalence of sampling and searching. Theory Comput. Syst. 55, 281\u2013298 (2014)","journal-title":"Theory Comput. Syst."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Bouland, A., Fitzsimons, J., Lee, M.: The space \u201cjust above\u201d BQP. In: Sudan, M. (ed.) ITCS 2016, pp. 271\u2013280. ACM (2016)","DOI":"10.1145\/2840728.2840739"},{"key":"21_CR3","unstructured":"Aaronson, S., Buhrman, H., Kretschmer, W.: A qubit, a coin, and an advice string walk into a relational problem. In: Guruswami, V. (ed.) ITCS 2024, vol. 287, pp. 1:1\u20131:24. LIPIcs (2024)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Karloff, H.J., Pitassi, T. (eds.) 44th ACM STOC, pp. 41\u201360. ACM Press (2012)","DOI":"10.1145\/2213977.2213983"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Asharov, G., Segev, G.: Limits on the power of indistinguishability obfuscation and functional encryption. In: Guruswami, V. (ed.) 56th FOCS, pp. 191\u2013209. IEEE Computer Society Press (2015)","DOI":"10.1109\/FOCS.2015.21"},{"issue":"5","key":"21_CR6","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)","journal-title":"SIAM J. Comput."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-030-36030-6_17","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2019","unstructured":"Bitansky, N., Degwekar, A.: On the complexity of collision resistant hash functions: new and old black-box separations. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 422\u2013450. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_17"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-030-17659-4_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"N Bitansky","year":"2019","unstructured":"Bitansky, N., Haitner, I., Komargodski, I., Yogev, E.: Distributional collision resistance beyond one-way functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 667\u2013695. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_23"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-40041-4_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Bogdanov","year":"2013","unstructured":"Bogdanov, A., Lee, C.H.: Limits of provable security for homomorphic encryption. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 111\u2013128. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_7"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O., Rosen, A.: On the cryptographic hardness of finding a Nash equilibrium. In: Guruswami, V. (ed.) 56th FOCS, pp. 1480\u20131498. IEEE Computer Society Press (2015)","DOI":"10.1109\/FOCS.2015.94"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: Kleinberg, J.M. (ed.) 38th ACM STOC, pp. 711\u2013720. ACM Press (2006)","DOI":"10.1145\/1132516.1132615"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS, pp. 40\u201349. IEEE Computer Society Press (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"S Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 201\u2013215. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_16"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00145-024-09517-2","volume":"37","author":"A Hosoyamada","year":"2024","unstructured":"Hosoyamada, A., Yamakawa, T.: Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness. J. Cryptol. 37(4), 35 (2024)","journal-title":"J. Cryptol."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th FOCS, pp. 230\u2013235. IEEE Computer Society Press (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-662-49096-9_16","volume-title":"Theory of Cryptography","author":"T Liu","year":"2016","unstructured":"Liu, T., Vaikuntanathan, V.: On basing private information retrieval on NP-hardness. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 372\u2013386. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_16"},{"key":"21_CR17","unstructured":"Merkle, R.: Ph.d. thesis (1979)"},{"key":"21_CR18","unstructured":"Morimae, T., Shirakawa, Y., Yamakawa, T.: Quantum cryptography and hardness of non-collapsing measurements (2025)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"DR Simon","year":"1998","unstructured":"Simon, D.R.: Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334\u2013345. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054137"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Shmueli, O., Zhandry, M.: On one-shot signatures, quantum vs. classical binding, and obfuscating permutations. In: Kalai, Y.T., Kamara, S.F. (eds.) Advances in Cryptology - CRYPTO 2025, Part II. LNCS, vol. 16001, pp. 350\u2013383. Springer (2025)","DOI":"10.1007\/978-3-032-01878-6_12"},{"key":"21_CR22","unstructured":"Tomer, K., Zhandry, M.: Personal communication (2025)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Revocable quantum timed-release encryption. J. ACM 62(6), 49:1\u201349:76 (2015)","DOI":"10.1145\/2817206"},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78\u201388 (1983)","journal-title":"SIGACT News"},{"key":"21_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"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions. J. Cryptol. 34(1), 6 (2021)","DOI":"10.1007\/s00145-020-09372-x"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to model unitary oracles. In: Kalai, Y.T., Kamara, S.F. (eds.) Advances in Cryptology - CRYPTO 2025, Part II. LNCS, vol. 16001, pp. 237\u2013268. Springer (2025)","DOI":"10.1007\/978-3-032-01878-6_8"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:56:46Z","timestamp":1778165806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25291-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032252906","9783032252913"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25291-3_21","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"}}]}}