{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:51Z","timestamp":1765113051972,"version":"3.40.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911309","type":"print"},{"value":"9783031911316","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-91131-6_10","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T14:29:46Z","timestamp":1745764186000},"page":"278-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Secret Sharing with\u00a0Publicly Verifiable Deletion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1137-9517","authenticated-orcid":false,"given":"Ben","family":"Sela","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"10_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-031-58737-5_4","volume-title":"Advances in Cryptology","author":"J Bartusek","year":"2024","unstructured":"Bartusek, J., Goyal, V., Khurana, D., Malavolta, G., Raizes, J., Roberts, B.: Software with certified deletion. In: Joye, M., Leander, G. (eds.) Eurocrypt 2024, Part\u00a0IV. LNCS, vol. 14654, pp. 85\u2013111. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58737-5_4"},{"key":"10_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-031-38554-4_7","volume-title":"Advances in Cryptology","author":"J Bartusek","year":"2023","unstructured":"Bartusek, J., Khurana, D.: Cryptography with certified deletion. In: Handschuh, H., Lysyanskaya, A. (eds.) Crypto 2023, Part V. LNCS, vol. 14085, pp. 192\u2013223. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_7"},{"key":"10_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-031-48624-1_7","volume-title":"TCC 2023, Part IV","author":"J Bartusek","year":"2023","unstructured":"Bartusek, J., Khurana, D., Malavolta, G., Poremba, A., Walter, M.: Weakening assumptions for publicly-verifiable deletion. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023, Part IV. LNCS, vol. 14372, pp. 183\u2013197. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_7"},{"key":"10_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-031-68394-7_7","volume-title":"Advances in Cryptology","author":"J Bartusek","year":"2024","unstructured":"Bartusek, J., Raizes, J.: Secret sharing with certified deletion. In: Reyzin, L., Stebila, D. (eds.) Crypto 2024, Part VII. LNCS, vol. 14926, pp. 184\u2013214. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_7"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"J Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3"},{"key":"10_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":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-030-84252-9_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"N Chandran","year":"2021","unstructured":"Chandran, N., Kanukurthi, B., Obbattu, S., Sekar, S.: Adaptive extractors and their application to leakage resilient secret sharing. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 595\u2013624. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_20"},{"key":"10_CR8","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":"10_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-031-58734-4_15","volume-title":"Advances in Cryptology","author":"T Hiroka","year":"2024","unstructured":"Hiroka, T., Kitagawa, F., Morimae, T., Nishimaki, R., Pal, T., Yamakawa, T.: Certified everlasting secure collusion-resistant functional encryption, and more. In: Joye, M., Leander, G. (eds.) Eurocrypt 2024, Part III. LNCS, vol. 14653, pp. 434\u2013456. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58734-4_15"},{"key":"10_CR10","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":"10_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-031-15802-5_9","volume-title":"Advances in Cryptology","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). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_9"},{"key":"10_CR12","unstructured":"Katz, J., Sela, B.: Secret sharing with publicly verifiable deletion. Cryptology ePrint Archive, Paper 2024\/1596 (2024). https:\/\/eprint.iacr.org\/2024\/1596"},{"key":"10_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-031-48624-1_9","volume-title":"TCC 2023, Part IV","author":"F Kitagawa","year":"2023","unstructured":"Kitagawa, F., Nishimaki, R., Yamakawa, T.: Publicly verifiable deletion from minimal assumptions. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023, Part IV. LNCS, vol. 14372, pp. 228\u2013245. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_9"},{"key":"10_CR14","unstructured":"Poremba, A.: Quantum proofs of deletion for learning with errors. Cryptology ePrint Archive, Report 2022\/295 (2022). https:\/\/eprint.iacr.org\/2022\/295"},{"issue":"11","key":"10_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Comm. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Comm. ACM"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-55220-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Unruh","year":"2014","unstructured":"Unruh, D.: Revocable quantum timed-release encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 129\u2013146. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_8"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: Umans, C. (ed.) 58th Annual Symposium on Foundations of Computer Science, pp. 600\u2013611. IEEE Computer Society Press, Berkeley, CA, USA, 15\u201317 October 2017. https:\/\/doi.org\/10.1109\/FOCS.2017.61","DOI":"10.1109\/FOCS.2017.61"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78\u201388 (1983). https:\/\/doi.org\/10.1145\/1008908.1008920","journal-title":"SIGACT News"},{"issue":"7","key":"10_CR19","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. Theory 45(7), 2481\u20132485 (1999). https:\/\/doi.org\/10.1109\/18.796385","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to construct quantum random functions. In: 53rd Annual Symposium on Foundations of Computer Science, pp. 679\u2013687. IEEE Computer Society Press, New Brunswick, NJ, USA, 20\u201323 October 2012. https:\/\/doi.org\/10.1109\/FOCS.2012.37","DOI":"10.1109\/FOCS.2012.37"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91131-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T14:29:51Z","timestamp":1745764191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91131-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911309","9783031911316"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91131-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}