{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:06:22Z","timestamp":1764119182697,"version":"3.46.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031486234"},{"type":"electronic","value":"9783031486241"}],"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-48624-1_10","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"246-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["One-Out-of-Many Unclonable Cryptography: Definitions, Constructions, and\u00a0More"],"prefix":"10.1007","author":[{"given":"Fuyuki","family":"Kitagawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S.: Quantum copy-protection and quantum money. In: Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15\u201318 July 2009, pp. 229\u2013242. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/CCC.2009.42","DOI":"10.1109\/CCC.2009.42"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-030-84242-0_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Alagic","year":"2021","unstructured":"Alagic, G., Brakerski, Z., Dulek, Y., Schaffner, C.: Impossibility of quantum virtual black-box obfuscation of classical circuits. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 497\u2013525. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_18"},{"key":"10_CR3","doi-asserted-by":"publisher","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 ACM STOC, pp. 255\u2013268. ACM Press, June 2020. https:\/\/doi.org\/10.1145\/3357713.3384304","DOI":"10.1145\/3357713.3384304"},{"key":"10_CR4","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, Part I. LNCS, vol. 13042, pp. 299\u2013329. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_11"},{"key":"10_CR5","unstructured":"Ananth, P., Kaleoglu, F.: A note on copy-protection from random oracles. Cryptology ePrint Archive, Report 2022\/1109 (2022). https:\/\/eprint.iacr.org\/2022\/1109"},{"key":"10_CR6","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.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 212\u2013241. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_8","DOI":"10.1007\/978-3-031-15979-4_8"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Ananth, P., Kaleoglu, F., Liu, Q.: Cloning games: a general framework for unclonable primitives. arXiv (CoRR) abs\/2302.01874 (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.01874, https:\/\/arxiv.org\/pdf\/2302.01874.pdf","DOI":"10.48550\/arXiv.2302.01874"},{"key":"10_CR8","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, Part II. LNCS, vol. 12697, pp. 501\u2013530. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_17"},{"key":"10_CR9","unstructured":"Behera, A., Sattath, O.: Almost public quantum coins. CoRR abs\/2002.12438 (2020). https:\/\/arxiv.org\/abs\/2002.12438"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","volume":"560","author":"CH Bennett","year":"2014","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. Theor. Comput. Sci. 560, 7\u201311 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.05.025","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-96878-0_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z.: Quantum FHE (almost) as secure as\u00a0classical. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10993, pp. 67\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_3"},{"key":"10_CR12","unstructured":"Broadbent, A., Lord, S.: Uncloneable quantum encryption via oracles. In: Flammia, S.T. (ed.) 15th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2020, Riga, Latvia, 9\u201312 June 2020. LIPIcs, vol. 158, pp. 4:1\u20134:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"10_CR13","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":"10_CR14","unstructured":"Coladangelo, A., Majenz, C., Poremba, A.: Quantum copy-protection of compute-and-compare programs in the quantum random oracle model. arXiv (CoRR) abs\/2009.13865 (2020). https:\/\/arxiv.org\/abs\/2009.13865"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"791","DOI":"10.22331\/q-2022-09-01-791","volume":"6","author":"E Culf","year":"2022","unstructured":"Culf, E., Vidick, T.: A monogamy-of-entanglement game for subspace coset states. Quantum 6, 791 (2022)","journal-title":"Quantum"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-76578-5_1","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"N D\u00f6ttling","year":"2018","unstructured":"D\u00f6ttling, N., Garg, S., Hajiabadi, M., Masny, D.: New constructions of identity-based and key-dependent message secure encryption schemes. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part I. LNCS, vol. 10769, pp. 3\u201331. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_1"},{"key":"10_CR17","unstructured":"Georgiou, M., Zhandry, M.: Unclonable decryption keys. Cryptology ePrint Archive, Report 2020\/877 (2020). https:\/\/eprint.iacr.org\/2020\/877"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-662-48000-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Predicate encryption for circuits from LWE. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216, pp. 503\u2013523. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_25"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Gottesman, D.: Uncloneable encryption. Quantum Inf. Comput. 3(6), 581\u2013602 (2003). https:\/\/doi.org\/10.26421\/QIC3.6-2","DOI":"10.26421\/QIC3.6-2"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: Umans, C. (ed.) 58th FOCS, pp. 612\u2013621. IEEE Computer Society Press, October 2017. https:\/\/doi.org\/10.1109\/FOCS.2017.62","DOI":"10.1109\/FOCS.2017.62"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Kitagawa, F., Nishimaki, R.: Watermarking PRFs against quantum adversaries. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III. LNCS, vol. 13277, pp. 488\u2013518. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_18","DOI":"10.1007\/978-3-031-07082-2_18"},{"key":"10_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-031-22318-1_11","volume-title":"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. LNCS, vol. 13747, pp. 294\u2013323. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_11"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. In: Thorup, M. (ed.) 59th FOCS, pp. 332\u2013338. IEEE Computer Society Press, October 2018. https:\/\/doi.org\/10.1109\/FOCS.2018.00039","DOI":"10.1109\/FOCS.2018.00039"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Sahai, A., Seyalioglu, H.: Worry-free encryption: functional encryption with public keys. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010, pp. 463\u2013472. ACM Press, October 2010. https:\/\/doi.org\/10.1145\/1866307.1866359","DOI":"10.1145\/1866307.1866359"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Sattath, O., Wyborski, S.: Uncloneable decryptors from quantum copy-protection. arXiv (CoRR) abs\/2203.05866 (2022). https:\/\/doi.org\/10.48550\/arXiv.2203.05866","DOI":"10.48550\/arXiv.2203.05866"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Tomamichel, M., Fehr, S., Kaniewski, J., 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","DOI":"10.1088\/1367-2630\/15\/10\/103002"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: Umans, C. (ed.) 58th FOCS, pp. 600\u2013611. IEEE Computer Society Press, October 2017. https:\/\/doi.org\/10.1109\/FOCS.2017.61","DOI":"10.1109\/FOCS.2017.61"},{"issue":"1","key":"10_CR28","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). https:\/\/doi.org\/10.1145\/1008908.1008920","journal-title":"SIGACT News"},{"issue":"7","key":"10_CR29","doi-asserted-by":"publisher","first-page":"2481","DOI":"10.1109\/18.796385","volume":"45","author":"A Winter","year":"1999","unstructured":"Winter, A.: Coding theorem and strong converse for quantum channels. IEEE Trans. Inf. Theory 45(7), 2481\u20132485 (1999). https:\/\/doi.org\/10.1109\/18.796385","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-64381-2_3","volume-title":"Theory of Cryptography","author":"M Zhandry","year":"2020","unstructured":"Zhandry, M.: Schr\u00f6dinger\u2019s Pirate: how to trace a quantum decoder. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part III. LNCS, vol. 12552, pp. 61\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_3"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48624-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:02:49Z","timestamp":1764118969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48624-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486234","9783031486241"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48624-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"168","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":"68","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":"40% - 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":"13","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}