{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T16:34:57Z","timestamp":1776184497215,"version":"3.50.1"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0428107"],"award-info":[{"award-number":["CNS-0428107"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p>\n            This article describes MPSS, a new way to do proactive secret sharing. MPSS provides\n            <jats:italic>mobility<\/jats:italic>\n            : The group of nodes holding the shares of the secret can change at each resharing, which is essential in a long-lived system. MPSS additionally allows the number of tolerated faulty shareholders to change when the secret is moved so that the system can tolerate more (or fewer) corruptions; this allows reconfiguration on-the-fly to accommodate changes in the environment.\n          <\/jats:p>\n          <jats:p>MPSS includes an efficient protocol that is intended to be used in practice. The protocol is optimized for the common case of no or few failures, but degradation when there are more failures is modest. MPSS contains a step in which nodes accuse proposals made by other nodes; we show a novel way to handle these accusations when their verity cannot be known. We also present a way to produce accusations that can be verified without releasing keys of other nodes; verifiable accusations improve the performance of MPSS, and are a useful primitive independent of MPSS.<\/jats:p>","DOI":"10.1145\/1880022.1880028","type":"journal-article","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T14:32:48Z","timestamp":1293633168000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["MPSS"],"prefix":"10.1145","volume":"13","author":[{"given":"David","family":"Schultz","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Barbara","family":"Liskov","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Moses","family":"Liskov","sequence":"additional","affiliation":[{"name":"The MITRE Corporation"}]}],"member":"320","published-online":{"date-parts":[[2010,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586124"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT\u201903)","author":"Canetti R."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_2_1_6_1","unstructured":"Chen K. 2004. Authentication in a reconfigurable byzantine fault tolerant system. Master\u2019s thesis MIT. Chen K. 2004. Authentication in a reconfigurable byzantine fault tolerant system. Master\u2019s thesis MIT."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the USENIX Annual Technical Conference. USENIX.","author":"Cowling J."},{"key":"e_1_2_1_8_1","unstructured":"Desmedt Y. and Jajodia S. 1997. Redistributing secret shares to new access structures and its applications. Tech. rep. ISSE TR-97-01 George Mason University. Desmedt Y. and Jajodia S. 1997. Redistributing secret shares to new access structures and its applications. Tech. rep. ISSE TR-97-01 George Mason University."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/950620.950623"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201997)","author":"Frankel Y."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/266420.266442"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the International Cryptology Conference (CRYPTO\u201995)","author":"Herzberg A."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the IEEE Conference and Exhibition on Global Telecommunications (GlobeCom\u201987)","author":"Ito M."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352617"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/112600.112605"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the International Cryptology Conference (CRYPTO\u201991)","author":"Pedersen T. P.","year":"1991"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/646763.706319"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2010.52"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Schultz D. 2007. Mobile proactive secret sharing. Master\u2019s thesis MIT. Schultz D. 2007. Mobile proactive secret sharing. Master\u2019s thesis MIT.","DOI":"10.1145\/1400751.1400856"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the International IEEE Security in Storage Workshop (SISW\u201902)","author":"Wong T. M."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030130"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1085126.1085127"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880022.1880028","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1880022.1880028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:15Z","timestamp":1750243935000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880022.1880028"}},"subtitle":["Mobile Proactive Secret Sharing"],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1145\/1880022.1880028"],"URL":"https:\/\/doi.org\/10.1145\/1880022.1880028","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]},"assertion":[{"value":"2008-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}