{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:19:13Z","timestamp":1778167153175,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"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_17","type":"book-chapter","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:54:43Z","timestamp":1778165683000},"page":"481-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How to\u00a0Copy-Protect Malleable-Puncturable Cryptographic Functionalities Under Arbitrary Challenge Distributions: A Unified Solution to\u00a0Quantum Protection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-1704","authenticated-orcid":false,"given":"Alper","family":"\u00c7akan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum copy-protection and quantum money. In: 2009 24th Annual IEEE Conference on Computational Complexity, pp. 229\u2013242 (2009)","DOI":"10.1109\/CCC.2009.42"},{"key":"17_CR2","unstructured":"Aaronson, S.: The complexity of quantum states and transformations: From quantum money to black holes (2016)"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Ananth, P., Behera, A.: A modular approach to unclonable cryptography. In: Reyzin, L., Stebila, D. (eds) CRYPTO 2024. LNCS, vol 14926, pp. 3\u201337. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_1","DOI":"10.1007\/978-3-031-68394-7_1"},{"key":"17_CR4","unstructured":"Ananth, P., Behera, A., Huang, Z.: Copy-protection from UPO, revisited. Cryptology ePrint Archive, Paper 2025\/1207 (2025)"},{"key":"17_CR5","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, May\u00a019\u201322 (2012)","DOI":"10.1145\/2213977.2213983"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Ananth, P., Chung, KM., Fan, X., Qian, L.: Collusion-Resistant Functional Encryption for RAMs. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol 13791, pp. 160\u2013194. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_6","DOI":"10.1007\/978-3-031-22963-3_6"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-030-77886-6_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P Ananth","year":"2021","unstructured":"Ananth, P., La Placa, R.L.: Secure software leasing. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 501\u2013530. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_17"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Liu, J., Liu, Q., Zhandry, M., Zhang, R.: New approaches for quantum copy-protection. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 526\u2013555. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_19","DOI":"10.1007\/978-3-030-84242-0_19"},{"key":"17_CR9","unstructured":"Authors. Constructing malleable-puncturable fully homomorphic encryption. Same authors as this paper (anonimized due to blind submission) (2025)"},{"key":"17_CR10","unstructured":"Brassard, G., Bennett, C.H.: Quantum cryptography: Public key distribution and coin tossing. In: International Conference on Computers, Systems and Signal Processing, pp. 175\u2013179 (1984)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Brakerski, Z., Vaikuntanathan, V.: Quantum state obfuscation from classical oracles. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) 56th Annual ACM Symposium on Theory of Computing, pp. 1009\u20131017. ACM Press, Vancouver, BC, Canada, June\u00a024\u201328 (2024)","DOI":"10.1145\/3618260.3649673"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Sattath, O.: Quantum tokens for digital signatures. Quantum 7, 901 (2023)","DOI":"10.22331\/q-2023-01-19-901"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., Kim, S., Wu, D.J.: Constrained keys for invertible pseudorandom functions. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 237\u2013263. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_9","DOI":"10.1007\/978-3-319-70500-2_9"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Constrained key-homomorphic PRFs from standard lattice assumptions. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 1\u201330. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_1","DOI":"10.1007\/978-3-662-46497-7_1"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"\u00c7akan, A., Goyal, V.: Unclonable cryptography with unbounded collusions and impossibility of hyperefficient shadow tomography. In: Boyle, E., Mahmoody, M. (eds.) Theory of Cryptography. TCC 2024. Lecture Notes in Computer Science, vol .15366, pp. 225\u2013256. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-78020-2_8","DOI":"10.1007\/978-3-031-78020-2_8"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Coladangelo, A., Gunn, S.: How to use quantum indistinguishability obfuscation. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, pp. 1003\u20131008. Association for Computing Machinery, New York (2024)","DOI":"10.1145\/3618260.3649779"},{"key":"17_CR17","unstructured":"\u00c7akan, A., Goyal, V.: How to copy-protect all puncturable functionalities without conjectures: a unified solution to quantum protection. Cryptology ePrint Archive, Paper 2025\/1197 (2025)"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"\u00c7akan, A., Goyal, V., Liu-Zhang, C.D., Ribeiro, J.: Unbounded leakage-resilience and intrusion-detection in a quantum world. In: Boyle, E., Mahmoody, M. (eds) TCC 2024. LNCS, vol. 15365, pp. 159\u2013191. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-78017-2_6","DOI":"10.1007\/978-3-031-78017-2_6"},{"key":"17_CR19","unstructured":"\u00c7akan, A., Goyal, V., Shmueli, O.: Public-key quantum fire and key-fire from classical oracles. arXiv preprint arXiv:2504.16407 (2025)"},{"key":"17_CR20","unstructured":"Cakan, A., Goyal, V., Yamakawa, T.: Anonymous public-key quantum money and quantum voting. arXiv preprint arXiv:2411.04482 (2024)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.: Succinct garbling and indistinguishability obfuscation for RAM programs. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th Annual ACM Symposium on Theory of Computing, pp. 429\u2013437. ACM Press, Portland, OR, USA, June\u00a014\u201317 (2015)","DOI":"10.1145\/2746539.2746621"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Coladangelo, A., Liu, J., Liu, Q., Zhandry, M.: Hidden cosets and applications to unclonable cryptography. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 556\u2013584. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_20","DOI":"10.1007\/978-3-030-84242-0_20"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 468\u2013497. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_19","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., et al.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578\u2013602. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_32","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"17_CR25","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, pp. 40\u201349. IEEE Computer Society Press, Berkeley, CA, USA, October\u00a026\u201329 (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Goyal, V., Jain, A., Koppula, V., Sahai, A.: Functional encryption for randomized functionalities. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 325\u2013351. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_13","DOI":"10.1007\/978-3-662-46497-7_13"},{"key":"17_CR27","unstructured":"Kitagawa, F., Yamakawa, T.: Copy protecting cryptographic functionalities over entropic inputs. Cryptology ePrint Archive, Paper 2025\/1264 (2025)"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Yamakawa, T.: Foundations of single-decryptor encryption (2025)","DOI":"10.1007\/978-3-032-12296-4_6"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Liu, J., Liu, Q., Qian, L., Zhandry, M.: Collusion resistant copy-protection for watermarkable functionalities. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, vol. 13747, pp. 294\u2013323, Chicago, IL, USA, November\u00a07\u201310, 2022. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22318-1_11"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Lin, W.-K., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE. In: Saha, B., Servedio, R.A. (eds.) 55th Annual ACM Symposium on Theory of Computing, pp. 595\u2013608. ACM Press, Orlando, FL, USA, June\u00a020\u201323 (2023)","DOI":"10.1145\/3564246.3585175"},{"key":"17_CR31","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, 31 May\u20133 June 2014","DOI":"10.1145\/2591796.2591825"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78\u201388 (1983)","DOI":"10.1145\/1008908.1008920"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: Umans, C. (ed.) 58th Annual Symposium on Foundations of Computer Science, pp. 600\u2013611. IEEE Computer Society Press, Berkeley, October\u00a015\u201317 (2017)","DOI":"10.1109\/FOCS.2017.61"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. or: quantum money from cryptographic assumptions. J. Cryptology 34(1), 6 (2021)","DOI":"10.1007\/s00145-020-09372-x"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:54:53Z","timestamp":1778165693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25291-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032252906","9783032252913"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25291-3_17","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"}}]}}