Timing-Sensitive Noninterference through Composition

被引:6
作者
Rafnsson, Willard [1 ]
Jia, Limin [2 ]
Bauer, Lujo [2 ]
机构
[1] Max Planck Inst Software Syst, Saarbrucken, Germany
[2] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
来源
PRINCIPLES OF SECURITY AND TRUST (POST 2017) | 2017年 / 10204卷
基金
美国国家科学基金会;
关键词
INFORMATION-FLOW; ATTACKS;
D O I
10.1007/978-3-662-54455-6_1
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Sound compositional reasoning principles are the foundation for analyzing the security properties of complex systems. We present a general theory for compositional reasoning about the information-flow security of interactive discrete-timed systems. We develop a simple core-and with it, a language-of combinators, including ones that orchestrate the execution of a collection of interactive systems. We establish conditions under which timing-sensitive noninterference is preserved through composition, for each combinator in our language. To demonstrate the practicality of our theory, we model secure multi-execution (SME) using our combinators. Through this, we show that our theory makes it straightforward 1) to prove, through compositional reasoning, that complex systems are free of external timing channels, and 2) to identify sub-components that cause information leakage of a composite system.
引用
收藏
页码:3 / 25
页数:23
相关论文
共 48 条
[1]  
Agat J., 2000, POPL
[2]  
[Anonymous], 1989, CWI-Quarterly
[3]  
[Anonymous], B EUR ASS THEOR COMP
[4]  
Askarov A., 2010, CCS
[5]  
Askarov A., 2015, CSF
[6]  
Askarov A, 2009, CSF
[7]  
Askarov A, 2008, LECT NOTES COMPUT SC, V5283, P333
[8]   Remote timing attacks are practical [J].
Brumley, D ;
Boneh, D .
COMPUTER NETWORKS, 2005, 48 (05) :701-716
[9]  
Clark D., 2008, FAST
[10]  
Corradini F., 1999, Fundamenta Informaticae, V38, P377