How to Securely Replicate Services

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 16, Issue 3, 1994, Pages 986-1009

  Reiter, Michael K ^a   Birman, Kenneth P ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

causality; replication; state machines; threshold cryptography

Indexed keywords

COMPUTER NETWORKS; COMPUTER OPERATING SYSTEMS; CRYPTOGRAPHY; DATA COMMUNICATION SYSTEMS; DATA HANDLING; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; INFORMATION SERVICES; NETWORK PROTOCOLS; SEQUENTIAL MACHINES; SUBROUTINES;

AUTHENTICATION; CAUSALITY; CRYPTOGRAPHIC CONTROLS; REPLICATION; STATE MACHINES; THRESHOLD CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 0028429699     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/177492.177745     Document Type: Article

References (38)

1. BIRMAN, K. P., SCHIPER, A., AND STEPHENSON, P. 1991. Lightweight causal and atomic group multicast. ACM Trans. Comput. Syst. 9, 3 (Aug.), 272-314.
2. BRICKELL, E. 1990. A survey of hardware implementations of RSA. In Advances in Cryptology-CRYPTO '89 Proceedings. Lecture Notes in Computer Science, vol. 435. Springer-Verlag, New York, 368-370.
3. CHOR, B., AND DWORK, C 1989. Randomization in Byzantine agreement. Adv. Comput Res. 5, 443-497.
4. CRISTIAN, F., AGHILI, H., STRONG, R., AND DOLEV, D. 1985. Atomic broadcast: From simple message diffusion to Byzantine agreement. In Proceedings of the 15th International Symposium on Fault-Tolerant Computing. 200-206. A revised version appears as IBM Res. Lab. Tech. Rep. RJ5244 (April 1989), IBM, Armonk, N.Y.
5. DENNING, D. E. 1984. Digital signatures with RSA and other public-key cryptosystems. Commun. ACM 27, 4 (Apr.), 388-392.
6. DESMEDT Y., AND FRANKEL, Y. 1992 Shared generation of authenticators and signatures. In Advances in Cryptology-CRYPTO '91 Proceedings. Lecture Notes in Computer Science, vol. 576 Springer-Verlag, New York, 457-469.
7. DESMEDT, Y., AND FRANKEL, Y. 1990. Threshold cryptosystems. In Advances in Cryptology-CRYPTO '89 Proceedings. Lecture Notes in Computer Science, vol. 435. Springer-Verlag. New York, 307-315.
8. DOLEV, D., DWORK, C., AND NAOR, M. 1991. Non-malleable cryptography. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing. ACM, New York, 542-552.
9. ELGAMAL, T. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory. IT-31, 4 (July), 469-472.
10. FELDMAN, P. 1987. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science. IEEE, New York, 427-437.
11. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (Apr.), 374-382.
12. FRANKEL, Y., AND DESMEDT, Y. 1992. Distributed reliable threshold multisignature. Tech. Rep. TR-92-04-02, Dept. of EE & CS, Univ. of Wisconsin at Milwaukee
13. GONG, L. 1989. Securely replicating authentication services In Proceedings of the 9th International Conference on Distributed Computing Systems. 85-91.
14. GOPAL, A., STRONG, R., TOUEG, S., AND CRISTIAN, F. 1990. Early-delivery atomic broadcast. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 297-309.
15. HERLIHY, M. P., AND TYGAR, J. D. 1988. How to make replicated data secure. In Advances in Cryptology-CRYPTO '87 Proceedings. Lecture Notes in Computer Science, vol 293. Springer-Verlag, New York, 379-391.
16. JOSEPH, M. K. 1987. Towards the elimination of the effects of malicious logic: Fault tolerance approaches. In Proceedings of the 10th NBS/NCSC National Computer Security Conference. NBS/NCSC, Washington, D.C., 238-244.
17. KRAWCZYK, H. 1993. Distributed fingerprints and secure information dispersal. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 207-218.
18. LAIH, C. S. AND HARN, L. 1991. Generalized threshold cryptosystems In Pre-Proceedings of ASIACRYPT '91.
19. LAMPORT, L. 1978a. The implementation of reliable distributed multiprocess systems. Comput. Netw. 2, 95-114.
20. LAMPORT, L. 1978b. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (July), 558-565.
21. LAMPSON, B., ABADI, M., BURROWS, M., AND WOBBER, E. 1992. Authentication in distributed systems: Theory and practice. ACM Trans. Comput. Syst. 10, 4 (Nov.), 265-310.
22. LIM, C. H., AND LEE, P. J. 1994. Another method for attaining security against adaptively chosen ciphertext attacks. In Advances in Cryptology-CRYPTO '93 Proceedings. Lecture Notes in Computer Science, vol. 773. Springer-Verlag, New York, 420-434.
23. ORUP, B., SVENDSEN, E., AND ANDREASEN, E. 1991. VICTOR: An efficient RSA hardware implementation. In Advances in Cryptology-EUROCRYPT '90 Proceedings. Lecture Notes in Computer Science, vol. 473. Springer-Verlag, New York, 245-252.
24. RABIN, M. O. 1989. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36, 2 (Apr.), 335-348.
25. REITER, M. K. 1994. A secure group membership protocol. In Proceedings of the 1994 IEEE Symposium on Research in Security and Privacy. IEEE, New York. To be published.
26. REITER, M. K. 1993. A security architecture for fault-tolerant systems. Ph.D. thesis, Cornell Univ., Ithaca, N.Y.
27. REITER, M. K., AND GONG, L. 1993. Preventing denial and forgery of causal relationships in distributed systems. In Proceedings of the 1993 IEEE Symposium on Research in Security and Privacy. IEEE, New York, 30-40.
28. REITER, M. K., BIRMAN, K. P., AND GONG, L. 1992. Integrating security in a group oriented distributed system. In Proceedings of the 1992 IEEE Symposium on Research in Security and Privacy. IEEE, New York, 18-32.
29. RICCIARDI, A. M. 1992. The group membership problem in asynchronous systems. Ph.D. thesis, Cornell Univ., Ithaca, N.Y.
30. RIVEST, R. L. 1991. The MD4 message digest algorithm. In Advances in Cryptology-CRYPTO '90 Proceedings. Lecture Notes in Computer Science, vol. 537. Springer-Verlag, New York, 303-311.
31. RIVEST, R. L., SHAMIR, A., AND ADLEMAN, L. 1978. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (Feb.), 120-126.
32. SCHNEIDER, F. B. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv. 22, 4 (Dec.), 299-319.
33. SEDLAK, H. 1988. The RSA cryptography processor. In Advances in Cryptology: Proceedings of EUROCRYPT '87. Lecture Notes in Computer Science, vol. 304. Springer-Verlag, New York, 95-105.
34. SHAND, M., AND VUILLEMIN, J. 1993. Fast implementations of RSA cryptography. In Proceedings of the 11th IEEE Symposium on Computer Arithmetic. IEEE, New York.
35. SHRIVASTAVA, S. K., EZHILCHELVAN, P. D., SPEIRS, N. A., TAO, S., AND TULLY, A. 1992. Principal features of the VOLTAN family of reliable node architectures for distributed systems. IEEE Trans. Comput. 41, 5 (May), 542-549.
36. STEINER, J. G., NEUMAN, C., AND SCHILLER, J. I. 1988. Kerberos: An authentication service for open network systems. In Proceedings of the USENIX Winter Conference. USENIX Association, 191-202.
37. TURN, R., AND HABIBI, J. 1986. On the interactions of security and fault-tolerance. In Proceedings of the 9th NBS /NCSC National Computer Security Conference. NBS/NCSC, Washington D.C., 138-142.
38. VOYDOCK, V. L., AND KENT, S. T. 1983. Security mechanisms in high-level network protocols. ACM Comput. Surv. 15, 2 (June), 135-171.