{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:49:46Z","timestamp":1778215786892,"version":"3.51.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780196","type":"print"},{"value":"9783031780202","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:00:00Z","timestamp":1732924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:00:00Z","timestamp":1732924800000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78020-2_9","type":"book-chapter","created":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T09:38:35Z","timestamp":1732959515000},"page":"257-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Key-Revocable Dual-Regev Encryption, Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5387-5730","authenticated-orcid":false,"given":"Prabhanjan","family":"Ananth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7005-9220","authenticated-orcid":false,"given":"Zihan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4191-8809","authenticated-orcid":false,"given":"Zikuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,30]]},"reference":[{"key":"9_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)","DOI":"10.1109\/CCC.2009.42"},{"key":"9_CR2","unstructured":"Aaronson, S.: The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes (2016). arXiv:1607.05256 [quant-ph]"},{"key":"9_CR3","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":"9_CR4","unstructured":"Ananth, P., Hu, Z., Huang, Z.: Quantum key- revocable dual-regev encryption, revisited. Cryptology ePrint Archive, Paper 2024\/738 (2024). https:\/\/eprint.iacr.org\/2024\/738"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Kitagawa, F., Nishimaki, R., Yamada, S., Yamakawa, T.: Public key encryption with secure key leasing. arXiv preprint arXiv:2302.11663 (2023)","DOI":"10.1007\/978-3-031-30545-0_20"},{"key":"9_CR6","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":"9_CR7","doi-asserted-by":"publisher","unstructured":"Ananth, P., Poremba, A., Vaikuntanathan, V.: Revocable cryptography from learning with errors. In: Rothblum, G., Wee, H. (eds) TTCC 2023, Part IV. LNCS, vol. 14372, pp. 93\u2013122. Springer, Cham (2023). ISBN 978-3-031-48623-4. https:\/\/doi.org\/10.1007\/978-3-031-48624-1_4","DOI":"10.1007\/978-3-031-48624-1_4"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen 296(4), 625\u2013636 (1993). http:\/\/eudml.org\/doc\/165105","DOI":"10.1007\/BF01445125"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U., Vidick, T.: A cryptographic test of quantumness and certifiable randomness from a single quantum device (2021). arXiv:1804.00640 [quant-ph]","DOI":"10.1145\/3441309"},{"key":"9_CR10","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Factoring and pairings are not necessary for IO: circularsecure LWE suffices. Cryptology ePrint Archive (2020)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30"},{"key":"9_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":"9_CR13","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Khurana, D.: Cryptography with certified deletion (2022). https:\/\/doi.org\/10.48550\/ARXIV.2207.01754, https:\/\/arxiv.org\/abs\/2207.01754","DOI":"10.48550\/ARXIV.2207.01754"},{"key":"9_CR14","doi-asserted-by":"publisher","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), vol. 158. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl\u2013 Leibniz-Zentrum f\u00fcr Informatik, pp. 4:1\u20134:22 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2020.4","DOI":"10.4230\/LIPIcs.TQC.2020.4"},{"key":"9_CR15","unstructured":"Chardouvelis, O., Goyal, V., Jain, A., Liu, J.: Quantum key leasing for PKE and FHE with a classical lessor. arXiv preprint arXiv:2310.14328 (2023)"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Public-key encryption schemes with auxiliary inputs. In: Micciancio, D. (eds.) TCC 2010. LNCS, vol. 5978, pp. 361\u2013381. Springer, Cham (2010). ISBN 978-3-642-11799-2. https:\/\/doi.org\/10.1007\/978-3-642-11799-2_22","DOI":"10.1007\/978-3-642-11799-2_22"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Dieks, D.G.B.J.:Communication by EPR devices. Phys. Lett. A 92(6), 271\u2013272 (1982)","DOI":"10.1016\/0375-9601(82)90084-6"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Gao, J.: Quantum union bounds for sequential projective measurements. Phys. Rev. A 92(5), 052331 (2015)","DOI":"10.1103\/PhysRevA.92.052331"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"9_CR20","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). arXiv: 2105.05393 [quant-ph]","DOI":"10.1007\/978-3-030-92062-3_21"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-031-30545-0_21","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"J Liu","year":"2023","unstructured":"Liu, J., Montgomery, H., Zhandry, M.: Another round of breaking and making quantum money: how to not build it from lattices, and more. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14004, pp. 611\u2013638. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_21"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. In: Thorup, M. (ed.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 332\u2013338. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00039","DOI":"10.1109\/FOCS.2018.00039"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Marriott, C., Watrous, J.: Quantum Arthur-Merlin Games (2005). arXiv: cs\/0506068 [cs.CC]","DOI":"10.1007\/s00037-005-0194-x"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Poremba, A.: Quantum proofs of deletion for learning with errors (2022). https:\/\/doi.org\/10.48550\/ARXIV.2203.01610","DOI":"10.48550\/ARXIV.2203.01610"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-57990-6_10","volume-title":"Security and Cryptography for Networks","author":"W Quach","year":"2020","unstructured":"Quach, W.: UC-secure OT from LWE, revisited. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 192\u2013211. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_10"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","DOI":"10.1038\/299802a0"},{"key":"9_CR27","unstructured":"Zhandry, M.: Schr\u00f6dinger\u2019s pirate: how to trace a quantum decoder. Cryptology ePrint Archive, Paper 2020\/1191. https:\/\/eprint.iacr.org\/2020\/1191.2020"}],"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-78020-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T10:03:07Z","timestamp":1732960987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78020-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,30]]},"ISBN":["9783031780196","9783031780202"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78020-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,30]]},"assertion":[{"value":"30 November 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}