The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Noninterference and the composability of security properties
Abstract
The problem of composability of multilevel security properties, particularly the noninterference property and some of its generalizations, is discussed. Examples are used to show that some of these security properties do not compose; it is possible to connect two systems, both of which are judged to be secure, so that the composite system is not secure. A property called restrictiveness is introduced that is generally composable, so that two restrictive systems connected legally result in a new restrictive composite system. A novel feature in the brief discussion of restrictiveness is a state-machine version of the property.>
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
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Unwinding and Inference Control
Goguen, J. A., & Meseguer, J. (1984) · 1984 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1984.10019 · Cited by 429
Specifications for Multi-Level Security and a Hook-Up
McCullough, D. (1987) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.1987.10009 · Cited by 241
Self-citation
Cited by
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
A sound type system for secure flow analysis
Volpano, D., Irvine, C., & Smith, G. (1996) · Journal of Computer Security · doi:10.3233/jcs-1996-42-304 · Cited by 969
The SLam calculus: programming with secrecy and integrity
Heintze, N., & Riecke, J. G. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268976 · Cited by 410
Secure information flow in a multi-threaded imperative language
Smith, G., & Volpano, D. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268975 · Cited by 406
A Classification of Security Properties for Process Algebras1
Focardi, R., & Gorrieri, R. (1995) · Journal of Computer Security · doi:10.3233/jcs-1994/1995-3103 · Cited by 314
Metadata
- Authors
- McCullough, D.
- Venue
- Proceedings. 1988 IEEE Symposium on Security and Privacy
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2003-01-06
- Pages
- 177-186
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2136898254
- Cited by
- 261
- References
- 3
- FWCI
- 10.80
- 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
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.