APSS: Proactive secret sharing in asynchronous systems

ACM Transactions on Information and System Security

Volumn 8, Issue 3, 2005, Pages 259-286

  Zhou, Lidong ^a   Schneider, Fred B ^b,c   Van Renesse, Robbert ^b,c  

^a MICROSOFT RESEARCH   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Asynchronous system; Denial of service; Proactive secret sharing; Threshold cryptography

Indexed keywords

ASYNCRONOUS SYSTEMS; DENIAL OF SERVICE; PROACTIVE SECRET SHARING; THRESHOLD CRYPTOGRAPHY;

CRYPTOGRAPHY; DATA PROCESSING; INFORMATION TECHNOLOGY; NETWORK PROTOCOLS; PROGRAM PROCESSORS; SECURITY OF DATA;

ASYNCHRONOUS TRANSFER MODE;

EID: 27644508954     PISSN: 10949224     EISSN: 10949224     Source Type: Journal    
DOI: 10.1145/1085126.1085127     Document Type: Article

References (36)

1. BLAKLEY, G. R. 1979. Safeguarding cryptographic keys. In Proceedings of the National Computer Conference, 48. American Federation of Information Processing Societies Proceedings, 313-317.
2. BOYD, C. 1989. Digital multisignatures. In Cryptography and Coding, H. Baker and F. Piper, Eds. Clarendon Press, pp. 241-246.
3. CACHIN, C. AND PORITZ, J. A. 2002. Secure intrusion-tolerant replication on the Internet. In Proceedings of the International Conference on Dependable Systems and Networks (DSN-2002), IEEE (June), 167-176.
4. CACHIN, C., KURSAWE, K., LYSYANSKAYA, A., AND STROBL, R. 2002. Asynchronous verifiable secret sharing and proactive cryptosystems. In Proceedings of the 9th ACM Conference on Computer and Communications Security. ACM Press, New York (Nov.), 88-97.
5. CACHIN, C., KURSAWE, K., PETZOLD, F., AND SHOUP, V. 2001. Secure and efficient asynchronous broadcast protocols (extended abstract). In Advances in Cryptology - Crypto'2001, J. Kilian, Ed. Lecture Notes in Computer Science, vol. 2139. Springer-Verlag, 524-541.
6. CANETTI, R. 1995. Studies in Secure Multiparty Computation and Applications. PhD thesis, Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Israel (June).
7. CANETTI, R., FEIGE, U., GOLDREICH, O., AND NAOR, M. 1996. Adaptively secure multi-party computation. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing. ACM Press, New York, 639-648.
8. CANETTI, R., GENNARO, R., HERZBERG, A., AND NAOR, D. 1997. Proactive security: Long-term protection against break-ins. CryptoBytes (The Technical Newsletter of RSA Laboratories, A Division of RSA Data Security Inc.) 3, 1, 1-8.
9. CASTRO, M. AND LISKOV, B. 2002. Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20, 4 (Nov.), 398-461.
10. CHOR, B., GOLDWASSER, S., MACALI, S., AND AWERBUCH, B. 1985. Verifiable secret sharing and achieving simultaneous broadcast. In Proceedings of the 26th Symposium on Foundations of Computer Science. 335-344.
11. COURTOIS, P., HEYMANS, F., AND PARNAS, D. 1971. Concurrent control with readers and writers. Communications of the ACM 14, 10 (Oct.), 667-668.
12. DESMEDT, Y. 1988. Society and group oriented cryptography: A new concept. In C. Pomerance, Ed. Advances in Cryptology - Crypto'87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, CA (Aug.) 16-20, 1987, Vol. 293 of Lecture Notes in Computer Science, Springer-Verlag, pp. 120-127.
13. DESMEDT, Y. AND JAJODIA, S. 1997. Redistributing secret shares to new access structures and its applications. Technical Report ISSE_TR-97-01, George Mason University, July.
14. FELDMAN, P. 1987. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science. 427-437.
15. FISCHER, M. J., LYNCH, N. A., AND PETERSON, M. S. 1985. Impossibility of distributed consensus with one faulty processor. Journal of the ACM 32, 2 (Apr.), 374-382.
16. FRANKEL, Y., GEMMEL, P., MACKENZIE, P., AND YUNG, M. 1997a. Optimal resilience proactive public-key cryptosystems. In Proceedings of the 38th Symposium on Foundations of Computer Science, Miami Beach, FL, (Oct.) 20-22. IEEE, pp. 384-393.
17. FRANKEL, Y., GEMMELL, P., MACKENZIE, P., AND YUNG, M. 1997b. Proactive RSA. In Advances in Cryptology - Crypto'97, B. Kaliski, Ed. Lecture Notes in Computer Science vol. 1294, Santa Barbara, California (Aug.). Springer-Verlag, pp. 440-454.
18. HERZBERG, A., JARECKI, S., KRAWCZYK, H., AND YUNG, M. 1995. Proactive secret sharing or: How to cope with perpetual leakage. In Advances in Cryptology - Crypto '95, D. Coppersmith, Ed. Lecture Notes in Computer Science vol. 963, Santa Barbara, California (Aug.). Springer-Verlag, 457-469.
19. HERZBERG, A., JAKOBSSON, M., JARECKI, S., KRAWCZYK, H., AND YUNG, M. 1997. Proactive public-key and signature schemes. In Proceedings of the Fourth Annual Conference on Computer Communications Security. ACM, New York, 100-110.
20. HIRT, M. AND MAURER, U. 2000. Player simulation and general adversary structures in perfect multi-party computation. Journal of Cryptology 13, 1, 31-60.
21. ITO, M., SAITO, A., AND NISHIZEKI, T. 1987. Secret sharing scheme realizing general access structure. In Proceedings of IEEE Global Communication Conference (GLOBALCOM'87), Tokyo, Japan (Nov.), 99-102.
22. JARECKI, S. 1995. Proactive secret sharing and public key cryptosystems. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (Sept.).
23. LAMPORT, L. 1977. Concurrent reading while writing. Communications of the ACM 20, 11, 806-811.
24. LAMPORT, L. AND MELLIAR-SMITH, P. M. 1984. Byzantine clock synchronization. In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada. ACM Press, New York, 68-74.
25. MALKHI, D. AND REITER, M. 1998. Byzantine quorum systems. Distributed Computing 11, 4, 203-213.
26. OSTROVSKY, R. AND YUNG, M. 1991. How to withstand mobile virus attacks. In Proceedings of the 10th ACM Symposium, on Principles of Distributed Computing. 51-59.
27. PEDERSEN, T. 1992. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology - Crypto'91, J. Feigenbaum, Ed. Lecture Notes in Computer Science vol. 576, Santa Barbara, California (Aug.). Springer-Verlag, 129-140.
28. RABIN, T. 1998. A simplified approach to threshold and proactive RSA. In Advances in Cryptology - Crypto'98, H. Krawczyk Ed. Lecture Notes in Computer Science vol. 1462, Santa Barbara, California (Aug.). Springer-Verlag, 89-104.
29. REITER, M. K. 1995. The Rampart toolkit for building high-integrity services. In K. P. Birman, F. Mattern, and A. Schiper, Eds. Theory and Practice in Distributed Systems, International Workshop, Selected Papers, Vol. 938 of Lecture Notes in Computer Science, Berlin, Germany, Springer-Verlag, 99-110.
30. REITER, M. K. 1996. Distributing trust with the Rampart toolkit. Communications of the ACM 39, 4 (Apr.), 71-74.
31. SCHNEIDER, F. B. 1987. Understanding protocols for Byzantine clock synchronization. Technical Report TR 87-859, Computer Science Department, Cornell University, New York,
32. SHAMIR, A. 1979. How to share a secret. Communications of the ACM 22, 11 (Nov.), 612-613.
33. WONG, T. M., WANG, C., AND WING, J. M. 2002. Verifiable secret redistribution for threshold sharing schemes. Technical Report CMU-CS-02-114, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, February 2002.
34. ZHOU, L. 2001. Towards building secure and fault-tolerant on-line services. PhD thesis, Computer Science Department, Cornell University, Ithaca, New York (May).
35. ZHOU, L., SCHNEIDER, F. B., AND VAN RENESSE, R. 2002a. APSS: Proactive secret sharing in asynchronous systems. Technical Report TR 2002-1877, Computer Science Department (Oct.), Cornell University, Ithaca, New York.
36. ZHOU, L., SCHNEIDER, F. B., AND VAN RENESSE, R. 2002b. COCA: A secure distributed on-line certification authority. ACM Transactions on Computer Systems 20, 4 (Nov.), 329-368.