MPSS: Mobile Proactive Secret Sharing

Download: pdf.

MPSS: Mobile Proactive Secret Sharing” by David Schultz, Barbara Liskov, and Moses Liskov. ACM Transactions on Information and System Security (TISSEC), vol. 13, Dec. 2010, ACM.


This article describes MPSS, a new way to do proactive secret sharing. MPSS provides mobility: 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.

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.

Download: pdf.

BibTeX entry:

   author = {David Schultz and Barbara Liskov and Moses Liskov},
   title = {MPSS: Mobile Proactive Secret Sharing},
   journal = {ACM Transactions on Information and System Security (TISSEC)},
   volume = {13},
   publisher = {ACM},
   address = {New York, NY, USA},
   month = dec,
   year = {2010},
   issn = {1094-9224},
   url = {}

Also see all authors, all publications by date, and all publications by topic.

Programming Methodology Group