Shared resource matrix methodology: an approach to identifying storage and timing channels
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Recognizing and dealing with storage and timing channels when performing the security analysis of a computer system is an elusive task.Methods for discovering and dealing with these channels have mostly been informal, and formal methods have been restricted to a particular specification language.A methodology for discovering storage and timing channels that can be used through all phases of the software life cycle to increase confidence that all channels have been identified is presented.The methodology is presented and applied to an example system having three different descriptions: English, formal specification, and high-order language implementation.
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
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
Cited by
A survey of covert channels and countermeasures in computer network protocols
Zander, S., Armitage, G., & Branch, P. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4317620 · Cited by 561
Access Control: Policies, Models, and Mechanisms
Samarati, P., & de Vimercati, S. C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45608-2_3 · Cited by 551
(2001) · Cited by 127
Metadata
- Authors
- Kemmerer, R. A.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1983-08
- Volume
- 1
- Issue
- 3
- Pages
- 256-277
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2166180744
- Cited by
- 227
- References
- 1
- FWCI
- 0.00
- Type
- journal article
- 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
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.