{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T23:16:06Z","timestamp":1776899766423,"version":"3.51.2"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486234","type":"print"},{"value":"9783031486241","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48624-1_7","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"183-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Weakening Assumptions for\u00a0Publicly-Verifiable Deletion"],"prefix":"10.1007","author":[{"given":"James","family":"Bartusek","sequence":"first","affiliation":[]},{"given":"Dakshita","family":"Khurana","sequence":"additional","affiliation":[]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Poremba","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Walter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-031-30545-0_20","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"S Agrawal","year":"2023","unstructured":"Agrawal, S., Kitagawa, F., Nishimaki, R., Yamada, S., Yamakawa, T.: Public key encryption with secure key leasing. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, vol. 14004, pp. 581\u2013610. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_20"},{"key":"7_CR2","unstructured":"Ananth, P., Poremba, A., Vaikuntanathan, V.: Revocable cryptography from learning with errors. Cryptology ePrint Archive, Paper 2023\/325 (2023). https:\/\/eprint.iacr.org\/2023\/325"},{"key":"7_CR3","unstructured":"Bartusek, J., et al.: Obfuscation and outsourced computation with certified deletion. Cryptology ePrint Archive, Paper 2023\/265 (2023). https:\/\/eprint.iacr.org\/2023\/265"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Khurana, D.: Cryptography with certified deletion. In: Crypto 2023 (2023, to appear)","DOI":"10.1007\/978-3-031-38554-4_7"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Khurana, D., Poremba, A.: Publicly-verifiable deletion via target-collapsing functions. In: Crypto 2023 (2023, to appear)","DOI":"10.1007\/978-3-031-38554-4_4"},{"key":"7_CR6","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":"7_CR7","unstructured":"Dall\u2019Agnol, M., Spooner, N.: On the necessity of collapsing. Cryptology ePrint Archive, Paper 2022\/786 (2022). https:\/\/eprint.iacr.org\/2022\/786"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00145-007-9012-8","volume":"22","author":"I Haitner","year":"2007","unstructured":"Haitner, I., Horvitz, O., Katz, J., Koo, C.-Y., Morselli, R., Shaltiel, R.: Reducing complexity assumptions for\u00a0statistically-hiding commitment. J. Cryptol. 22(3), 283\u2013310 (2007). https:\/\/doi.org\/10.1007\/s00145-007-9012-8","journal-title":"J. Cryptol."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/978-3-030-92062-3_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"T Hiroka","year":"2021","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Quantum encryption with\u00a0certified deletion, revisited: public key, attribute-based, and\u00a0classical communication. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 606\u2013636. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_21"},{"key":"7_CR10","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Certified everlasting functional encryption. Cryptology ePrint Archive, Paper 2022\/969 (2022). https:\/\/eprint.iacr.org\/2022\/969, https:\/\/eprint.iacr.org\/2022\/969"},{"key":"7_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-031-15802-5_9","volume-title":"CRYPTO 2022, Part I","author":"T Hiroka","year":"2022","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Certified everlasting zero-knowledge proof for QMA. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 239\u2013268. Springer, Cham (2022)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-96878-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Z Ji","year":"2018","unstructured":"Ji, Z., Liu, Y.-K., Song, F.: Pseudorandom quantum states. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 126\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_5"},{"key":"7_CR13","unstructured":"Kitagawa, F., Nishimaki, R., Yamakawa, T.: Publicly verifiable deletion from minimal assumptions. Cryptology ePrint Archive, Paper 2023\/538 (2023). https:\/\/eprint.iacr.org\/2023\/538"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.TQC.2021.2, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/13997\/","DOI":"10.4230\/LIPICS.TQC.2021.2"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Kretschmer, W., Qian, L., Sinha, M., Tal, A.: Quantum cryptography in algorithmica. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20\u201323, 2023, pp. 1589\u20131602. ACM (2023). https:\/\/doi.org\/10.1145\/3564246.3585225","DOI":"10.1145\/3564246.3585225"},{"key":"7_CR16","unstructured":"Malavolta, G., Walter, M.: Non-interactive quantum key distribution. Cryptology ePrint Archive, Paper 2023\/500 (2023). https:\/\/eprint.iacr.org\/2023\/500"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 269\u2013295. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Poremba, A.: Quantum proofs of deletion for learning with errors. In: Kalai, Y.T. (ed.) 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10\u201313, 2023, MIT, Cambridge, Massachusetts, USA. LIPIcs, vol. 251, pp. 90:1\u201390:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2023.9","DOI":"10.4230\/LIPIcs.ITCS.2023.9"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Unruh, D.: Revocable quantum timed-release encryption. J. ACM 62(6) (2015). https:\/\/doi.org\/10.1145\/2817206","DOI":"10.1145\/2817206"},{"issue":"7","key":"7_CR20","doi-asserted-by":"publisher","first-page":"2481","DOI":"10.1109\/18.796385","volume":"45","author":"AJ Winter","year":"1999","unstructured":"Winter, A.J.: Coding theorem and strong converse for quantum channels. IEEE Trans. Inf. Theory 45(7), 2481\u20132485 (1999). https:\/\/doi.org\/10.1109\/18.796385","journal-title":"IEEE Trans. Inf. Theory"}],"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-48624-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:02:58Z","timestamp":1764118978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48624-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486234","9783031486241"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48624-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","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":"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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","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":"168","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":"68","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":"40% - 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":"13","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"}]}}