{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:40:38Z","timestamp":1771479638941,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030842413","type":"print"},{"value":"9783030842420","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-84242-0_20","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:04:26Z","timestamp":1628636666000},"page":"556-584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["Hidden Cosets and Applications to Unclonable Cryptography"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Coladangelo","sequence":"first","affiliation":[]},{"given":"Jiahui","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qipeng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S.: Limitations of quantum advice and one-way communication. In: Theory of Computing, vol. 1, no. 1, pp. 1\u201328 (2005). https:\/\/doi.org\/10.4086\/toc.2005.v001a001","DOI":"10.4086\/toc.2005.v001a001"},{"key":"20_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":"20_CR3","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 41\u201360. ACM (2012)","DOI":"10.1145\/2213977.2213983"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Liu, J., Zhandry, M., Zhang, R., Liu, Q.: New approaches for quantum copy-protection (2020)","DOI":"10.1007\/978-3-030-84242-0_19"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Ananth, P., La Placa, R.L.: Secure Software Leasing (2021)","DOI":"10.1007\/978-3-030-77886-6_17"},{"key":"20_CR6","unstructured":"Bennett, C.H., Brassard, G.: Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing (1984)"},{"key":"20_CR7","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Factoring and pairings are not necessary for iO: circular-secure LWE suffices. Cryptology ePrint Archive, Report 2020\/1024 (2020). https:\/\/eprint.iacr.org\/2020\/1024"},{"key":"20_CR8","unstructured":"Bartusek, J., Guan, J., Ma, F., Zhandry, M.: Preventing zeroizing attacks on GGH15. In: Proceedings of TCC 2018 (2018)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Jeffery, S., Lord, S., Podder, S., Sundaram, A.: Secure software leasing without assumptions (2021). arXiv: 2101.12739 [quant-ph]","DOI":"10.1007\/978-3-030-90459-3_4"},{"key":"20_CR10","unstructured":"Broadbent, A., Lord, S.: Uncloneable quantum encryption via random oracles. In: IACR Cryptology ePrint Archive 2019, p. 257 (2019)"},{"key":"20_CR11","unstructured":"Ben-David, S., Sattath, O.: Quantum tokens for digital signatures. arXiv preprint arXiv:1609.09047 (2016)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"20_CR13","unstructured":"Coladangelo, A., Majenz, C., Poremba, A.: Quantum copy-protection of compute-and-compare programs in the quantum random oracle model (2020). arXiv: 2009.13865 [quant-ph]"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Farhi, E., Gosset, D., Hassidim, A., Lutomirski, A., Shor, P.: Quantum money from knots. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 276\u2013289 (2012)","DOI":"10.1145\/2090236.2090260"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1007\/s00453-017-0276-6","volume":"79","author":"S Garg","year":"2017","unstructured":"Garg, S., Gentry, C., Halevi, S., Wichs, D.: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. Algorithmica 79(4), 1353\u20131373 (2017)","journal-title":"Algorithmica"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986). ISSN: 0004\u20135411, https:\/\/doi.org\/10.1145\/6490.6503","DOI":"10.1145\/6490.6503"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 612\u2013621. IEEE (2017)","DOI":"10.1109\/FOCS.2017.62"},{"key":"20_CR18","unstructured":"Gottesman, D.: Uncloneable encryption. arXiv preprint quant-ph\/0210062 (2002)"},{"key":"20_CR19","unstructured":"Georgiou, M., Zhandry, M.: Unclonable Decryption Keys. Cryptology ePrint Archive, Report 2020\/877 (2020). https:\/\/eprint.iacr.org\/2020\/877"},{"key":"20_CR20","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. Cryptology ePrint Archive, Report 2020\/1003 (2020). https:\/\/eprint.iacr.org\/2020\/1003"},{"key":"20_CR21","unstructured":"Kane, D.: Quantum money from modular forms (2018). arXiv preprint arXiv:1809.05925"},{"key":"20_CR22","unstructured":"Kitagawa, F., Nishimaki, R., Yamakawa, T.: Secure Software Leasing from Standard Assumptions (2020). arXiv: 2010. 11186 [quant-ph]"},{"key":"20_CR23","unstructured":"Lutomirski, A.: An online attack against Wiesner\u2019s quantum money (2010). In: arXiv preprint arXiv:1010.0256"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 475\u2013484 (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"20_CR25","doi-asserted-by":"crossref","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)","DOI":"10.1088\/1367-2630\/15\/10\/103002"},{"issue":"1","key":"20_CR26","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"},{"key":"20_CR27","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. Cryptology ePrint Archive, Report 2020\/1042 (2020). https:\/\/eprint.iacr.org\/2020\/1042"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and compare programs under LWE. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 600\u2013611. IEEE (2017)","DOI":"10.1109\/FOCS.2017.61"},{"key":"20_CR29","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"},{"issue":"3","key":"20_CR30","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s00145-018-9289-9","volume":"32","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: The magic of ELFs. J. Cryptol. 32(3), 825\u2013866 (2019)","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84242-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:05:28Z","timestamp":1723334728000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84242-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842413","9783030842420"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84242-0_20","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":"11 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","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":"426","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":"103","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":"24% - 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":"20.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":"1 invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","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"}]}}