ACM Home Page
Please provide us with feedback. Feedback
Mobile proactive secret sharing
Full text PdfPdf (125 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing table of contents
Toronto, Canada
SESSION: B4-2 table of contents
Pages 458-458  
Year of Publication: 2008
ISBN:978-1-59593-989-0
Authors
David A. Schultz  Massachusetts Institute of Technology, Cambridge, MA, USA
Barbara Liskov  Massachusetts Institute of Technology, Cambridge, MA, USA
Moses Liskov  The College of William and Mary, Williamsburg, VA, USA
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 102,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1400751.1400856
What is a DOI?

ABSTRACT

MPSS is a new way to do proactive secret sharing in asynchronous networks. 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.




Collaborative Colleagues:
David A. Schultz: colleagues
Barbara Liskov: colleagues
Moses Liskov: colleagues