{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:51:11Z","timestamp":1778215871100,"version":"3.51.4"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683930","type":"print"},{"value":"9783031683947","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68394-7_1","type":"book-chapter","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T09:02:27Z","timestamp":1723885347000},"page":"3-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Modular Approach to\u00a0Unclonable Cryptography"],"prefix":"10.1007","author":[{"given":"Prabhanjan","family":"Ananth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Behera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,18]]},"reference":[{"key":"1_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. IEEE (2009)","DOI":"10.1109\/CCC.2009.42"},{"key":"1_CR2","unstructured":"Aaronson, S.: The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes (2016). arXiv:1607.05256 [quant-ph]"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45841-7_26","volume-title":"STACS 2002","author":"M Adcock","year":"2002","unstructured":"Adcock, M., Cleve, R.: A quantum Goldreich-Levin theorem with cryptographic applications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 323\u2013334. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_26"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing. STOC \u201912, pp. 41\u201360. Association for Computing Machinery. New York, New York, USA (2012). ISBN 9781450312455. https:\/\/doi.org\/10.1145\/2213977.2213983","DOI":"10.1145\/2213977.2213983"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-030-90459-3_11","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2021","unstructured":"Ananth, P., Kaleoglu, F.: Unclonable encryption, revisited. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 299\u2013329. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_11"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-031-15979-4_8","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"P Ananth","year":"2022","unstructured":"Ananth, P., Kaleoglu, F., Li, X., Liu, Q., Zhandry, M.: On the feasibility of unclonable encryption, and more. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 212\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_8"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Ananth, P., Kaleoglu, F., Liu, Q.: Cloning games: a general framework for unclonable primitives. arXiv preprint arXiv:2302.01874 (2023)","DOI":"10.1007\/978-3-031-38554-4_3"},{"key":"1_CR8","unstructured":"Ananth, P., Kaleoglu, F., Yuen, H.: Simultaneous haar indistinguishability with applications to unclonable cryptography. arXiv preprint arXiv:2405.10274 (2024)"},{"key":"1_CR9","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":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-031-48624-1_4","volume-title":"Theory of Cryptography - TCC 2023","author":"P Ananth","year":"2023","unstructured":"Ananth, P., Poremba, A., Vaikuntanathan, V.: Revocable cryptography from learning with errors. In: Rothblum, G., Wee, H. (eds.) TCC 2023. LNCS, vol. 14372, pp. 93\u2013122. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_4"},{"key":"1_CR11","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":"1_CR12","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":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-40084-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Broadbent","year":"2013","unstructured":"Broadbent, A., Gutoski, G., Stebila, D.: Quantum one-time programs. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 344\u2013360. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_20"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Karvonen, M., Lord, S.: Uncloneable quantum advice. arXiv preprint arXiv:2309.05155 (2023)","DOI":"10.62056\/abe0fhbmo"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Lord, S.: Uncloneable quantum encryption via oracles. en. In: Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.TQC.2020.4, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2020\/12063\/","DOI":"10.4230\/LIPICS.TQC.2020.4"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O., Rosen, A.: On the cryptographic hardness of finding a Nash equilibrium. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 1480\u20131498. IEEE (2015)","DOI":"10.1109\/FOCS.2015.94"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Ben-David, S., Sattath, O.: Quantum Tokens for Digital Signatures (2016). https:\/\/doi.org\/10.48550\/ARXIV.1609.09047, https:\/\/arxiv.org\/abs\/1609.09047","DOI":"10.48550\/ARXIV.1609.09047"},{"key":"1_CR18","unstructured":"Behera, A., Sattath, O.: Almost public quantum coins. arXiv preprint arXiv:2002.12438 (2020)"},{"key":"1_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. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Algorithmica 79, 1233\u20131285 (2017)","DOI":"10.1007\/s00453-016-0242-8"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Coladangelo, A., Gunn, S.: How to use quantum indistinguishability obfuscation. arXiv preprint arXiv:2311.07794 (2023)","DOI":"10.1145\/3618260.3649779"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Chevalier, C., Hermouet, P., Vu, Q.-H.: Semi-quantum copy-protection and more. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-48624-1_6"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-84242-0_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"A Coladangelo","year":"2021","unstructured":"Coladangelo, A., Liu, J., Liu, Q., Zhandry, M.: Hidden cosets and applications to unclonable cryptography. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 556\u2013584. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_20"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Dieks, D.G.B.J.: Communication by EPR devices. Phys. Lett. A 92(6), 271\u2013272 (1982)","DOI":"10.1016\/0375-9601(82)90084-6"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Gao, J.: Quantum union bounds for sequential projective measurements. Phys. Rev. A 92(5), 052331 (2015)","DOI":"10.1103\/PhysRevA.92.052331"},{"key":"1_CR26","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. SIAM J. Comput. 45(3), 882\u2013929 (2016)","DOI":"10.1137\/14095772X"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","volume-title":"Theory of Cryptography","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 74\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_4"},{"key":"1_CR28","unstructured":"Goyal, V., Malavolta, G., Raizes, J.: Unclonable commitments and proofs. Cryptology ePrint Archive (2023)"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Gottesman, D.: Uncloneable encryption (2002). https:\/\/doi.org\/10.48550\/ARXIV.QUANT-PH\/0210062. url: https:\/\/arxiv.org\/abs\/quant-ph\/0210062","DOI":"10.48550\/ARXIV.QUANT-PH\/0210062"},{"key":"1_CR30","unstructured":"Georgiou, M., Zhandry, M.: Unclonable decryption keys. IACR Cryptology ePrint Archive https:\/\/eprint.iacr.org\/2020\/877 (2020)"},{"key":"1_CR31","unstructured":"Jawale, R., Khurana, D.: Unclonable non-interactive zero-knowledge. arXiv preprint arXiv:2310.07118 (2023)"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 60\u201373 (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Nishimaki, R.: One-out-of-many unclonable cryptography: definitions, constructions, and more. arXiv preprint arXiv:2302.09836 (2023)","DOI":"10.1007\/978-3-031-48624-1_10"},{"key":"1_CR34","unstructured":"Kundu, S., Tan, E.Y.-Z.: Device-independent uncloneable encryption. In: arXiv preprint arXiv:2210.01058 (2022)"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-031-22318-1_11","volume-title":"Theory of Cryptography - TCC 2022","author":"J Liu","year":"2022","unstructured":"Liu, J., Liu, Q., Qian, L., Zhandry, M.: Collusion resistant copy-protection for watermarkable functionalities. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. Lecture Notes in Computer Science, vol. 13747, pp. 294\u2013323. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_11"},{"key":"1_CR36","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 - EUROCRYPT 2023","author":"J Liu","year":"2023","unstructured":"Liu, J., Montgomery, H., Zhandry, M.: Another round of breaking and making quantum money: how to not build it from lattices, and more. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14004, pp. 611\u2013638. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_21"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Radian, R., Sattath, O.: Semi-quantum money. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, pp. 132\u2013146 (2019)","DOI":"10.1145\/3318041.3355462"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-030-92062-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"B Roberts","year":"2021","unstructured":"Roberts, B., Zhandry, M.: Franchised quantum money. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 549\u2013574. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_19"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Shmueli, O.: Public-key Quantum money with a classical bank. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 790\u2013803 (2022)","DOI":"10.1145\/3519935.3519952"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-031-37679-5_17","volume-title":"Progress in Cryptology - AFRICACRYPT 2023","author":"K Sudo","year":"2023","unstructured":"Sudo, K., Tezuka, M., Hara, K., Yoshida, Y.: Quantum search-to-decision reduction for the LWE problem. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 2023. LNCS, vol. 14064, pp. 395\u2013413. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_17"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 475\u2013484 (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Wiesner, S.: Conjugate coding. ACM SIGACT News 15(1), 78\u201388 (1983)","DOI":"10.1145\/1008908.1008920"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","DOI":"10.1038\/299802a0"},{"key":"1_CR44","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. , pp. 408\u2013438. Springer, Cham (2019). ISBN 978-3-030-17659-4, https:\/\/doi.org\/10.1007\/978-3-030-17659-4_14","DOI":"10.1007\/978-3-030-17659-4_14"},{"key":"1_CR45","unstructured":"Zhandry, M.: Quantum money from abelian group actions. arXiv preprint arXiv:2307.12120 (2023)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68394-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:12:27Z","timestamp":1732651947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68394-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683930","9783031683947"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68394-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","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":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}