Specifying and Verifying Information Flow Control in SELinux Configurations

被引:0
|
作者
Ceragioli, Lorenzo [1 ]
Galletta, Letterio [1 ]
Degano, Pierpaolo [1 ,2 ]
Basin, David [3 ]
机构
[1] IMT Sch Adv Studies Lucca, Lucca, Italy
[2] Univ Pisa, Pisa, Italy
[3] Swiss Fed Inst Technol, Zurich, Switzerland
关键词
Access control; information flow control; MODEL;
D O I
10.1145/3690636
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Security Enhanced Linux (SELinux) is a security architecture for Linux implementing Mandatory Access Control. It has been used in numerous security-critical contexts ranging from servers to mobile devices. However, its application is challenging as SELinux security policies are difficult to write, understand, and maintain. Recently, the intermediate language CIL was introduced to foster the development of high-level policy languages and to write structured configurations. Despite CIL's high level features, CIL configurations are hard to understand as different constructs interact in non-trivial ways. Moreover, there is no mechanism to ensure that a given configuration obeys desired information flow policies. To remedy this, we enrich CIL with a formal semantics, and we propose IFCIL, a backward compatible extension of CIL for specifying fine-grained information flow requirements. Using IFCIL, administrators can express confidentiality, integrity, and noninterference properties. We also provide a tool to statically verify these requirements and we experimentally assess it on ten real-world policies.
引用
收藏
页数:35
相关论文
共 50 条
  • [31] Towards formally specifying and verifying transactional memory
    Doherty, Simon
    Groves, Lindsay
    Luchangco, Victor
    Moir, Mark
    FORMAL ASPECTS OF COMPUTING, 2013, 25 (05) : 769 - 799
  • [32] Specifying and Verifying Concurrent C Programs with TLA
    Methni, Amira
    Lemerre, Matthieu
    Ben Hedia, Belgacem
    Haddad, Serge
    Barkaoui, Kamel
    FORMAL TECHNIQUES FOR SAFETY-CRITICAL SYSTEMS, FTSCS 2014, 2015, 476 : 206 - 222
  • [33] An Automata Based Approach for Verifying Information Flow Properties
    D'Souza, Deepak
    Raghavendra, K. R.
    Sprick, Barbara
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 135 (01) : 39 - 58
  • [34] Specifying and Verifying CRDT Protocols Using TLA+
    Ji Y.
    Wei H.-F.
    Huang Y.
    Lü J.
    Ruan Jian Xue Bao/Journal of Software, 2020, 31 (05): : 1332 - 1352
  • [35] Specifying and verifying interaction protocols in a temporal action logic
    Dipartimento di Informatica, Università del Piemonte Orientale, Alessandria, Italy
    不详
    不详
    J. Appl. Logic, 2007, 2 (214-234):
  • [36] Specifying and Verifying Sensor Networks: An Experiment of Formal Methods
    Dong, Jin Song
    Sun, Jing
    Sun, Jun
    Taguchi, Kenji
    Zhang, Xian
    FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2008, 5256 : 318 - +
  • [37] A Practical Approach to Specifying and Verifying Mobile Agent Algorithms
    Li, Xuhui
    Peng, Zhiyong
    Cao, Jiannong
    INTERNATIONAL JOURNAL OF PERVASIVE COMPUTING AND COMMUNICATIONS, 2005, 1 (02) : 113 - +
  • [38] Tutorial: Specifying, Implementing, and Verifying Algorithms for Persistent Memory
    Cepeda, Diego
    Chowdhury, Sakib
    Golab, Wojciech
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 549 - 549
  • [39] Formally specifying and verifying real-time systems
    Kemmerer, RA
    Kolano, PZ
    FIRST IEEE INTERNATIONAL CONFERENCE ON FORMAL ENGINEERING METHODS, PROCEEDINGS, 1997, : 112 - 120
  • [40] FreeSpec: Specifying, Verifying, and Executing Impure Computations in Coq
    Letan, Thomas
    Regis-Gianas, Yann
    CPP '20: PROCEEDINGS OF THE 9TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON CERTIFIED PROGRAMS AND PROOFS, 2020, : 32 - 46