skip to main content
research-article

MPSS: Mobile Proactive Secret Sharing

Published: 01 December 2010 Publication History

Abstract

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.

References

[1]
Blakley, G. 1979. Safeguarding cryptographic keys. In Proceedings of the AFIPS Conference. Vol. 48, 313--317.
[2]
Bracha, G. and Toueg, S. 1985. Asynchronous consensus and broadcast protocols. J. ACM 32, 4, 824--240.
[3]
Cachin, C., Kursawe, K., Lysyanskaya, A., and Strobl, R. 2002. Asynchronous verifiable secret sharing and proactive cryptosystems. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’02). 88--97.
[4]
Canetti, R., Halevi, S., and Katz, J. 2003. A forward-secure public-key encryption scheme. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’03). 255--271.
[5]
Castro, M. and Liskov, B. 2002. Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20, 4, 398--461.
[6]
Chen, K. 2004. Authentication in a reconfigurable byzantine fault tolerant system. Master’s thesis, MIT.
[7]
Cowling, J., Ports, D. R. K., Liskov, B., Popa, R. A., and Gaikwad, A. 2009. Census: Location-aware membership management for large-scale distributed systems. In Proceedings of the USENIX Annual Technical Conference. USENIX.
[8]
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.
[9]
Dwork, C., Naor, M., Reingold, O., and Stockmeyer, L. 2003. Magic functions: In memoriam: Bernard m. dwork 1923--1998. J. ACM 50, 6, 852--921.
[10]
Feldman, P. 1987. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC’87). 427--437.
[11]
Frankel, Y., Gemmell, P., MacKenzie, P., and Yung, M. 1997. Optimal resilience proactive public-key cryptosystems. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS’97). 384--393.
[12]
Herzberg, A., Jarecki, S., Krawczyk, H., and Yung, M. 1995. Proactive public key and signature systems. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’97). 100--110.
[13]
Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., and Yung, M. 1997. Proactive secret sharing, or how to cope with perpetual leakage. In Proceedings of the International Cryptology Conference (CRYPTO’95). 457--469.
[14]
Ito, M., Saito, A., and Nishizeki, T. 1987. Secret sharing scheme realizing general access structure. In Proceedings of the IEEE Conference and Exhibition on Global Telecommunications (GlobeCom’87).
[15]
Krawczyk, H. 2000. Simple forward-secure signatures from any signature scheme. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’00).
[16]
Ostrovsky, R. and Yung, M. 1991. How to withstand mobile virus attacks. In Proceedings of the Annual ACM SIGOPS Symposium on Principles of Distributed Computing (PODC’91). 51--61.
[17]
Pedersen, T. P. 1991. Non-interactive and information-theoretic secure verifiable secret sharing. In Proceedings of the International Cryptology Conference (CRYPTO’91). 129--140.
[18]
Rabin, T. 1998. A simplified approach to threshold and proactive RSA. In Proceedings of the International Cryptology Conference (CRYPTO’98). 89--104.
[19]
Rodrigues, R., Liskov, B., Chen, K., Liskov, M., and Schultz, D. 2007. Automatic reconfig- uration for large-scale distributed storage systems. IEEE Trans. Depend. Secur. Comput.
[20]
Schultz, D. 2007. Mobile proactive secret sharing. Master’s thesis, MIT.
[21]
Shamir, A. 1979. How to share a secret. Comm. ACM 22, 612--613.
[22]
Wong, T. M., Wang, C., and Wing, J. 2002. Verifiable secret redistribution for archive systems. In Proceedings of the International IEEE Security in Storage Workshop (SISW’02).
[23]
Yao, D., Fazio, N., Dodis, Y., and Lysyanskaya, A. 2004. ID-Based encryption for complex hierarchies with applications to forward security and broadcast encryption. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’04). 354--363.
[24]
Zhou, L., Schneider, F. B., and van Renesse, R. 2005. APSS: Proactive secret sharing in asynchronous systems. ACM Trans. Inf. Syst. Secur. 8, 3, 259--286.

Cited By

View all
  • (2024)Holding secrets accountableProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699011(1975-1992)Online publication date: 14-Aug-2024
  • (2024)Modeling Mobile Crash in Byzantine Consensus2024 IEEE 37th Computer Security Foundations Symposium (CSF)10.1109/CSF61375.2024.00043(159-171)Online publication date: 8-Jul-2024
  • (2024)A Dynamic Proactive Secret Sharing Scheme for Quadratic FunctionsIEEE Access10.1109/ACCESS.2024.336668812(25749-25761)Online publication date: 2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Information and System Security
ACM Transactions on Information and System Security  Volume 13, Issue 4
December 2010
412 pages
ISSN:1094-9224
EISSN:1557-7406
DOI:10.1145/1880022
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2010
Accepted: 01 January 2010
Revised: 01 July 2009
Received: 01 October 2008
Published in TISSEC Volume 13, Issue 4

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)20
  • Downloads (Last 6 weeks)4
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Holding secrets accountableProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699011(1975-1992)Online publication date: 14-Aug-2024
  • (2024)Modeling Mobile Crash in Byzantine Consensus2024 IEEE 37th Computer Security Foundations Symposium (CSF)10.1109/CSF61375.2024.00043(159-171)Online publication date: 8-Jul-2024
  • (2024)A Dynamic Proactive Secret Sharing Scheme for Quadratic FunctionsIEEE Access10.1109/ACCESS.2024.336668812(25749-25761)Online publication date: 2024
  • (2023)“Every Dog Has His Day”International Journal of Information Security and Privacy10.4018/IJISP.31869717:1(1-27)Online publication date: 10-Mar-2023
  • (2023)An Efficient Method for Realizing Contractions of Access Structures in Cloud StorageIEEE Transactions on Services Computing10.1109/TSC.2023.332589416:6(4481-4492)Online publication date: Nov-2023
  • (2023)Research on Secret Sharing for Cyberspace Mimic Defense2023 8th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS57501.2023.10150991(398-407)Online publication date: 21-Apr-2023
  • (2023)Reaching consensus for membership dynamic in secret sharing and its application to cross-chainHigh-Confidence Computing10.1016/j.hcc.2023.1001313:3(100131)Online publication date: Sep-2023
  • (2023)Dynamic Multi-server Updatable EncryptionInformation Security10.1007/978-3-031-49187-0_24(475-495)Online publication date: 1-Dec-2023
  • (2023)Proactive Secret Sharing with Constant CommunicationTheory of Cryptography10.1007/978-3-031-48618-0_12(337-373)Online publication date: 29-Nov-2023
  • (2023)Perfect MPC over Layered GraphsAdvances in Cryptology – CRYPTO 202310.1007/978-3-031-38557-5_12(360-392)Online publication date: 20-Aug-2023
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media