{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:39:55Z","timestamp":1780497595244,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229718","type":"print"},{"value":"9783031229725","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-22972-5_20","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:35:48Z","timestamp":1674560148000},"page":"569-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Functional Encryption with\u00a0Secure Key Leasing"],"prefix":"10.1007","author":[{"given":"Fuyuki","family":"Kitagawa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","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 (2009)","DOI":"10.1109\/CCC.2009.42"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Ananth, P., Brakerski, Z., Segev, G., Vaikuntanathan, V.: From selective to adaptive security in functional encryption. In: CRYPTO 2015, Part II, pp. 657\u2013677 (2015)","DOI":"10.1007\/978-3-662-48000-7_32"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Lin, H., Matt, C., Sahai, A.: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification. In: CRYPTO 2019, Part III, pp. 284\u2013332 (2019)","DOI":"10.1007\/978-3-030-26954-8_10"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Ananth, P., La Placa, R.L.: Secure software leasing. In: EUROCRYPT 2021, Part II, pp. 501\u2013530 (2021)","DOI":"10.1007\/978-3-030-77886-6_17"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Liu, J., Liu, Q., Zhandry, M., Zhang. R.: New approaches for quantum copy-protection. In: CRYPTO 2021, Part I, pp. 526\u2013555, Virtual Event (2021)","DOI":"10.1007\/978-3-030-84242-0_19"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Maitra, M., Vempati, N.S., Yamada, S.: Functional encryption for turing machines with dynamic bounded collusion from LWE. In: CRYPTO 2021, Part IV, pp. 239\u2013269, Virtual Event (2021)","DOI":"10.1007\/978-3-030-84259-8_9"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Ananth, P., Vaikuntanathan, V.: Optimal bounded-collusion secure functional encryption. In: TCC 2019, Part I, pp. 174\u2013198 (2019)","DOI":"10.1007\/978-3-030-36030-6_8"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Islam, R.: Quantum encryption with certified deletion. In: TCC 2020, Part III, pp. 92\u2013122 (2020)","DOI":"10.1007\/978-3-030-64381-2_4"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Jeffery, S., Lord, S., Podder, S., Sundaram, A.: Secure software leasing without assumptions. In:: TCC 2021, Part I, pp. 90\u2013120 (2021)","DOI":"10.1007\/978-3-030-90459-3_4"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00145-019-09337-9","volume":"33","author":"N Bitansky","year":"2020","unstructured":"Bitansky, N., Nishimaki, R., Passel\u00e8gue, A., Wichs, D.: From Cryptomania to Obfustopia through secret-key functional encryption. J. Cryptol. 33(2), 357\u2013405 (2020)","journal-title":"J. Cryptol."},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00145-017-9255-y","volume":"31","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z., Segev, G.: Function-private functional encryption in the private-key setting. J. Cryptol. 31(1), 202\u2013225 (2018)","journal-title":"J. Cryptol."},{"key":"20_CR12","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":"20_CR13","doi-asserted-by":"crossref","unstructured":"Ciampi, M., Goyal, V., Ostrovsky. R.: Threshold garbled circuits and ad hoc secure computation. In: EUROCRYPT 2021, Part III, pp. 64\u201393 (2021)","DOI":"10.1007\/978-3-030-77883-5_3"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Coladangelo, A., Liu, J., Liu, Q., Zhandry. M.: Hidden Cosets and applications to unclonable cryptography. In: CRYPTO 2021, Part I, pp. 556\u2013584, Virtual Event (2021)","DOI":"10.1007\/978-3-030-84242-0_20"},{"key":"20_CR15","unstructured":"Coladangelo, A., Majenz, C., Poremba. A.: Quantum copy-protection of compute-and-compare programs in the quantum random oracle model. Cryptology ePrint Archive, Report 2020\/1194 (2020). https:\/\/eprint.iacr.org\/2020\/1194"},{"key":"20_CR16","unstructured":"Connor, R.J., Schuchard, M.: Blind Bernoulli trials: a noninteractive protocol for hidden-weight coin flips. In: USENIX Security, pp. 1483\u20131500 (2019)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Culf, E., Vidick, T.: A monogamy-of-entanglement game for subspace Coset states. arXiv (CoRR), abs\/2107.13324 (2021)","DOI":"10.22331\/q-2022-09-01-791"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"De Caro, A., Iovino, V., Jain, A., O\u2019Neill, A., Paneth, O., Persiano, G.: On the achievability of simulation-based security for functional encryption. In: CRYPTO 2013, Part II, pp. 519\u2013535 (2013)","DOI":"10.1007\/978-3-642-40084-1_29"},{"key":"20_CR19","unstructured":"Garg, R., Goyal, R., Lu, G., Waters, B.: Dynamic collusion bounded functional encryption from identity-based encryption. Cryptology ePrint Archive, Report 2021\/847 (2021) https:\/\/eprint.iacr.org\/2021\/847"},{"key":"20_CR20","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":"20_CR21","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. In: ASIACRYPT 2021, Part I, pp. 606\u2013636 (2021)","DOI":"10.1007\/978-3-030-92062-3_21"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Jain, A., Korb, A., Manohar, N., Sahai, A.: Amplifying the security of functional encryption, unconditionally. In: CRYPTO 2020, Part I, pp. 717\u2013746 (2020)","DOI":"10.1007\/978-3-030-56784-2_24"},{"key":"20_CR23","first-page":"544","volume":"18","author":"S Kim","year":"2018","unstructured":"Kim, S., Lewi, K., Mandal, A., Montgomery, H., Roy, A., Wu, D.J.: Function-hiding inner product encryption is practical. In SCN 18, 544\u2013562 (2018)","journal-title":"In SCN"},{"issue":"3","key":"20_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09396-x","volume":"34","author":"F Kitagawa","year":"2021","unstructured":"Kitagawa, F., Nishimaki, R., Tanaka, K.: Simple and generic constructions of succinct functional encryption. J. Cryptol. 34(3), 1\u201346 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09396-x","journal-title":"J. Cryptol."},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Nishimaki, R., Yamakawa, T.: Secure software leasing from standard assumptions. In: TCC 2021, Part I, pp. 31\u201361 (2021)","DOI":"10.1007\/978-3-030-90459-3_2"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Mukherjee, P., Wichs, D.: Two round multiparty computation via multi-key FHE. In: EUROCRYPT 2016, Part II, pp. 735\u2013763 (2016)","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. In: FC , pp. 1\u201320 (2001)","DOI":"10.1007\/3-540-45472-1_1"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Nishimaki, R., Wichs, D., Zhandry, M.: Anonymous traitor tracing: how to embed arbitrary information in a key. In: EUROCRYPT 2016, Part II, pp. 388\u2013419 (2016)","DOI":"10.1007\/978-3-662-49896-5_14"},{"key":"20_CR29","unstructured":"Ryffel, T., Pointcheval, D., Bach, F.R., Dufour-Sans, E., Gay, R.: Partially encrypted deep learning using functional encryption. In: NeurIPS, pp. 4519\u20134530 (2019)"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Sahai, A., Seyalioglu, H.: Worry-free encryption: functional encryption with public keys. In: ACM CCS, pp. 463\u2013472 (2010)","DOI":"10.1145\/1866307.1866359"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-32009-5_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"A Sahai","year":"2012","unstructured":"Sahai, A., Seyalioglu, H., Waters, B.: Dynamic credentials and ciphertext delegation for attribute-based encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 199\u2013217. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_13"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27"},{"issue":"3","key":"20_CR33","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)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22972-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:02:41Z","timestamp":1769216561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22972-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229718","9783031229725"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22972-5_20","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":"25 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"364","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":"98","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":"27% - 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":"10","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"}]}}