{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:45:24Z","timestamp":1771479924385,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223174","type":"print"},{"value":"9783031223181","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22318-1_11","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"294-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Collusion Resistant Copy-Protection for\u00a0Watermarkable Functionalities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4380-8168","authenticated-orcid":false,"given":"Jiahui","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3994-7061","authenticated-orcid":false,"given":"Qipeng","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1112-8822","authenticated-orcid":false,"given":"Luowen","family":"Qian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7071-6272","authenticated-orcid":false,"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2005.v001a001","volume":"1","author":"S Aaronson","year":"2005","unstructured":"Aaronson, S.: Limitations of quantum advice and one-way communication. Theory Comput. 1(1), 1\u201328 (2005). https:\/\/doi.org\/10.4086\/toc.2005.v001a001","journal-title":"Theory Comput."},{"key":"11_CR2","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"},{"issue":"9","key":"11_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.4086\/toc.2013.v009a009","volume":"9","author":"S Aaronson","year":"2013","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. Theory Comput. 9(9), 349\u2013401 (2013). https:\/\/doi.org\/10.4086\/toc.2013.v009a009","journal-title":"Theory Comput."},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-030-84242-0_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Aaronson","year":"2021","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"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Ananth, P., Kaleoglu, F.: A note on copy-protection from random oracles (2022). https:\/\/doi.org\/10.48550\/ARXIV.2208.12884. https:\/\/arxiv.org\/abs\/2208.12884","DOI":"10.48550\/ARXIV.2208.12884"},{"key":"11_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.) Advances in Cryptology - CRYPTO 2022. Lecture Notes in Computer Science, vol. 13507. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_8","DOI":"10.1007\/978-3-031-15979-4_8"},{"key":"11_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":"11_CR8","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":"11_CR9","unstructured":"Ben-David, S., Sattath, O.: Quantum tokens for digital signatures (2016)"},{"key":"11_CR10","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of International Conference on Computers, Systems & Signal Processing, 9\u201312 Dec 1984, pp. 175\u2013179. Bangalore, India (1984)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-030-90459-3_4","volume-title":"Theory of Cryptography","author":"A Broadbent","year":"2021","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"},{"issue":"6","key":"11_CR12","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1137\/18M1164834","volume":"47","author":"A Cohen","year":"2018","unstructured":"Cohen, A., Holmgren, J., Nishimaki, R., Vaikuntanathan, V., Wichs, D.: Watermarking cryptographic capabilities. SIAM J. Comput. 47(6), 2157\u20132202 (2018)","journal-title":"SIAM J. Comput."},{"key":"11_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. LNCS, vol. 12825, pp. 556\u2013584. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_20"},{"key":"11_CR14","unstructured":"Coladangelo, A., Majenz, C., Poremba, A.: Quantum copy-protection of compute-and-compare programs in the quantum random oracle model (2020). https:\/\/arxiv.org\/abs\/2009.13865"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Culf, E., Vidick, T.: A monogamy-of-entanglement game for subspace coset states (2021)","DOI":"10.22331\/q-2022-09-01-791"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","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). https:\/\/doi.org\/10.1137\/14095772X","journal-title":"SIAM J. Comput."},{"key":"11_CR17","unstructured":"Georgiou, M., Zhandry, M.: Unclonable decryption keys (2020). https:\/\/eprint.iacr.org\/2020\/877"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-030-26954-8_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"R Goyal","year":"2019","unstructured":"Goyal, R., Kim, S., Manohar, N., Waters, B., Wu, D.J.: Watermarking public-key cryptographic primitives. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 367\u2013398. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_12"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-319-63688-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Kim","year":"2017","unstructured":"Kim, S., Wu, D.J.: Watermarking cryptographic functionalities from standard lattice assumptions. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 503\u2013536. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_17"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-26954-8_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Kim","year":"2019","unstructured":"Kim, S., Wu, D.J.: Watermarking PRFs from lattices: stronger security via extractable PRFs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 335\u2013366. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_11"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-030-90459-3_2","volume-title":"Theory of Cryptography","author":"F Kitagawa","year":"2021","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"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. In: Hsieh, M. (ed.) 16th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2021, 5\u20138 July 2021, Virtual Conference. LIPIcs, vol. 197, pp. 1\u201320. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2021.2","DOI":"10.4230\/LIPIcs.TQC.2021.2"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Marriott, C., Watrous, J.: Quantum arthur-merlin games. computational complexity 14(2), 122\u2013152 (2005). https:\/\/doi.org\/10.1007\/s00037-005-0194-x","DOI":"10.1007\/s00037-005-0194-x"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information: 10th Anniversary Edition. Cambridge University Press (2010). https:\/\/doi.org\/10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/15M1030108","volume":"50","author":"A Sahai","year":"2021","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: Deniable encryption, and more. SIAM J. Comput. 50(3), 857\u2013908 (2021). https:\/\/doi.org\/10.1137\/15M1030108","journal-title":"SIAM J. Comput."},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-030-77886-6_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"T Vidick","year":"2021","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"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78\u201388 (1983). https:\/\/doi.org\/10.1145\/1008908.1008920","DOI":"10.1145\/1008908.1008920"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-34578-5_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"R Yang","year":"2019","unstructured":"Yang, R., Au, M.H., Lai, J., Xu, Q., Yu, Z.: Collusion resistant watermarking schemes for cryptographic functionalities. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 371\u2013398. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_14"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-030-56784-2_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"R Yang","year":"2020","unstructured":"Yang, R., Au, M.H., Yu, Z., Xu, Q.: Collusion resistant watermarkable PRFs from standard assumptions. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 590\u2013620. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_20"},{"key":"11_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. 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-22318-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:01:56Z","timestamp":1766278916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 December 2022","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":"Chicago, IL","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","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":"139","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":"60","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":"43% - 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.1","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":"9.9","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"}]}}