{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:37:29Z","timestamp":1773254249317,"version":"3.50.1"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018779","type":"print"},{"value":"9783032018786","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-032-01878-6_12","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:08:50Z","timestamp":1755367730000},"page":"350-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On One-Shot Signatures, Quantum vs. Classical Binding, and\u00a0Obfuscating Permutations"],"prefix":"10.1007","author":[{"given":"Omri","family":"Shmueli","sequence":"first","affiliation":[]},{"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum certificate complexity. In: Proceedings of the 18th IEEE Annual Conference on Computational Complexity, pp. 171\u2013178 (2003)","DOI":"10.1109\/CCC.2003.1214418"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum copy-protection and quantum money. In: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity, CCC 2009, USA, pp. 229\u2013242. IEEE Computer Society (2009)","DOI":"10.1109\/CCC.2009.42"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Karloff, H.J., Pitassi, T. (eds.) 44th Annual ACM Symposium on Theory of Computing, pp. 41\u201360. ACM Press, New York (2012)","DOI":"10.1145\/2213977.2213983"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Amos, R., Georgiou, M., Kiayias, A., Zhandry, M.: One-shot signatures and applications to hybrid quantum\/classical authentication. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) 52nd Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, pp. 255\u2013268. ACM Press (2020)","DOI":"10.1145\/3357713.3384304"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: 55th Annual Symposium on Foundations of Computer Science, Philadelphia, PA, USA, pp. 474\u2013483. IEEE Computer Society Press (2014)","DOI":"10.1109\/FOCS.2014.57"},{"issue":"4","key":"12_CR6","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)","journal-title":"J. ACM"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Asharov, G., Segev, G.: Limits on the power of indistinguishability obfuscation and functional encryption. In: Guruswami, V. (ed.) 56th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, pp. 191\u2013209. IEEE Computer Society Press (2015)","DOI":"10.1109\/FOCS.2015.21"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-662-49099-0_19","volume-title":"Theory of Cryptography","author":"G Asharov","year":"2016","unstructured":"Asharov, G., Segev, G.: On constructing one-way permutations from indistinguishability obfuscation. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016, Part II. LNCS, vol. 9563, pp. 512\u2013541. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_19"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"E Bach","year":"1990","unstructured":"Bach, E.: Explicit bounds for primality testing and related problems. Math. Comput. 55, 355\u2013380 (1990)","journal-title":"Math. Comput."},{"key":"12_CR10","unstructured":"Bartusek, J.: Personal communication, and also announced at the NTT research quantum money workshop (2023)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U.V., Vidick, T.: A cryptographic test of quantumness and certifiable randomness from a single quantum device. In: Thorup, M. (ed.) 59th Annual Symposium on Foundations of Computer Science, Paris, France, pp. 320\u2013331. IEEE Computer Society Press (2018)","DOI":"10.1109\/FOCS.2018.00038"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-031-58737-5_4","volume-title":"Advances in Cryptology","author":"J Bartusek","year":"2024","unstructured":"Bartusek, J., Goyal, V., Khurana, D., Malavolta, G., Raizes, J., Roberts, B.: Software with certified deletion. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part IV. Lecture Notes in Computer Science, vol. 14654, pp. 85\u2013111. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58737-5_4"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-031-38554-4_7","volume-title":"Advances in Cryptology","author":"J Bartusek","year":"2023","unstructured":"Bartusek, J., Khurana, D.: Cryptography with certified deletion. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 192\u2013223. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_7"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-031-38554-4_4","volume-title":"Advances in Cryptology","author":"J Bartusek","year":"2023","unstructured":"Bartusek, J., Khurana, D., Poremba, A.: Publicly-verifiable deletion via target-collapsing functions. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 99\u2013128. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_4"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-70500-2_9","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Kim, S., Wu, D.J.: Constrained keys for invertible pseudorandom functions. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part I. LNCS, vol. 10677, pp. 237\u2013263. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_9"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-662-49096-9_20","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2016","unstructured":"Bitansky, N., Paneth, O., Wichs, D.: Perfect structure on the edge of chaos. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016, Part I. LNCS, vol. 9562, pp. 474\u2013502. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_20"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-030-03807-6_18","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2018","unstructured":"Canetti, R., Lichtenberg, A.: Certifying trapdoor permutations, revisited. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part I. LNCS, vol. 11239, pp. 476\u2013506. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_18"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-662-46497-7_19","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2015","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 468\u2013497. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_19"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.22331\/q-2020-07-16-297","volume":"4","author":"A Coladangelo","year":"2020","unstructured":"Coladangelo, A., Sattath, O.: A quantum money solution to the blockchain scalability problem. Quantum 4, 297 (2020)","journal-title":"Quantum"},{"issue":"6","key":"12_CR23","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR24","unstructured":"Drake, J.: One-shot signatures. Talk given at the programmable cryptography conference progcrypto (2023). https:\/\/www.youtube.com\/watch?v=VmqkH3NPG_s"},{"key":"12_CR25","unstructured":"Dall\u2019Agnol, M., Spooner, N: On the necessity of collapsing for post-quantum and quantum commitments. In: Fawzi, O., Walter, M. (eds.) 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 266, pp. 2:1\u20132:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Farhi, E., Gosset, D., Hassidim, A., Lutomirski, A., Shor, P.W.: Quantum money from knots. In: Goldwasser, S. (ed.) ITCS 2012: 3rd Innovations in Theoretical Computer Science, Cambridge, MA, USA, pp. 276\u2013289. Association for Computing Machinery (2012)","DOI":"10.1145\/2090236.2090260"},{"key":"12_CR27","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 Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, pp. 40\u201349. IEEE Computer Society Press (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-540-74619-5_28","volume-title":"Fast Software Encryption","author":"L Granboulan","year":"2007","unstructured":"Granboulan, L., Pornin, T.: Perfect block ciphers with small blocks. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 452\u2013465. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74619-5_28"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-56617-7_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"S Garg","year":"2017","unstructured":"Garg, S., Pandey, O., Srinivasan, A., Zhandry, M.: Breaking the sub-exponential barrier in obfustopia. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212, pp. 156\u2013181. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_6"},{"issue":"3","key":"12_CR30","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00145-012-9131-8","volume":"26","author":"O Goldreich","year":"2013","unstructured":"Goldreich, O., Rothblum, R.D.: Enhancements of trapdoor permutations. J. Cryptol. 26(3), 484\u2013512 (2013)","journal-title":"J. Cryptol."},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32009-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"VT Hoang","year":"2012","unstructured":"Hoang, V.T., Morris, B., Rogaway, P.: An enciphering scheme based on a card shuffle. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 1\u201313. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_1"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Hoover, A., Patel, S., Persiano, G., Yeo, K.: Plinko: single-server PIR with efficient updates via invertible PRFs. Cryptology ePrint Archive, Report 2024\/318 (2024)","DOI":"10.1007\/978-3-031-91095-1_1"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-031-48624-1_9","volume-title":"Theory of Cryptography","author":"F Kitagawa","year":"2023","unstructured":"Kitagawa, F., Nishimaki, R., Yamakawa, T.: Publicly verifiable deletion from minimal assumptions. In: Rothblum, G., Wee, H. (eds.) TCC 2023, Part IV. LNCS, vol. 14372, pp. 228\u2013245. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_9"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.-R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013: 20th Conference on Computer and Communications Security, Berlin, Germany, pp. 669\u2013684. ACM Press (2013)","DOI":"10.1145\/2508859.2516668"},{"issue":"1","key":"12_CR35","first-page":"60","volume":"2","author":"DM Kane","year":"2022","unstructured":"Kane, D.M., Sharif, S., Silverberg, A.: Quantum money from quaternion algebras. Math. Cryptol. 2(1), 60\u201383 (2022)","journal-title":"Math. Cryptol."},{"key":"12_CR36","unstructured":"Liu, J., Liu, Q., Qian, L.: Beating classical impossibility of position verification. In: Braverman, M. (ed.) ITCS 2022: 13th Innovations in Theoretical Computer Science Conference, Berkeley, CA, USA, vol. 215, pp. 100:1\u2013100:11. Leibniz International Proceedings in Informatics (LIPIcs) (2022)"},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-031-30545-0_21","volume-title":"Advances in Cryptology","author":"J Liu","year":"2023","unstructured":"Liu, J., Montgomery, H., Zhandry, M.: Another round of breaking and making quantum money. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 611\u2013638. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_21"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Morris, B.: The mixing time of the Thorp shuffle. In: Gabow, H.N., Fagin, R. (eds.) 37th Annual ACM Symposium on Theory of Computing, Baltimore, MA, USA, pp. 403\u2013412. ACM Press (2005)","DOI":"10.1145\/1060590.1060651"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-55220-5_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"B Morris","year":"2014","unstructured":"Morris, B., Rogaway, P.: Sometimes-recurse shuffle. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 311\u2013326. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_18"},{"key":"12_CR40","unstructured":"Morimae, T., Yamakawa, T.: Proofs of quantumness from trapdoor permutations. In: Kalai, Y.T. (ed.) ITCS 2023: 14th Innovations in Theoretical Computer Science Conference, Cambridge, MA, USA, vol. 251, pp. 87:1\u201387:14. Leibniz International Proceedings in Informatics (LIPIcs) (2023)"},{"key":"12_CR41","unstructured":"Ma, Y., Zhong, K., Rabin, T., Angel, S.: Incremental offline\/online PIR. In: 31st USENIX Security Symposium (USENIX Security 2022), Boston, MA, pp. 1741\u20131758. USENIX Association (2022)"},{"key":"12_CR42","unstructured":"NTT Research Quantum Money Workshop (2023)"},{"key":"12_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45682-1_14","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"J Patarin","year":"2001","unstructured":"Patarin, J.: Generic attacks on Feistel schemes. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 222\u2013238. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_14"},{"key":"12_CR44","unstructured":"QSig Workshop (2024). https:\/\/informatics.ed.ac.uk\/blockchain\/events\/previous-events\/qsig"},{"key":"12_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-40041-4_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"T Ristenpart","year":"2013","unstructured":"Ristenpart, T., Yilek, S.: The mix-and-cut shuffle: small-domain encryption secure against N queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 392\u2013409. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_22"},{"key":"12_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-030-84259-8_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"E Shi","year":"2021","unstructured":"Shi, E., Aqeel, W., Chandrasekaran, B., Maggs, B.: Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 641\u2013669. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_22"},{"key":"12_CR47","unstructured":"Sattath, O.: Quantum prudent contracts with applications to bitcoin (2022)"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"Shmueli, O.: Public-key quantum money with a classical bank. In: Leonardi, S, Gupta, A. (eds.) 54th Annual ACM Symposium on Theory of Computing, Rome, Italy, pp. 790\u2013803. ACM Press (2022)","DOI":"10.1145\/3519935.3519952"},{"key":"12_CR49","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-031-15802-5_11","volume-title":"Advances in Cryptology","author":"O Shmueli","year":"2022","unstructured":"Shmueli, O.: Semi-quantum tokenized signatures. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 296\u2013319. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_11"},{"key":"12_CR50","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, pp. 124\u2013134. IEEE Computer Society Press (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"12_CR51","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, pp. 475\u2013484. ACM Press, New York (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"12_CR52","doi-asserted-by":"crossref","unstructured":"Shmueli, O., Zhandry, M.: On one-shot signatures, quantum vs classical binding, and obfuscating permutations. Cryptology ePrint Archive (2025)","DOI":"10.1007\/978-3-032-01878-6_12"},{"key":"12_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-662-53890-6_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Collapse-binding quantum commitments without random oracles. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 166\u2013195. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_6"},{"key":"12_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49896-5_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Computationally binding quantum commitments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 497\u2013527. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_18"},{"issue":"1","key":"12_CR55","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":"12_CR56","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, pp. 80\u201391. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.45"},{"issue":"7\u20138","key":"12_CR57","first-page":"557","volume":"15","author":"M Zhandry","year":"2015","unstructured":"Zhandry, M.: A note on the quantum collision and set equality problems. Quantum Inf. Comput. 15(7\u20138), 557\u2013567 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"12_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-030-17659-4_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 408\u2013438. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_14"},{"key":"12_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-031-15982-4_20","volume-title":"Advances in Cryptology","author":"M Zhandry","year":"2022","unstructured":"Zhandry, M.: New constructions of collapsing hashes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part III. LNCS, vol. 13509, pp. 596\u2013624. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_20"},{"key":"12_CR60","unstructured":"Zhandry, M.: Quantum money from abelian group actions. In: Guruswami, V. (ed.) ITCS 2024: 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, USA, vol. 287, pp. 101:1\u2013101:23. Leibniz International Proceedings in Informatics (LIPIcs) (2024)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:11:24Z","timestamp":1757430684000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_12","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":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}