Cited by 1,907Security and Verification in ComputingLogic, programming, and type systemsCryptography and Data Security

The DOI matches its Crossref record; 160 of the 164 references it cites were found in a registry or an index.

Language-based information-flow security

Sabelfeld, A., Myers, A.C.·2003·IEEE Journal on Selected Areas in Communications

DOI 10.1109/jsac.2002.806121

Open this paper in CoChat — free account

Abstract

Current standard security practices do not provide substantial assurance that the end-to-end behavior of a computing system satisfies important security policies such as confidentiality. An end-to-end confidentiality policy might assert that secret input data cannot be inferred by an attacker through the attacker's observations of system output; this policy regulates information flow. Conventional security mechanisms such as access control and encryption do not directly address the enforcement of information-flow policies. Previously, a promising new approach has been developed: the use of programming-language techniques for specifying and enforcing information-flow policies. In this paper, we survey the past three decades of research on information-flow security, particularly focusing on work that uses static program analysis to enforce information-flow policies. We give a structured view of work in the area and identify some important open challenges.

Integrity signals

Registry

Crossref · 10.1109/jsac.2002.806121

Cites

160 of 160 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

A Mathematical Theory of Communication
Shannon, C. E. (1948) · The MIT Press eBooks · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 50,387
A mathematical theory of communication
Hockett, C. F., Shannon, C., & Weaver, W. (1948) · MOCO · doi:10.1145/584091.584093 · Cited by 30,543
The Mathematical Theory of Communication
Shannon, C. E., Weaver, W., & Wiener, N. (1950) · Physics Today · doi:10.1063/1.3067010 · Cited by 9,885
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
On the security of public key protocols
Dolev, D., & Yao, A. C.-C. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,908
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_9 · Cited by 4,446
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in logic and the foundations of mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,813
End-to-end arguments in system design
Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · ACM Transactions on Computer Systems · doi:10.1145/357401.357402 · Cited by 2,198
End-To-End Arguments In System Design
And, S. R., Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · Cited by 2,130
The protection of information in computer systems
Saltzer, J. H., & Schroeder, M. D. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9939 · Cited by 2,126
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
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Proof-carrying code
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
Principles of Program Analysis
Nielson, F., Nielson, H. R., & Hankin, C. (1999) · Springer eBooks · doi:10.1007/978-3-662-03811-6 · Cited by 1,836
A note on the confinement problem
Lampson, B. (1973) · Communications of the ACM · doi:10.1145/362375.362389 · Cited by 1,482
Protection of information in computer systems
Saltier, J. H., & Schroeder, M. P. (1975) · IEEE CSIT Newsletter · doi:10.1109/csit.1975.6498831 · Cited by 1,421
Efficient software-based fault isolation
Wahbe, R., Lucco, S. E., Anderson, T. E., & Graham, S. L. (1993) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/168619.168635 · Cited by 1,238
Bisimulation through probabilistic testing
Larsen, K. G., & Skou, A. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90030-6 · Cited by 1,236
Integrity Considerations for Secure Computer Systems
Biba, K. J. (1977) · Defense Technical Information Center (DTIC) · Cited by 1,226
A calculus for cryptographic protocols
Abadi, M., & Gordon, A. D. (1997) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/266420.266432 · Cited by 1,158
JFlow
Myers, A. C. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292561 · Cited by 1,039
Self-citation
Certification of programs for secure information flow
Denning, D. E., & Denning, P. J. (1977) · Communications of the ACM · doi:10.1145/359636.359712 · Cited by 1,028
Secure Computer Systems: Mathematical Foundations
Bell, D. E., & LaPadula, L. J. (1973) · Defense Technical Information Center (DTIC) · Cited by 1,017
A Theory of Objects
Abadi, M., & Cardelli, L. (1996) · Texts and monographs in computer science · doi:10.1007/978-1-4419-8598-9 · Cited by 1,012
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 972
Compiling with Continuations
Appel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 828
Simple object access protocol (SOAP) 1.1
Box, D. F. (2000) · Cited by 770
Programming semantics for multiprogrammed computations
Dennis, J. B., & Horn, E. C. V. (1983) · Communications of the ACM · doi:10.1145/357980.357993 · Cited by 676
A Calculus for Cryptographic Protocols: The Spi Calculus
Abadi, M., & Gordon, A. D. (1999) · Information and Computation · doi:10.1006/inco.1998.2740 · Cited by 664
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 606
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292560 · Cited by 598
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1966) · Communications of the ACM · doi:10.1145/365230.365252 · Cited by 575
The | lambda-Calculus.
Hodes, H. T., & Barendregt, H. P. (1988) · The Philosophical Review · doi:10.2307/2185110 · Cited by 574
A decentralized model for information flow control
Myers, A. C., & Liskov, B. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266669 · Cited by 536
Self-citation
Protection
Lampson, B. (1974) · ACM SIGOPS Operating Systems Review · doi:10.1145/775265.775268 · Cited by 505
HYDRA
Wulf, W., Cohen, E., Corwin, W. M., Jones, A., Levin, R., Pierson, C., & Pollack, F. J. (1974) · Communications of the ACM · doi:10.1145/355616.364017 · Cited by 491
Foundations of secure computation
DeMillo, R. A., Lipton, R. J., Dobkin, D., & Jones, A. K. (1978) · SMARTech Repository (Georgia Institute of Technology) · Cited by 462
Mobile ambients
Cardelli, L., & Gordon, A. D. (1998) · Lecture notes in computer science · doi:10.1007/bfb0053547 · Cited by 455
Unwinding and Inference Control
Goguen, J. A., & Meseguer, J. (1984) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/sp.1984.10019 · Cited by 430
The SLam calculus
Heintze, N., & Riecke, J. G. (1998) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/268946.268976 · Cited by 409
A core calculus of dependency
Abadi, M., Banerjee, A., Heintze, N., & Riecke, J. G. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292555 · Cited by 409
Secure information flow in a multi-threaded imperative language
Smith, G., & Volpano, D. (1998) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/268946.268975 · Cited by 407
Transforming out timing leaks
Agat, J. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325702 · Cited by 339
A general theory of composition for trace sets closed under selective interleaving functions
McLean, J. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/risp.1994.296590 · Cited by 320
Secrecy by typing in security protocols
Abadi, M. (1999) · Journal of the ACM · doi:10.1145/324133.324266 · Cited by 316
A Classification of Security Properties for Process Algebras1
Riccardo Focardi, A., & Gorrieri, R. (1995) · Journal of Computer Security · doi:10.3233/jcs-1994/1995-3103 · Cited by 306
Probabilistic noninterference for multi-threaded programs
Sabelfeld, A., & Sands, D. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856937 · Cited by 305
Self-citation
Security models and information flow
McLean, J. (1990) · IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1990.63849 · Cited by 270
Information flow inference for ML
Pottier, F., & Simonet, V. (2003) · ACM Transactions on Programming Languages and Systems · doi:10.1145/596980.596983 · Cited by 262
Noninterference and the composability of security properties
McCullough, D. (2003) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1988.8110 · Cited by 262
Mobile ambients
Cardelli, L., & Gordon, A. D. (2001) · Formal Methods · Cited by 261
SASI enforcement of security policies
Erlingsson, Ú., & Schneider, F. B. (1999) · New Security Paradigms Workshop · doi:10.1145/335169.335201 · Cited by 257
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
A type-based approach to program security
Volpano, D., & Smith, G. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0030629 · Cited by 225
CSP and determinism in security modelling
Roscoe, A. W. (2002) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1995.398927 · Cited by 211
Java Security
Oaks, S. (1998) · Cited by 202
Flexible policy-directed code safety
Evans, D., & Twyman, A. R. (2003) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1999.766716 · Cited by 198
Robust declassification
Zdancewic, S., & Myers, A. C. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2001.930133 · Cited by 193
Self-citation
Information flow inference for ML
Pottier, F., & Simonet, V. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503302 · Cited by 191
Complete, safe information flow with decentralized labels
Myers, A. C., & Liskov, B. H. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1998.674834 · Cited by 180
Self-citation
Department of Defense Trusted Computer System Evaluation Criteria
US Department of Defense (1985) · Palgrave Macmillan UK eBooks · doi:10.1007/978-1-349-12020-8_1 · Cited by 178
A Per Model of Secure Information Flow in Sequential Programs
Sabelfeld, A., & Sands, D. (2001) · LISP and Symbolic Computation · doi:10.1023/a:1011553200337 · Cited by 171
Self-citation
Quantitative 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
SASI enforcement of security policies: a retrospective
Erlingsson, Ú., & Schneider, F. B. (2002) · DARPA Information Survivability Conference and Exposition · doi:10.1109/discex.2000.821527 · Cited by 160
A Language-Based Approach to Security
Schneider, F. B., Morrisett, G., & Harper, R. W. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44577-3_6 · Cited by 159
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 159
Information transmission in computational systems
Cohen, E. (1977) · ACM SIGOPS Operating Systems Review · doi:10.1145/1067625.806556 · Cited by 154
Eliminating covert flows with minimum typings
Volpano, D., & Smith, G. (2002) · doi:10.1109/csfw.1997.596807 · Cited by 153
An Axiomatic Approach to Information Flow in Programs
Andrews, G. R., & Reitman, R. P. (1980) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357084.357088 · Cited by 151
Possibilistic definitions of security-an assembly kit
Mantel, H. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856936 · Cited by 150
A general theory of composition for a class of "possibilistic" properties
McLean, J. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481534 · Cited by 150
Probabilistic noninterference in a concurrent language1
Volpano, D., & Smith, G. (1999) · Journal of Computer Security · doi:10.3233/jcs-1999-72-305 · Cited by 149
Secure information flow and pointer con .nement in a java-like language
Banerjee, A., & Naumann, D. A. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021820 · Cited by 148
Quantifying information flow
Lowe, G. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021804 · Cited by 142
A new type system for secure information flow
Smith, G. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2001.930141 · Cited by 139
Noninterference for concurrent programs and thread systems
Boudol, G., & Castellani, I. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00010-5 · Cited by 135
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
Memoryless subsystems
Fenton, J. S. (1974) · The Computer Journal · doi:10.1093/comjnl/17.2.143 · Cited by 131
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 127
SAFKASI
Wallach, D. S., Appel, A. W., & Felten, E. W. (2000) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/363516.363520 · Cited by 126
On the composition of secure systems
Mantel, H. (2005) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2002.1004364 · Cited by 122
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 119
Secure Information Flow as Typed Process Behaviour
Honda, K., VASCONCELOS, V. T., & Yoshida, N. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46425-5_12 · Cited by 114
Proving Noninterference and Functional Correctness Using Traces
McLean, J. (1992) · Journal of Computer Security · doi:10.3233/jcs-1992-1103 · Cited by 107
A simple view of type-secure information flow in the π-calculus
Pottier, F. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021826 · Cited by 106
Secrecy by typing in security protocols
Abadi, M. (1997) · Lecture notes in computer science · doi:10.1007/bfb0014571 · Cited by 105
A Per Model of Secure Information Flow in Sequential Programs
Sabelfeld, A., & Sands, D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49099-x_4 · Cited by 103
Self-citation
Trust in the λ-calculus
Ørbæk, P., & Palsberg, J. (1997) · Journal of Functional Programming · doi:10.1017/s0956796897002906 · Cited by 99
A uniform type structure for secure information flow
Honda, K., & Yoshida, N. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503281 · Cited by 99
Programming languages for information security
Zdancewic, S. A., & Myers, A. (2002) · Cited by 96
Self-citation
Compiling with Types
Morrisett, G. (1995) · Cited by 94
Untrusted hosts and confidentiality
Zdancewic, S., Zheng, L., Nystrom, N., & Myers, A. C. (2001) · doi:10.1145/502034.502036 · Cited by 93
Self-citation
Information flow analysis in a discrete-time process algebra
Riccardo Focardi, A., Gorrieri, R., & Martinelli, F. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856935 · Cited by 89
Trust in the-calculus
Palsberg, J., & Ørbæk, P. (1995) · Cited by 86
Verifying 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 85
Static Analysis for the π-Calculus with Applications to Security
Bodei, C., Degano, P., Nielson, F., & Nielson, H. R. (2001) · Information and Computation · doi:10.1006/inco.2000.3020 · Cited by 84
Probabilistic interference
Gray, J. W. (1990) · IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1990.63848 · Cited by 82
Current Trends In Theoretical Computer Science
Pǎun, G., Rozenberg, G., & Salomaa, A. (2001) · WORLD SCIENTIFIC eBooks · doi:10.1142/4566 · Cited by 81
Secrecy types for asymmetric communication
Abadi, M., & Blanchet, B. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00863-0 · Cited by 79
Book review: A Theory of Objects by Martin Abadi and Luca Cardelli (Springer-Verlag, 1996)
Postow, B. (1999) · ACM SIGACT News · doi:10.1145/309739.1041990 · Cited by 76
Static Confidentiality Enforcement for Distributed Programs
Sabelfeld, A., & Mantel, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45789-5_27 · Cited by 74
Self-citation
Secure Information Flow and CPS
Zdancewic, S., & Myers, A. C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_4 · Cited by 73
Self-citation
Probabilistic noninterference in a concurrent language
Volpano, D., & Smith, G. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.1998.683153 · Cited by 71
Validating Firewalls in Mobile Ambients
Nielson, F., Nielson, H. R., Hansen, R. R., & Jensen, J. G. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48320-9_32 · Cited by 70
Mathematical Models of Computer Security
Ryan, P. Y. A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45608-2_1 · Cited by 69
Safety versus Secrecy
Volpano, D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48294-6_20 · Cited by 69
Secure Information Flow via Linear Continuations
Zdancewic, S., & Myers, A. C. (2002) · LISP and Symbolic Computation · doi:10.1023/a:1020843229247 · Cited by 66
Self-citation
Security Models and Information Flow
MCLEAN, J. A. J. (1990) · doi:10.21236/ada462529 · Cited by 64
Logical relations for encryption
Sumii, E., & Pierce, B. C. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2001.930151 · Cited by 63
Compile-time detection of information flow in sequential programs
Banâtre, J.-P., Bryce, C., & Métayer, D. L. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58618-0_56 · Cited by 62
Language-Based Security
Kozen, D. C. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48340-3_26 · Cited by 62
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 Technique for Proving Specifications are Multilevel Secure
Feiertag, R. J. (1980) · doi:10.21236/adb145741 · Cited by 59
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 58
Self-citation
A security flow control algorithm and its denotational semantics correctness proof
Mizuno, M., & Schmidt, D. M. (1992) · Formal Aspects of Computing · doi:10.1007/bf03180570 · Cited by 57
The Impact of Synchronisation on Secure Information Flow in Concurrent Programs
Sabelfeld, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45575-2_22 · Cited by 56
Self-citation
Noninterference for Concurrent Programs
Boudol, G., & Castellani, I. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_32 · Cited by 54
Secure composition of untrusted code: wrappers and causality types
Sewell, P., & Vítek, J. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856943 · Cited by 51
Information transmission in computational systems
Choen, E. (1977) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/800214.806556 · Cited by 51
Information flow for Algol-like languages
Clark, D., Hankin, C., & Hunt, S. (2002) · Computer Languages · doi:10.1016/s0096-0551(02)00006-1 · Cited by 49
A 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-citation
Secure introduction of one-way functions
Volpano, D. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2000.856941 · Cited by 47
Static analysis and computer security: new techniques for software assurance
Wagner, D., & Brewer, E. (2000) · Cited by 45
Static Analysis for Secrecy and Non-interference in Networks of Processes
Bodei, C., Degano, P., Nielson, F., & Nielson, H. R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44743-1_3 · Cited by 45
Static Analysis of Processes for No Read-Up and No Write-Down
Bodei, C., Degano, P., Nielson, F., & Nielson, H. R. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49019-1_9 · Cited by 43
Secrecy Types for Asymmetric Communication
Abadi, M., & Blanchet, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45315-6_2 · Cited by 36
Information Flow vs. Resource Access in the Asynchronous Pi-Calculus (Extended Abstract)
Hennessy, M., & Riely, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45022-x_35 · Cited by 35
Secure composition of untrusted code: box π, wrappers, and causality types
Sewell, P., & Vítek, J. (2003) · Journal of Computer Security · doi:10.3233/jcs-2003-11202 · Cited by 34
Information flow inference for ML
Pottier, F., & Simonet, V. (2002) · ACM SIGPLAN Notices · doi:10.1145/565816.503302 · Cited by 32
Non-deterministic games and program analysis: An application to security
Malacaria, P., & Hankin, C. (2003) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1999.782639 · Cited by 30
Confidentiality 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 28
Can you Trust your Data?
Ørbæk, P. (1995) · BRICS Report Series · doi:10.7146/brics.v2i24.19926 · Cited by 27
Security Typings by Abstract Interpretation
Zanotti, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45789-5_26 · Cited by 26
Trust in the λ-calculus
Palsberg, J., & Ørb⇓ek, P. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60360-3_47 · Cited by 23
Partial Evaluation and Non-interference for Object Calculi
Barthe, G., & Serpette, B. (1999) · Lecture notes in computer science · doi:10.1007/10705424_4 · Cited by 22
Probabilistic Information Flow in a Process Algebra
Aldini, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44685-0_11 · Cited by 22
Type Based Techniques for Covert Channel Elimination and Register Allocation
Agat, J. (2000) · Chalmers Publication Library (Chalmers University of Technology) · Cited by 22
On Confidentiality and Algorithms
Agat, J., & Sands, D. (2001) · Chalmers Publication Library (Chalmers University of Technology) · Cited by 20
The epistemic representation of information flow security in probabilistic systems
Syverson, P. F., & Gray, J. W. (2002) · doi:10.1109/csfw.1995.518560 · Cited by 19
Cryptographic types
Duggan, D. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021819 · Cited by 19
Trust in the lambda-calculus
Palsberg, J., & Ørbæk, P. (1995) · BRICS Report Series · doi:10.7146/brics.v2i31.19934 · Cited by 18
Fine-grained information flow analysis for a ~ -calculus with sum types
Simonet, V. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021818 · Cited by 16
Static dependent types for first class modules
Sheldon, M. A., & Gifford, D. K. (1990) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/91556.91577 · Cited by 15
Can you trust your data
Ørbæk, P. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59293-8_221 · Cited by 14
An Information Flow Tool for Gypsy
McHugh, J., & Good, D. L. (1985) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/sp.1985.10005 · Cited by 13
Probabilistic Confinement in a Declarative Framework
Pierro, A. D., Hankin, C., & Wiklicky, H. (2001) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00152-5 · Cited by 13
Information flow control in a parallel language framework
Banâtre, J.-P., & Bryce, C. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.1993.246640 · Cited by 11
Information flow in parallel programs: an axiomatic approach.
Reitman, R. P. (1978) · eCommons (Cornell University) · Cited by 10
Analysing Approximate Confinement under Uniform Attacks
Pierro, A. D., Hankin, C., & Wiklicky, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45789-5_23 · Cited by 9
An approach to information security in distributed systems
Bryce, C., Banâtre, J.-P., & Métayer, D. L. (2002) · IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS) · doi:10.1109/ftdcs.1995.525008 · Cited by 8
An information flow tool for Gypsy
McHugh, J. (2005) · doi:10.1109/acsac.2001.991536 · Cited by 7
Semantic Models for the Security of Sequential and Concurrent Programs
Sabelfeld, A. (2001) · Cited by 7
Self-citation
Security analysis using flow logics
Bodel, C., Degano, P., Nielson, F., & Nielson, H. R. (2001) · WORLD SCIENTIFIC eBooks · Cited by 7
Security Analysis using Flow Logics.
Bodei, C., Degano, P., Nielson, F., & Nielson, H. R. (2000) · Cited by 6
Trust and Dependence Analysis
Ørbæk, P. (1997) · Cited by 4
Proving Noninterference and Functional Correctness Using Traces
MCLEAN, J. A. J. (1992) · doi:10.21236/ada463011 · Cited by 3
On confidentiality and algorithms: programming under the constraints of noninterference
Agat, J., & Sands, D. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2001.924288 · Cited by 2
Secrecy for Mobile Implementations of Security Protocols
Giambiagi, P. (2001) · Cited by 1
Static Analysis and Software Assurance
Wagner, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-47764-0_25

Flagged first, then by citations

4 of the 164 references couldn’t be matched to a known paper.

Research works printed but not linked: 13

Barthe, Partial evaluation and noninterference for object calculi, LNCS 1722, 53
Lindholm, 1996, The Java Virtual Machine.
Fenton, 1973, Information protection systems
LaPadula, 1973, Secure Computer Systems: A Mathematical Model, MITRE Corp., Bedford, MA, MTR-2547, vol. 2, 4, 239
Cohen, 1978, Information transmission in sequential programs, 297
Mizuno, Information flow control in a distributed object-oriented system with statically-bound object variables, 56
Mizuno, A least fixed point approach to inter-procedural information flow control, 558
Giambiagi, 2002, Confidentiality for Implementations of Security Protocols.
Pierro, Approximate noninterference, 1
Sutherland, A model of information, 175
Leino, A semantic approach to secure information flow, LNCS 1422, 254
Thiemann, Enforcing security properties by type specialization, LNCS 2028
Abramksy, 1998, Game semantics

Sorted by citations

TaintDroid: an information-flow tracking system for realtime privacy monitoring on smartphones
Enck, W., Gilbert, P., Chun, B.-G., Cox, L. P., Jung, J., McDaniel, P. D., & Sheth, A. N. (2010) · doi:10.5555/1924943.1924971 · Cited by 2,259
Untitled work
Enck (2014) · doi:10.1145/2619091 · Cited by 1,203
All You Ever Wanted to Know about Dynamic Taint Analysis and Forward Symbolic Execution (but Might Have Been Afraid to Ask)
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2010) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2010.26 · Cited by 727
EnerJ
Sampson, A., Dietl, W., Fortuna, E., Gnanapragasam, D., Ceze, L., & Grossman, D. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993518 · Cited by 589
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 571

See all 1,907

Authors: Sabelfeld, A., & Myers, A. C.
Affiliations: Cornell University (US)
ORCID: Sabelfeld, A.
Myers, A.C.
Venue: IEEE Journal on Selected Areas in Communications
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Published: 2003-01
Volume: 21
Issue: 1
Pages: 5-19
ISSN: 0733-8716 (ISSN-L)
DOI: 10.1109/jsac.2002.806121
OpenAlex: W2122049982
Cited by: 1,907
References: 164
Citations by year: 2026: 29 · 2025: 38 · 2024: 45 · 2023: 43 · 2022: 50 · 2021: 65 · 2020: 56 · 2019: 87 · 2018: 67 · 2017: 83 · 2016: 77 · 2015: 101 · 2014: 135 · 2013: 105 · 2012: 122
FWCI: 97.28
Type: journal article
Language: en
Open access: closed
Licence: ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html (vor)
Locations: IEEE Journal on Selected Areas in Communications (publishedVersion)
Funders: Alfred P. Sloan Foundation
Topics: Physical Sciences › Computer Science › Hardware and Architecture › Security and Verification in Computing
Physical Sciences › Computer Science › Software › Logic, programming, and type systems
Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
Keywords: information flow security, confidentiality, static analysis, information flow policies, programming languages, policy enforcement, end-to-end security, open problems

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

Language-based information-flow security

Abstract

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Citations

Cites

Cited by

Related

Metadata

Record

About these checks