Mobile proactive secret sharing

Authors:
David A. Schultz;Barbara Liskov;Moses Liskov
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA, USA;Massachusetts Institute of Technology, Cambridge, MA, USA;The College of William and Mary, Williamsburg, VA, USA
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 3
Cited 2

Asynchronous verifiable secret sharing and proactive cryptosystems

Proceedings of the 9th ACM conference on Computer and communications security
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
APSS: proactive secret sharing in asynchronous systems

ACM Transactions on Information and System Security (TISSEC)

Design of certification authority using secret redistribution and multicast routing in wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Strong (n,t,n) verifiable secret sharing scheme

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.