The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Intrusion tolerance in distributed computing systems
Abstract
An intrusion-tolerant distributed system is a system which is designed so that any intrusion into a part of the system will not endanger confidentiality, integrity and availability. This approach is suitable for distributed systems, because distribution enables isolation of elements so that an intrusion gives physical access to only a part of the system. In particular, the intrusion-tolerant authentication and authorization servers enable a consistent security policy to be implemented on a set of heterogeneous, untrusted sites, administered by untrusted (but nonconspiring) people. The authors describe how some functions of distributed systems can be designed to tolerate intrusions. A prototype of the persistent file server presented has been successfully developed and implemented as part of the Delta-4 project of the European ESPRIT program.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“…manages a directory tree consisting of just a link to an authorization server, i.e. the relation between the authentication server and the authorization server is the same as the link from one authorization server to another one. secrets are thus to be "shared" [21] by the authorization sites.”
BackgroundA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
Cited by
Crowds: anonymity for Web transactions
Reiter, M. K., & Rubin, A. D. (1998) · ACM Transactions on Information and System Security · doi:10.1145/290163.290168 · Cited by 1,770
Model-based evaluation: from dependability to security
Nicol, D. M., Sanders, W. H., & Trivedi, K. S. (2004) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2004.11 · Cited by 510
Security models for web-based applications
Joshi, J. B. D., Aref, W. G., Ghafoor, A., & Spafford, E. H. (2001) · Communications of the ACM · doi:10.1145/359205.359224 · Cited by 255
Metadata
- Authors
- Deswarte, Y., Blain, L., & Fabre, J.-C.
- Venue
- Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-10
- Pages
- 110-121
- OpenAlex
- W2148129140
- Cited by
- 233
- References
- 4
- FWCI
- 17.40
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Intrusion tolerance in distributed computing systems. https://app.cochat.ai/papers/10.1109/risp.1991.130780
- The paper
- Deswarte, Y., Blain, L., & Fabre, J.-C. (2002). Intrusion tolerance in distributed computing systems. Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy. https://doi.org/10.1109/risp.1991.130780
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.