The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Secure information flow by self-composition
Abstract
Non-interference is a high-level security property that guarantees the absence of illicit information leakages through executing programs. More precisely, non-interference for a program assumes a separation between secret inputs and public inputs on the one hand, and secret outputs and public outputs on the other hand, and requires that the value of public outputs does not depend on the value of secret inputs. A common means to enforce non-interference is to use an information flow type system. However, such type systems are inherently imprecise, and reject many secure programs, even for simple programming languages. The purpose of this paper is to investigate logical formulations of noninterference that allow a more precise analysis of programs. It appears that such formulations are often sound and complete, and also amenable to interactive or automated verification techniques, such as theorem-proving or model-checking. We illustrate the applicability of our method in several scenarios, including a simple imperative language, a non-deterministic language, and finally a language with shared mutable data structures.
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
Security Policies and Security Models
Goguen, J. A., & Meseguer, J. (1982) · 1982 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1982.10014 · Cited by 2,119
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
Cited by
Secure Information Flow as a Safety Problem
Terauchi, T., & Aiken, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11547662_24 · Cited by 282
Temporal Logics for Hyperproperties
Clarkson, M. R., Finkbeiner, B., Koleini, M., Micinski, K. K., Rabe, M. N., & Sánchez, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54792-8_15 · Cited by 270
Computer-Aided Security Proofs for the Working Cryptographer
Barthe, G., Grégoire, B., Heraud, S., & Béguelin, S. Z. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_5 · Cited by 256
Self-citationFairSquare: probabilistic verification of program fairness
Albarghouthi, A., D'Antoni, L., Drews, S., & Nori, A. V. (2017) · Proceedings of the ACM on Programming Languages · doi:10.1145/3133904 · Cited by 94
Wang, Y., Wang, X., & Dillig, I. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3276525 · Cited by 17
Metadata
- Authors
- Barthe, G., D'Argenio, P. R., & Rezk, T.
- Venue
- Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004.
- Publisher
- IEEE
- Published
- 2004-11-12
- Pages
- 100-114
- ISSN
- 1063-6900 (ISSN-L)
- OpenAlex
- W4236991443
- Cited by
- 177
- References
- 2
- FWCI
- 3.04
- 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: Secure information flow by self-composition. https://app.cochat.ai/papers/10.1109/csfw.2004.1310735
- The paper
- Barthe, G., D'Argenio, P. R., & Rezk, T. (2004). Secure information flow by self-composition. Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004. https://doi.org/10.1109/csfw.2004.1310735
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.