ACM Home Page
Please provide us with feedback. Feedback
Secure agreement protocols: reliable and atomic group multicast in rampart
Full text PdfPdf (1.46 MB)
Source Conference on Computer and Communications Security archive
Proceedings of the 2nd ACM Conference on Computer and communications security table of contents
Fairfax, Virginia, United States
Pages: 68 - 80  
Year of Publication: 1994
ISBN:0-89791-732-4
Author
Michael K. Reiter  AT&T Bell Laboratories, Holmdel, New Jersey
Sponsor
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 24,   Citation Count: 42
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/191177.191194
What is a DOI?

ABSTRACT

Reliable and atomic group multicast have been proposed as fundamental communication paradigms to support secure distributed computing in systems in which processes may behave maliciously. These protocols enable messages to be multicast to a group of processes, while ensuring that all honest group members deliver the same messages and, in the case of atomic multicast, deliver these messages in the same order. We present new reliable and atomic group multicast protocols for asynchronous distributed systems. We also describe their implementation as part of Rampart, a toolkit for building high-integrity distributed services, i.e., services that remain correct and available despite the corruption of some component servers by an attacker. To our knowledge, Rampart is the first system to demonstrate reliable and atomic group multicast in asynchronous systems subject to process corruptions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A communication sub-system for high availability. In Proceedings of the SP, nd International Symposium on Fault-Tolerant Computing, pages 76-84, July 1992.
 
2
3
 
4
D. F. C. Brewer and M. J. Nash. The Chinese wall security policy. In Proceedings of the 1989 IEEE Symposium on Security and Pri~acy, pages 206-214, April 1989.
5
6
 
7
F. Cristian, H. Aghili, R. Strong, and D. Dolev. Atomic broadcast: From simple message diffusion to Byzantine agreement. In Proceedings of the 15th International Symposium on Fault-Tolerant Computing, pages 200-206, June 1985. A revised version appears as IBM Research Laboratory Technical Report RJ5244 (April 1989).
8
 
9
M. K. Franklin and M. Yung. The varieties of secure distributed computation. In Proceedings of Sequences II, Methods in Communications, Security and Computer Science, pages 392-417, June 1991.
10
11
 
12
 
13
M. F. Kaashoek and A. S. Tanenbaum. Group communica. tion in the Amoeba distributed operating system. In Proceedings of the 11th International Conference on Distributed Computing Systems, pages 222-230, May 1991.
 
14
J. B. Lacy, D. P. Mitchell, and W. M. SCheU. CryptoLib: Cryptographyin software. In Proceedings of the ~th USENIX Security Workshop, pages 1-17, October 1993.
15
 
16
 
17
 
18
J.H. Moore. Protocol failures in cryptosystems. Proceedings oy the IEEE, 76(5), May 1988.
19
20
 
21
22
23
 
24
 
25
B.. L. Rivest. RFC 19~I: The MD5 Meuage Digest Algorithm. Internet Activities Board, April 1992.
26
 
27
A. Schiper and A. Sandoz. Uniform reliable multicast in a virtually synchronous environment. In Proceeding8 of the 19th International Conference on Distributed Computing Systems, pages 561-568, May 1993.
28
 
29
30
 
31
32

CITED BY  42