MPSS: Mobile Proactive Secret Sharing

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.

Index Terms

• Software and its engineering

  • Software organization and properties

    • Software system structures

      • Distributed systems organizing principles

        • Organizing principles for web applications