{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T16:34:58Z","timestamp":1776184498092,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486173","type":"print"},{"value":"9783031486180","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-48618-0_12","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T17:02:02Z","timestamp":1701018122000},"page":"337-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Proactive Secret Sharing with\u00a0Constant Communication"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4344-7406","authenticated-orcid":false,"given":"Brett Hemenway","family":"Falk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9449-159X","authenticated-orcid":false,"given":"Daniel","family":"Noble","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1386-605X","authenticated-orcid":false,"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-662-44371-2_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"M Abdalla","year":"2014","unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A., Paterson, K.G.: Related-key security for pseudorandom functions beyond the linear barrier. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 77\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_5"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-642-14623-7_36","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"M Bellare","year":"2010","unstructured":"Bellare, M., Cash, D.: Pseudorandom functions and permutations provably secure against related-key attacks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 666\u2013684. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_36"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-319-28166-7_2","volume-title":"Applied Cryptography and Network Security","author":"J Baron","year":"2015","unstructured":"Baron, J., Defrawy, K.E., Lampkins, J., Ostrovsky, R.: Communication-optimal proactive secret sharing for dynamic groups. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 23\u201341. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_2"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Baron, J., Defrawy, K.E., Lampkins, J., Ostrovsky, R.: How to withstand mobile virus attacks, revisited. In: PODC, pp. 293\u2013302 (2014)","DOI":"10.1145\/2611462.2611474"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Barak, B., Herzberg, A., Naor, D., Shai, E.: The proactive security toolkit and applications. In: CCS, pp. 18\u201327 (1999)","DOI":"10.1145\/319709.319713"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/3-540-48658-5_38","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"R Canetti","year":"1994","unstructured":"Canetti, R., Herzberg, A.: Maintaining security in the presence of transient faults. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 425\u2013438. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_38"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Halevi, S., Herzberg, A.: Maintaining authenticated communication in the presence of break-ins. In: PODC, pp. 15\u201324 (1997)","DOI":"10.1145\/259380.259411"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255\u2013271. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_16"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: CCS, pp. 88\u201397 (2002)","DOI":"10.1145\/586110.586124"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, M.B.: Ramanujan graphs in polynomial time. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 276\u2013281. IEEE (2016)","DOI":"10.1109\/FOCS.2016.37"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-57808-4_1","volume-title":"Applied Cryptography and Network Security","author":"K Eldefrawy","year":"2020","unstructured":"Eldefrawy, K., Lepoint, T., Leroux, A.: Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 3\u201323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_1"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS, pp. 427\u2013438. IEEE (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal-resilience proactive public-key cryptosystems. In: FOCS, pp. 384\u2013393. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646127"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: PODC, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"key":"12_CR15","first-page":"593","volume":"226","author":"WH Haemers","year":"1995","unstructured":"Haemers, W.H.: Interlacing Eigenvalues and graphs. Appl. Cryptography Network Secur. 226, 593\u2013616 (1995)","journal-title":"Appl. Cryptography Network Secur."},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"A Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339\u2013352. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_27"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s12095-017-0215-z","volume":"10","author":"B Hemenway","year":"2018","unstructured":"Hemenway, B., Ostrovsky, R.: Efficient robust secret sharing from expander graphs. Cryptogr. Commun. 10(1), 79\u201399 (2018)","journal-title":"Cryptogr. Commun."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"McKeen, F., et al.: Intel\u00ae software guard extensions (Intel\u00ae SGX) support for dynamic memory management inside an enclave. In: Proceedings of the Hardware and Architectural Support for Security and Privacy 2016, pp. 1\u20139 (2016)","DOI":"10.1145\/2948618.2954331"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Marcus, A., Spielman, D.A., Srivastava, N.: Interlacing families I: bipartite Ramanujan graphs of all degrees. In: FOCS, pp. 529\u2013537. IEEE (2013)","DOI":"10.1109\/FOCS.2013.63"},{"issue":"6","key":"12_CR20","doi-asserted-by":"publisher","first-page":"2488","DOI":"10.1137\/16M106176X","volume":"47","author":"AW Marcus","year":"2018","unstructured":"Marcus, A.W., Spielman, D.A., Srivastava, N.: Interlacing families IV: bipartite Ramanujan graphs of all sizes. SIAM J. Comput. 47(6), 2488\u20132509 (2018)","journal-title":"SIAM J. Comput."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Maram, S.K.D., et al.: CHURP: dynamic-committee proactive secret sharing. In: CCS, pp. 2369\u20132386 (2019)","DOI":"10.1145\/3319535.3363203"},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(91)90112-F","volume":"91","author":"A Nilli","year":"1991","unstructured":"Nilli, A.: On the second eigenvalue of a graph. Discret. Math. 91(2), 207\u2013210 (1991)","journal-title":"Discret. Math."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: PODC, pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"key":"12_CR24","unstructured":"Paredes, P.: On the Expansion of Graphs. Ph.D. thesis, Princeton (2021)"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"T Rabin","year":"1998","unstructured":"Rabin, T.: A simplified approach to threshold and proactive RSA. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 89\u2013104. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055722"},{"issue":"11","key":"12_CR26","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. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1880022.1880028","volume":"13","author":"D Schultz","year":"2010","unstructured":"Schultz, D., Liskov, B., Liskov, M.: MPSS: mobile proactive secret sharing. TISSEC 13(4), 1\u201332 (2010)","journal-title":"TISSEC"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Vadhan, S.: Pseudorandomness, vol. 7. Now Delft (2012)","DOI":"10.1561\/9781601985958"},{"key":"12_CR29","unstructured":"Yan, Y., Xia, Y., Devadas, S.: Shanrang: fully asynchronous proactive secret sharing with dynamic committees. IACR ePrint 2022\/164 (2022)"},{"issue":"3","key":"12_CR30","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/1085126.1085127","volume":"8","author":"L Zhou","year":"2005","unstructured":"Zhou, L., Schneider, F.B., Van Renesse, R.: APSS: proactive secret sharing in asynchronous systems. TISSEC 8(3), 259\u2013286 (2005)","journal-title":"TISSEC"}],"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-48618-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:02:40Z","timestamp":1764118960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48618-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486173","9783031486180"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48618-0_12","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"}]}}