The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Secure agreement protocols: reliable and atomic group multicast in rampart
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
Lightweight causal and atomic group multicast
Birman, K., Schiper, A., & Stephenson, P. (1991) · ACM Transactions on Computer Systems · doi:10.1145/128738.128742 · Cited by 956
Verifiable secret sharing and multiparty protocols with honest majority
Rabin, T., & Ben-Or, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73014 · Cited by 930
The Chinese Wall security policy
Brewer, D. F. C., & Nash, M. J. (2003) · Proceedings. 1989 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1989.36295 · Cited by 882
The MD4 Message Digest Algorithm
Rivest, R. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_22 · Cited by 486
Cited by
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Secure group communications using key graphs
Wong, C. K., Gouda, M., & Lam, S. S. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.836475 · Cited by 1,093
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Total order broadcast and multicast algorithms: Taxonomy and survey
Défago, X., Schiper, A., & Urbán, P. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041682 · Cited by 543
Metadata
- Authors
- Reiter, M. K.
- Venue
- Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94
- Publisher
- ACM Press
- Published
- 1994
- Pages
- 68-80
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2049913483
- Cited by
- 289
- References
- 26
- FWCI
- 6.87
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Secure agreement protocols: reliable and atomic group multicast in rampart. https://app.cochat.ai/papers/10.1145/191177.191194
- The paper
- Reiter, M. K. (1994). Secure agreement protocols: reliable and atomic group multicast in rampart. Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94. https://doi.org/10.1145/191177.191194
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.