{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:48:54Z","timestamp":1780498134385,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683930","type":"print"},{"value":"9783031683947","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68394-7_7","type":"book-chapter","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T09:02:27Z","timestamp":1723885347000},"page":"184-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Secret Sharing with\u00a0Certified Deletion"],"prefix":"10.1007","author":[{"given":"James","family":"Bartusek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Justin","family":"Raizes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,18]]},"reference":[{"key":"7_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-031-30545-0_13","volume-title":"EUROCRYPT 2023, Part I","author":"A Agarwal","year":"2023","unstructured":"Agarwal, A., Bartusek, J., Khurana, D., Kumar, N.: A new framework for quantum oblivious transfer. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 363\u2013394. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_13"},{"key":"7_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-17659-4_15","volume-title":"EUROCRYPT 2019, Part III","author":"B Applebaum","year":"2019","unstructured":"Applebaum, B., Beimel, A., Farr\u00e0s, O., Nir, O., Peter, N.: Secret-sharing schemes for general and uniform access structures. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 441\u2013471. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_15"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Goyal, V., Khurana, D., Malavolta, G., Raizes, J., Roberts, B.: Software with certified deletion. In: Eurocrypt 2024 (2024, to appear)","DOI":"10.1007\/978-3-031-58737-5_4"},{"key":"7_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-031-38554-4_7","volume-title":"CRYPTO 2023, Part V","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, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_7"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-031-48624-1_7","volume-title":"Theory of Cryptography","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., Wee, H. (eds.) Theory of Cryptography, vol. 14372, pp. 183\u2013197. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_7"},{"key":"7_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-031-38554-4_4","volume-title":"CRYPTO 2023, Part V","author":"J Bartusek","year":"2023","unstructured":"Bartusek, J., Khurana, D., Poremba, A.: Publicly-verifiable deletion via target-collapsing functions. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 99\u2013128. Springer, Heidelberg (2023)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., et al. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"7_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"CRYPTO\u201988","author":"Josh Cohen Benaloh and Jerry Leichter","year":"1990","unstructured":"Josh Cohen Benaloh and Jerry Leichter: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO\u201988. LNCS, vol. 403, pp. 27\u201335. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313\u2013318 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-642-14623-7_39","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"NJ Bouman","year":"2010","unstructured":"Bouman, N.J., Fehr, S.: Sampling in a quantum population, and applications. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 724\u2013741. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_39"},{"key":"7_CR11","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_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-03356-8_24","volume-title":"CRYPTO 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Fehr, S., Lunemann, C., Salvail, L., Schaffner, C.: Improving the security of quantum protocols via commit-and-open. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 408\u2013427. Springer, Heidelberg (2009)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Hiroka, T., Kitagawa, F., Morimae, T., Nishimaki, R., Pal, T., Yamakawa, T.: Certified everlasting secure collusion-resistant functional encryption, and more. In: Eurocrypt 2024 (2024, to appear)","DOI":"10.1007\/978-3-031-58734-4_15"},{"key":"7_CR15","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, Part I. LNCS, vol. 13090, pp. 606\u2013636. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_21"},{"key":"7_CR16","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, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_9"},{"key":"7_CR17","unstructured":"Ito,M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proceedings of the IEEE Global Telecommunication Conference (Globecom\u201987), pp. 99\u2013102 (1987)"},{"key":"7_CR18","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":"7_CR19","doi-asserted-by":"crossref","unstructured":"Liu, T., Vaikuntanathan, V.: Breaking the circuit-size barrier in secret sharing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, page 699-708, New York, NY, USA, 2018. Association for Computing Machinery (2018)","DOI":"10.1145\/3188745.3188936"},{"key":"7_CR20","unstructured":"Poremba, A.: Quantum proofs of deletion for learning with errors. In: Tauman Kalai, Y. (ed.) 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), volume 251 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 90:1\u201390:14, Dagstuhl, Germany (2023). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-30576-7_22","volume-title":"Theory of Cryptography","author":"R Renner","year":"2005","unstructured":"Renner, R., K\u00f6nig, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 407\u2013425. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_22"},{"issue":"11","key":"7_CR23","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68394-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T09:03:14Z","timestamp":1723885394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68394-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683930","9783031683947"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68394-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 August 2024","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":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","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":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}