{"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":1778215869609,"version":"3.51.4"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030904586","type":"print"},{"value":"9783030904593","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90459-3_11","type":"book-chapter","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T21:34:31Z","timestamp":1636148071000},"page":"299-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Unclonable Encryption, Revisited"],"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"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Limitations of quantum advice and one-way communication. In: Proceedings of the 19th IEEE Annual Conference on Computational Complexity, CCC 2004, pp. 320\u2013332. IEEE Computer Society, USA (2004)","DOI":"10.1109\/CCC.2004.1313854"},{"key":"11_CR2","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":"11_CR3","unstructured":"Aaronson, S.: The complexity of quantum states and transformations: from quantum money to black holes (2016)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Liu, J., Liu, Q., Zhandry, M., Zhang, R.: New approaches for quantum copy-protection. arXiv preprint arXiv:2004.09674 (2020)","DOI":"10.1007\/978-3-030-84242-0_19"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Amos, R., Georgiou, M., Kiayias, A., Zhandry, M.: One-shot signatures and applications to hybrid quantum\/classical authentication. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 255\u2013268 (2020)","DOI":"10.1145\/3357713.3384304"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-662-48000-7_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Ananth","year":"2015","unstructured":"Ananth, P., Brakerski, Z., Segev, G., Vaikuntanathan, V.: From selective to adaptive security in functional encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 657\u2013677. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_32"},{"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","doi-asserted-by":"publisher","unstructured":"Barnum, H., Crepeau, C., Gottesman, D., Smith, A., Tapp, A.: Authentication of quantum messages. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (2002). https:\/\/doi.org\/10.1109\/sfcs.2002.1181969","DOI":"10.1109\/sfcs.2002.1181969"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-030-17659-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"J Bartusek","year":"2019","unstructured":"Bartusek, J., Lepoint, T., Ma, F., Zhandry, M.: New techniques for obfuscating conjunctions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 636\u2013666. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_22"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16"},{"key":"11_CR11","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":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-64381-2_4","volume-title":"Theory of Cryptography","author":"A Broadbent","year":"2020","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"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Jeffery, S., Lord, S., Podder, S., Sundaram, A.: Secure software leasing without assumptions (2021)","DOI":"10.1007\/978-3-030-90459-3_4"},{"key":"11_CR14","unstructured":"Broadbent, A., Lord, S.: Uncloneable quantum encryption via Oracles. In: TQC (2020)"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Bru\u00df, D., Cinchetti, M., Mauro D\u2019Ariano, G., Macchiavello, C.: Phase-covariant quantum cloning. Phys. Rev. A 62(1) (2000). https:\/\/doi.org\/10.1103\/physreva.62.012302","DOI":"10.1103\/physreva.62.012302"},{"key":"11_CR16","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_CR17","unstructured":"Coladangelo, A., Majenz, C., Poremba, A.: Quantum copy-protection of compute-and-compare programs in the Quantum Random Oracle model. arXiv preprint arXiv:2009.13865 (2020)"},{"key":"11_CR18","unstructured":"Georgiou, M., Zhandry, M.: Unclonable decryption keys. IACR Cryptol. ePrint Arch. 877(2020), 3 (2020)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Gisin, N., Massar, S.: Optimal quantum cloning machines. Phys. Rev. Lett. 79, 2153\u20132156 (1997)","DOI":"10.1103\/PhysRevLett.79.2153"},{"key":"11_CR20","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press (2007)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-32009-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S Gorbunov","year":"2012","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption with bounded collusions via multi-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 162\u2013179. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_11"},{"key":"11_CR22","unstructured":"Gottesman, D.: Uncloneable encryption. arXiv preprint quant-ph\/0210062 (2002)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-662-53015-3_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"B Hemenway","year":"2016","unstructured":"Hemenway, B., Jafargholi, Z., Ostrovsky, R., Scafuro, A., Wichs, D.: Adaptively secure garbled circuits from one-way functions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 149\u2013178. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_6"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication (2021)","DOI":"10.1007\/978-3-030-92062-3_21"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Nishimaki, R., Yamakawa, T.: Secure software leasing from standard assumptions. arXiv preprint arXiv:2010.11186 (2020)","DOI":"10.1007\/978-3-030-90459-3_2"},{"key":"11_CR26","unstructured":"Majenz, C., Schaffner, C., Tahmasbi, M.: Limitations on uncloneable encryption and simultaneous one-way-to-hiding. Cryptology ePrint Archive, Report 2021\/408 (2021). https:\/\/eprint.iacr.org\/2021\/408"},{"key":"11_CR27","unstructured":"Nielsen, M.A.: The entanglement fidelity and quantum error correction. arXiv e-prints quant-ph\/9606012 (1996)"},{"key":"11_CR28","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. IACR Cryptol. ePrint Arch. 2010, 556 (2010)"},{"issue":"6","key":"11_CR29","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 34 (2009)","journal-title":"J. ACM (JACM)"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Sahai, A., Seyalioglu, H.: Worry-free encryption: functional encryption with public keys. In: Proceedings of the 17th ACM conference on Computer and communications security, pp. 463\u2013472. ACM (2010)","DOI":"10.1145\/1866307.1866359"},{"issue":"10","key":"11_CR32","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/15\/10\/103002","volume":"15","author":"M Tomamichel","year":"2013","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)","journal-title":"New J. Phys."},{"issue":"1","key":"11_CR33","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. ACM SIGACT News 15(1), 78\u201388 (1983)","journal-title":"ACM SIGACT News"},{"issue":"7","key":"11_CR34","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. Theor. 45(7), 2481\u20132485 (1999)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"5886","key":"11_CR35","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","journal-title":"Nature"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-030-17659-4_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Zhandry","year":"2019","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"}],"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-030-90459-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T00:03:57Z","timestamp":1730765037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90459-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904586","9783030904593"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90459-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","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":"Raleigh, NC","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2021\/","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":"Websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","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":"66","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":"41% - 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":"4","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":"16","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)"}}]}}