{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:02:08Z","timestamp":1764133328314,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578077"},{"type":"electronic","value":"9783030578084"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57808-4_1","type":"book-chapter","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T21:03:47Z","timestamp":1598475827000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Communication-Efficient Proactive Secret Sharing for Dynamic Groups with Dishonest Majorities"],"prefix":"10.1007","author":[{"given":"Karim","family":"Eldefrawy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tancr\u00e8de","family":"Lepoint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonin","family":"Leroux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Backes, M., Cachin, C., Strobl, R.: Proactive secure message transmission in asynchronous networks. In: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, 13\u201316 July 2003, pp. 223\u2013232 (2003). https:\/\/doi.org\/10.1145\/872035.872069. http:\/\/doi.acm.org\/10.1145\/872035.872069","DOI":"10.1145\/872035.872069"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Baron, J., Eldefrawy, K., Lampkins, J., Ostrovsky, R.: How to withstand mobile virus attacks, revisited. In: PODC, pp. 293\u2013302. ACM (2014)","DOI":"10.1145\/2611462.2611474"},{"key":"1_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":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13. http:\/\/dl.acm.org\/citation.cfm?id=1802614.1802632"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-32009-5_39","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"E Ben-Sasson","year":"2012","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-linear unconditionally-secure multiparty computation with a dishonest minority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 663\u2013680. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_39"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS National Computer Conference, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-030-25283-0_19","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2017","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Gennaro, R., Goldfeder, S.: Using level-1 homomorphic encryption to improve threshold DSA signatures for bitcoin wallet security. In: Lange, T., Dunkelman, O. (eds.) LATINCRYPT 2017. LNCS, vol. 11368, pp. 352\u2013377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25283-0_19"},{"key":"1_CR9","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 94","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"},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 11\u201319. ACM, New York (1988). https:\/\/doi.org\/10.1145\/62212.62214. http:\/\/doi.acm.org\/10.1145\/62212.62214","DOI":"10.1145\/62212.62214"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-85174-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 241\u2013261. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_14"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"1_CR15","unstructured":"Desmedt, Y., Jajodia, S.: Redistributing secret shares to new access structures and its applications (1997). Technical Report ISSE TR-97-01, George Mason University"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-44618-9_28","volume-title":"Security and Cryptography for Networks","author":"S Dolev","year":"2016","unstructured":"Dolev, S., Eldefrawy, K., Lampkins, J., Ostrovsky, R., Yung, M.: Proactive secret sharing with a dishonest majority. In: Zikas, V., De Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 529\u2013548. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_28"},{"key":"1_CR17","unstructured":"Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V.: Swarming secrets. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, pp. 1438\u20131445. IEEE Press, Piscataway (2009). http:\/\/dl.acm.org\/citation.cfm?id=1793974.1794220"},{"key":"1_CR18","unstructured":"Dolev, S., Garay, J.A., Gilboa, N., Kolesnikov, V.: Secret sharing Krohn-Rhodes: private and perennial distributed computation. In: ICS (2011)"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Dolev, S., Garay, J.A., Gilboa, N., Yelena Yuditsky, V.K.: Towards efficient private distributed computation on unbounded input streams. J. Math. Cryptol. 9(2), 79\u201394 (2015). https:\/\/doi.org\/10.1515\/jmc-2013-0039","DOI":"10.1515\/jmc-2013-0039"},{"key":"1_CR20","unstructured":"Eldefrawy, K., Lepoint, T., Leroux, A.: Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities. Cryptology ePrint Archive, Report 2019\/1383 (2019). https:\/\/eprint.iacr.org\/2019\/1383"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-98113-0_11","volume-title":"Security and Cryptography for Networks","author":"K Eldefrawy","year":"2018","unstructured":"Eldefrawy, K., Ostrovsky, R., Park, S., Yung, M.: Proactive secure multiparty computation with a dishonest majority. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 200\u2013215. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_11"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October 1997, pp. 384\u2013393. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646127","DOI":"10.1109\/SFCS.1997.646127"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: STOC, pp. 699\u2013710 (1992)","DOI":"10.1145\/129712.129780"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: ACM Conference on Computer and Communications Security, pp. 1179\u20131194. ACM (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"1_CR26","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 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"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-40084-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"M Hirt","year":"2013","unstructured":"Hirt, M., Maurer, U., Lucas, C.: A dynamic tradeoff between active and passive corruptions in secure multi-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 203\u2013219. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_12"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, pp. 1837\u20131854. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3243734.3243788. http:\/\/doi.acm.org\/10.1145\/3243734.3243788","DOI":"10.1145\/3243734.3243788"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: ACM Conference on Computer and Communications Security, pp. 1837\u20131854. ACM (2018)","DOI":"10.1145\/3243734.3243788"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: PODC, pp. 51\u201359. ACM (1991)","DOI":"10.1145\/112600.112605"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO 91","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Schultz, D.: Mobile proactive secret sharing. Ph.D. thesis, Massachusetts Institute of Technology (2007)","DOI":"10.1145\/1400751.1400856"},{"issue":"11","key":"1_CR34","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":"2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T Tassa","year":"2009","unstructured":"Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. J. Cryptol. 22(2), 227\u2013258 (2009)","journal-title":"J. Cryptol."},{"key":"1_CR36","unstructured":"Wong, T.M., Wang, C., Wing, J.M.: Verifiable secret redistribution for archive system. In: IEEE Security in Storage Workshop, pp. 94\u2013106. IEEE Computer Society (2002)"},{"issue":"3","key":"1_CR37","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. ACM Trans. Inf. Syst. Secur. 8(3), 259\u2013286 (2005)","journal-title":"ACM Trans. Inf. Syst. Secur."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57808-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T04:31:19Z","timestamp":1619238679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57808-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030578077","9783030578084"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57808-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/ACNS2020","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"214","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":"46","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":"21% - 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.7","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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to COVID-19 pandemy the confernce was helt virtually.","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)"}}]}}