Article

Secure information flow and program logics

Authors:

Lennart Beringer,

Martin HofmannAuthors Info & Claims

CSF '07: Proceedings of the 20th IEEE Computer Security Foundations Symposium

Pages 233 - 248

https://doi.org/10.1109/CSF.2007.30

Published: 06 July 2007 Publication History

Publisher Site

Abstract

We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-line non-interference, multi-level security and flow sensitivity for a while language, we show how typing derivations may be used to automatically generate proofs in the program logic that certify the absence of illicit flows. In addition, we present proof rules for baseline non-interference for object-manipulating instructions, As a consequence, standard verification technology may be used for verifying that a concrete program satisfies the noninterference property. Our development is based on a formalisation of the encodings in Isabelle/HOL.

Cited By

View all

Filinski ALarsen KJensen T(2024)Axiomatising an information flow logic based on partial equivalence relationsInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-024-00756-z26:4(445-461)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10009-024-00756-z
Nagasamudram RNaumann DGorla D(2021)Alignment completeness for relational hoare logicsProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470690(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470690
Ghosal SShyamasundar RJuristo N(2021)An axiomatic approach to detect information leaks in concurrent programsProceedings of the 43rd International Conference on Software Engineering: New Ideas and Emerging Results10.1109/ICSE-NIER52604.2021.00015(31-35)Online publication date: 25-May-2021
https://dl.acm.org/doi/10.1109/ICSE-NIER52604.2021.00015
Show More Cited By

Index Terms

Secure information flow and program logics

Recommendations

Intuitionistic Trilattice Logics

We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN₃ introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and ...
Expressivity of Imperfect Information Logics without Identity

In this article we investigate the family of independence-friendly (IF) logics in the equality-free setting, concentrating on questions related to expressive power. Various natural equality-free fragments of logics in this family translate into ...
Completing Herbelin's programme
TLCA'07: Proceedings of the 8th international conference on Typed lambda calculi and applications

In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the λ-calculus, specifically a variant which manipulates ...

Comments

Information & Contributors

Information

Published In

CSF '07: Proceedings of the 20th IEEE Computer Security Foundations Symposium

July 2007

394 pages

ISBN:0769528198

Publisher

IEEE Computer Society

United States

Publication History

Published: 06 July 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Filinski ALarsen KJensen T(2024)Axiomatising an information flow logic based on partial equivalence relationsInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-024-00756-z26:4(445-461)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10009-024-00756-z
Nagasamudram RNaumann DGorla D(2021)Alignment completeness for relational hoare logicsProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470690(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470690
Ghosal SShyamasundar RJuristo N(2021)An axiomatic approach to detect information leaks in concurrent programsProceedings of the 43rd International Conference on Software Engineering: New Ideas and Emerging Results10.1109/ICSE-NIER52604.2021.00015(31-35)Online publication date: 25-May-2021
https://dl.acm.org/doi/10.1109/ICSE-NIER52604.2021.00015
Grimm NMaillard KFournet CHriţcu CMaffei MProtzenko JRamananandro TRastogi ASwamy NZanella-Béguelin SAndronick JFelty A(2018)A monadic framework for relational verification: applied to information security, program equivalence, and optimizationsProceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3167090(130-145)Online publication date: 8-Jan-2018
https://dl.acm.org/doi/10.1145/3167090
Aguirre ABarthe GGaboardi MGarg DStrub P(2017)A relational logic for higher-order programsProceedings of the ACM on Programming Languages10.1145/31102651:ICFP(1-29)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110265
Barthe GGrégoire BHsu JStrub P(2017)Coupling proofs are probabilistic product programsACM SIGPLAN Notices10.1145/3093333.300989652:1(161-174)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3093333.3009896
Barthe GGrégoire BHsu JStrub PCastagna GGordon A(2017)Coupling proofs are probabilistic product programsProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009896(161-174)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1145/3009837.3009896
Amtoft TDodds JZhang ZAppel ABeringer LHatcliff JOu XCousino A(2012)A certificate infrastructure for machine-checked proofs of conditional information flowProceedings of the First international conference on Principles of Security and Trust10.1007/978-3-642-28641-4_20(369-389)Online publication date: 24-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28641-4_20
Beringer L(2011)Relational decompositionProceedings of the Second international conference on Interactive theorem proving10.5555/2033939.2033947(39-54)Online publication date: 22-Aug-2011
https://dl.acm.org/doi/10.5555/2033939.2033947
Barthe GKunz C(2011)An Abstract Model of Certificate TranslationACM Transactions on Programming Languages and Systems10.1145/1985342.198534433:4(1-46)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1145/1985342.1985344
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Intuitionistic Trilattice Logics

Expressivity of Imperfect Information Logics without Identity

Completing Herbelin's programme

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations