The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Dimensions and Principles of Declassification
Abstract
Computing systems often deliberately release (or declassify) sensitive information. A principal security concern for systems permitting information release is whether this release is safe: is it possible that the attacker compromises the information release mechanism and extracts more secret information than intended? While the security community has recognised the importance of the problem, the state-of-the-art in information release is, unfortunately, a number of approaches with somewhat unconnected semantic goals. We provide a road map of the main directions of current research, by classifying the basic goals according to what information is released, who releases information, where in the system information is released, and when information can be released. With a general declassification framework as a long-term goal, we identify some prudent principles of declassification. These principles shed light on existing definitions and may also serve as useful "sanity checks" for emerging models.
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
Self-citationLCF considered as a programming language
Plotkin, G. D. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90044-5 · Cited by 1,083
JFlow: practical mostly-static information flow control
Myers, A. C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292561 · Cited by 1,034
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
Protecting privacy using the decentralized label model
Myers, A. C., & Liskov, B. (2000) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/363516.363526 · Cited by 556
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
Abadi, M., Banerjee, A., Heintze, N., & Riecke, J. G. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292555 · Cited by 413
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
Probabilistic noninterference for multi-threaded programs
Sabelfeld, A., & Sands, D. (2002) · Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13 · doi:10.1109/csfw.2000.856937 · Cited by 304
Self-citationNoninterference, Transitivity, and Channel-Control Security Policies 1
Rushby, J. (2005) · Cited by 284
Abstract Non-Interference: A Unifying Framework for Weakening Information-flow
Giacobazzi, R., & Mastroeni, I. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3175660 · Cited by 210
A probabilistic poly-time framework for protocol analysis
Lincoln, P., Mitchell, J., Mitchell, M., & Scedrov, A. (1998) · Proceedings of the 5th ACM conference on Computer and communications security · doi:10.1145/288090.288117 · Cited by 209
A Model for Delimited Information Release
Sabelfeld, A., & Myers, A. C. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-37621-7_9 · Cited by 196
Self-citationZdancewic, S., & Myers, A. C. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930133 · Cited by 196
A Per Model of Secure Information Flow in Sequential Programs
Sabelfeld, A., & Sands, D. (2001) · Higher-Order and Symbolic Computation · doi:10.1023/a:1011553200337 · Cited by 172
Self-citationQuantitative Analysis of the Leakage of Confidential Data
Clark, D., Hunt, S., & Malacaria, P. (2002) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00290-7 · Cited by 167
Downgrading policies and relaxed noninterference
Li, P., & Zdancewic, S. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040319 · Cited by 167
A semantic approach to secure information flow
Joshi, R., & Leino, K. R. M. (2000) · Science of Computer Programming · doi:10.1016/s0167-6423(99)00024-6 · Cited by 162
Information transmission in computational systems
Cohen, E. (1977) · ACM SIGOPS Operating Systems Review · doi:10.1145/1067625.806556 · Cited by 154
Possibilistic definitions of security-an assembly kit
Mantel, H. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856936 · Cited by 152
Lowe, G. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021804 · Cited by 142
Stack-based access control and secure information flow
Banerjee, A., & Naumann, D. A. (2005) · Journal of Functional Programming · doi:10.1017/s0956796804005453 · Cited by 141
Security policies for downgrading
Chong, S., & Myers, A. C. (2004) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1030083.1030110 · Cited by 133
Semantics and Program Analysis of Computationally Secure Information Flow
Laud, P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_6 · Cited by 132
Process algebra and non-interference
Ryan, P. Y. A., & Schneider, S. A. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.1999.779775 · Cited by 129
Information flow inference for free
Pottier, F., & Conchon, S. (2000) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/351240.351245 · Cited by 121
Pierro, A. D., Hankin, C., & Wiklicky, H. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021803 · Cited by 113
Enforcing robust declassification
Myers, A. C., Sabelfeld, A., & Zdancewic, S. (2004) · ScholarlyCommons (University of Pennsylvania) · doi:10.1109/csfw.2004.9 · Cited by 100
Self-citationControlled Declassification Based on Intransitive Noninterference
Mantel, H., & Sands, D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30477-7_9 · Cited by 91
Self-citationVerifying secrets and relative secrecy
Volpano, D., & Smith, G. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325729 · Cited by 86
Challenges for Information-flow Security
Zdancewic, S. (2004) · Cited by 72
Language-Based Information Erasure
Chong, S., & Myers, A. C. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2005.19 · Cited by 67
Protection in programming-language translations
Abadi, M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055109 · Cited by 66
On Declassification and the Non-Disclosure Policy
Matos, A. A., & Boudol, G. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2005.21 · Cited by 63
Foundations of Security Analysis and Design - Tutorial Lectures
Riccardo Focardi, A., & Gorrieri, R. (2001) · doi:10.1007/3-540-45608-2 · Cited by 61
A unifying approach to the security of distributed and multi-threaded programs1
Mantel, H., & Sabelfeld, A. (2003) · Journal of Computer Security · doi:10.3233/jcs-2003-11406 · Cited by 57
Self-citationEnforcing robust declassification
Myers, A. C., Sabelfeld, A., & Zdancewic, S. (2004) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2004.1310740 · Cited by 52
Self-citationA generic approach to the security of multi-threaded programs
Mantel, H., & Sabelfeld, A. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2001.930142 · Cited by 48
Self-citationSecure introduction of one-way functions
Volpano, D. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856941 · Cited by 47
Bridging Language-Based and Process Calculi Security
Focardi, R., Rossi, S., & Sabelfeld, A. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31982-5_19 · Cited by 37
Self-citationConfidentiality for mobile code: the case of a simple payment protocol
Dam, M., & Giambiagi, P. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856940 · Cited by 29
Adjoining Declassification and Attack Models by Abstract Interpretation
Giacobazzi, R., & Mastroeni, I. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31987-0_21 · Cited by 27
A Design for a Security-Typed Language with Certificate-Based Declassification
Tse, S., & Zdancewic, S. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31987-0_20 · Cited by 27
On the secure implementation of security protocols
Giambiagi, P., & Dam, M. (2004) · Science of Computer Programming · doi:10.1016/j.scico.2004.01.002 · Cited by 25
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis
Mitchell, J. C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_2 · Cited by 12
Probabilistic polynomial-time process calculus and security protocol analysis
Mitchell, J. C., Ramanathan, A., Scedrov, A., & Teague, V. (2005) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2001.932477 · Cited by 11
On the Secure Implementation of Security Protocols
Giambiagi, P., & Dam, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36575-3_11 · Cited by 8
Cited by
On the Foundations of Quantitative Information Flow
Smith, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00596-1_21 · Cited by 570
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
Metadata
- Authors
- Sabelfeld, A., & Sands, D.
- Venue
- 18th IEEE Computer Security Foundations Workshop (CSFW'05)
- Publisher
- IEEE
- Published
- 2005-07-06
- Pages
- 255-269
- ISSN
- 1063-6900 (ISSN-L)
- OpenAlex
- W2116236474
- Cited by
- 263
- References
- 48
- FWCI
- 20.03
- 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.