{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:51:09Z","timestamp":1778215869780,"version":"3.51.4"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385537","type":"print"},{"value":"9783031385544","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38554-4_3","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"66-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Cloning Games: A General Framework for\u00a0Unclonable Primitives"],"prefix":"10.1007","author":[{"given":"Prabhanjan","family":"Ananth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatih","family":"Kaleoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qipeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"3_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) (cit. on pp. 2, 3)","DOI":"10.1109\/CCC.2009.42"},{"key":"3_CR2","doi-asserted-by":"publisher","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 (cit. on p. 22)","DOI":"10.1007\/3-540-45841-7_26"},{"key":"3_CR3","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 2012). Association for Computing Machinery, New York (2012), pp. 41\u201360. https:\/\/doi.org\/10.1145\/2213977.2213983. ISBN:9781450312455 (cit. on pp. 2, 5, 28, 29)","DOI":"10.1145\/2213977.2213983"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Ananth, P. Kaleoglu, F. Unclonable ecryption, 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 (cit. on pp. 3, 5, 8, 27)","DOI":"10.1007\/978-3-030-90459-3_11"},{"key":"3_CR5","doi-asserted-by":"publisher","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.). Advances in Cryptology \u2013 CRYPTO 2022, pp. 212\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_8. ISBN:978-3-031-15979-4 (cit. on pp. 3, 5-8, 20-22, 27)","DOI":"10.1007\/978-3-031-15979-4_8"},{"key":"3_CR6","doi-asserted-by":"publisher","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 (cit. on p. 2)","DOI":"10.1007\/978-3-030-77886-6_17"},{"key":"3_CR7","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.) Advances in Cryptology - CRYPTO 2021, pp. 526\u2013555. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_19. ISBN:978-3-030-84242-0 (cit. on pp. 2, 8)","DOI":"10.1007\/978-3-030-84242-0_19"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from pseudorandom quantum states. In: Annual International Cryptology Conference, pp. 208\u2013236. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_8 (cit. on p. 5)","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Bennett, C., Brassard, G.: Quantum cryptography: public key distribution and coin tossing, vol. 560, pp. 175\u2013179 (1984). https:\/\/doi.org\/10.1016\/j.tcs.2011.08.039 (cit. on p. 5)","DOI":"10.1016\/j.tcs.2011.08.039"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Brakerski, Z., Kalai, Y.T.: Constructive post-quantum reductions. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. Springer, Cham (2022), pp. 654\u2013683. https:\/\/doi.org\/10.1007\/978-3-031-15982-4_22. ISBN:978-3-031-15982-4 (cit. on pp. 15, 23)","DOI":"10.1007\/978-3-031-15982-4_22"},{"key":"3_CR11","unstructured":"Brakerski, Z., Canetti, R., Qian, L.: On the computational hardness needed for quantum cryptography. arXiv preprint arXiv:2209.04101 (2022) (cit. on p. 5)"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3 (cit. on p. 20)","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"3_CR13","doi-asserted-by":"publisher","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 (cit. on p. 2)","DOI":"10.1007\/978-3-642-40084-1_20"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Islam, R.: Quantum encryption with certified deletion. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 92\u2013122. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_4 (cit. on pp. 2, 5, 9, 22)","DOI":"10.1007\/978-3-030-64381-2_4"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Jeffery, S., Lord, S., Podder, S., Sundaram, A.: Secure software leasing without assumptions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 90\u2013120. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_4 (cit. on pp. 2, 6, 27)","DOI":"10.1007\/978-3-030-90459-3_4"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Khurana, D.: Cryptography with Certified Deletion (2022). https:\/\/doi.org\/10.48550\/ARXIV.2207.01754 (cit. on pp. 9, 22)","DOI":"10.48550\/ARXIV.2207.01754"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Lord, S.: Uncloneable quantum encryption via oracles. In: Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.TQC.2020.4 (cit. on pp. 2, 5, 8, 20, 22, 27)","DOI":"10.4230\/LIPICS.TQC.2020.4"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Ben-David, S., Sattath, O.: Quantum Tokens for Digital Signatures (2016). https:\/\/doi.org\/10.48550\/ARXIV.1609.09047 (cit. on p. 2)","DOI":"10.48550\/ARXIV.1609.09047"},{"key":"3_CR19","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 (cit. on pp. 2, 4, 5, 7, 8, 22)","DOI":"10.1007\/978-3-030-84242-0_20"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Coladangelo, A., Majenz, C., Poremba, A.: Quantum copy-protection of compute-and-compare programs in the quantum random oracle model (2020). 13865. https:\/\/doi.org\/10.48550\/ARXIV.2009 (cit. on pp. 3, 5, 6, 8, 27)","DOI":"10.48550\/ARXIV.2009"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments: breaking the quantum rewinding barrier. In: 62nd FOCS, pp. 49\u201358. IEEE Computer Society (2022). (cit. on pp. 16\u201318)","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Culf, E., Vidick, T.: A monogamy-of-entanglement game for subspace coset states. arXiv preprint arXiv:2107.13324 [cs.CR] (2021) (cit. on p. 22)","DOI":"10.22331\/q-2022-09-01-791"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"DGBJ Dieks. Communication by EPR devices. Phys. Lett. A 92(6), 271\u2013272 (1982) (cit. on p. 2)","DOI":"10.1016\/0375-9601(82)90084-6"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, Seattle (STOC 1989), pp. 25\u201332. Association for Computing Machinery (1989). https:\/\/doi.org\/10.1145\/73007.73010. ISBN:0897913078 (cit. on pp. 6, 13)","DOI":"10.1145\/73007.73010"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Gottesman, D.: Uncloneable Encryption (2002). https:\/\/doi.org\/10.48550\/ARXIV.QUANT-PH\/0210062 (cit. on p. 2)","DOI":"10.48550\/ARXIV.QUANT-PH\/0210062"},{"key":"3_CR26","unstructured":"Georgiou, M., Zhandry, M.: Unclonable decryption keys. In: IACR Cryptol. ePrint Arch (2020), p. 877 (cit. on pp. 4, 7, 28)"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Certified everlasting zero-knowledge proof for QMA. In: Annual International Cryptology Conference, pp. 239\u2013268. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_9(cit. on p. 2)","DOI":"10.1007\/978-3-031-15802-5_9"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, pp. 134\u2013147. IEEE (1995) (cit. on p. 5)","DOI":"10.1109\/SCT.1995.514853"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 8\u201326. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_2 (cit. on p. 5)","DOI":"10.1007\/0-387-34799-2_2"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Jordan, C.: Essai sur la g\u00e9om\u00e9trie \u00e0 n dimensions fre. In: Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France 3, pp. 103\u2013174 (1875) (cit. on p. 17)","DOI":"10.24033\/bsmf.90"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Kitagawa, F. Nishimaki, R. Yamakawa, T. Secure software leasing from standard assumptions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 31\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_2 (cit. on p. 2)","DOI":"10.1007\/978-3-030-90459-3_2"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Annual International Cryptology Conference, pp. 269\u2013295. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10 (cit. on p. 5)","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"3_CR33","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) (cit. on p. 2)","DOI":"10.1145\/3519935.3519952"},{"key":"3_CR34","unstructured":"Sattath, O., Wyborski, S.: Uncloneable decryption from quantum copy protection. arXiv preprint arXiv:2203.05866 (2022) (cit. on p. 5)"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Tomamichel, M., Fehr, S., Kaniewski, J.d., Wehner, S.: A monogamy-of-entanglement game with applications to device-independent quantum cryptography. New J. Phys. 15(10), 103002 (2013). https:\/\/doi.org\/10.1088\/1367-2630\/15\/10\/103002 (cit. on pp. 8, 9, 22)","DOI":"10.1088\/1367-2630\/15\/10\/103002"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Vidick, T., Zhang, T.: Classical proofs of quantum knowledge. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 630\u2013660. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_22 (cit. on p. 5)","DOI":"10.1007\/978-3-030-77886-6_22"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Wiesner, S.: Conjugate coding. ACM Sigact News 15(1), 78\u201388 (1983) (cit. on pp. 2, 5, 28)","DOI":"10.1145\/1008908.1008920"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), pp. 802\u2013803 (1982) (cit. on p. 2)","DOI":"10.1038\/299802a0"},{"key":"3_CR39","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. 11478, pp. 408\u2013438. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_14 (cit. on pp. 2, 5, 28)","DOI":"10.1007\/978-3-030-17659-4_14"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38554-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:52Z","timestamp":1753567432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38554-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385537","9783031385544"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38554-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"124","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}