Nonmalleable Information Flow Control

被引:19
作者
Cecchetti, Ethan [1 ]
Myers, Andrew C. [1 ]
Arden, Owen [2 ,3 ]
机构
[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
[2] Univ Calif Santa Cruz, Dept Comp Sci, Santa Cruz, CA 95064 USA
[3] Harvard Univ, Cambridge, MA 02138 USA
来源
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY | 2017年
基金
美国国家科学基金会;
关键词
Downgrading; Information security; Security types;
D O I
10.1145/3133956.3134054
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Noninterference is a popular semantic security condition because it offers strong end-to-end guarantees, it is inherently compositional, and it can be enforced using a simple security type system. Unfortunately, it is too restrictive for real systems. Mechanisms for downgrading information are needed to capture real-world security requirements, but downgrading eliminates the strong compositional security guarantees of noninterference. We introduce nonmalleable information flow, a new formal security condition that generalizes noninterference to permit controlled downgrading of both confidentiality and integrity. While previous work on robust declassification prevents adversaries from exploiting the downgrading of confidentiality, our key insight is transparent endorsement, a mechanism for downgrading integrity while defending against adversarial exploitation. Robust declassification appeared to break the duality of confidentiality and integrity by making confidentiality depend on integrity, but transparent endorsement makes integrity depend on confidentiality, restoring this duality. We show how to extend a security-typed programming language with transparent endorsement and prove that this static type system enforces nonmalleable information flow, a new security property that subsumes robust declassification and transparent endorsement. Finally, we describe an implementation of this type system in the context of Flame, a flow-limited authorization plugin for the Glasgow Haskell Compiler.
引用
收藏
页码:1875 / 1891
页数:17
相关论文
共 46 条
[1]  
Abadi M., 1999, Conference Record of POPL '99. 26th ACM SIGPLAN-SIGACT. Symposium on Principles of Programming Languages, P147, DOI 10.1145/292540.292555
[2]  
Abadi M, 2008, LECT NOTES ARTIF INT, V5076, P96, DOI 10.1007/978-3-540-70525-3_9
[3]   Access control in a core calculus of dependency [J].
Abadi, Martin .
ACM SIGPLAN NOTICES, 2006, 41 (09) :263-273
[4]  
[Anonymous], 1992, 15 NAT COMP SEC C
[5]   A Calculus for Flow-Limited Authorization [J].
Arden, Owen ;
Myers, Andrew C. .
2016 IEEE 29TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2016), 2016, :135-149
[6]   Flow-Limited Authorization [J].
Arden, Owen ;
Liu, Jed ;
Myers, Andrew C. .
2015 IEEE 28TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM CSF 2015, 2015, :569-583
[7]  
Askarov Aslan, 2011, LOGICAL METHODS IN C, V7, P3
[8]  
Biba K. J., 1977, ESD76372 USAF EL SYS
[9]  
Broberg Niklas, 2010, 37 ACM S PRINC PROGR
[10]  
Buiras Pablo, 2015, 20 ACM SIGPLAN INT C, P289