Network information flow

被引:0
作者
Gruska, Damas P. [1 ]
机构
[1] Comenius Univ, Inst Informat, Bratislava 84248, Slovakia
关键词
security; information flow; timing attack; interconnection network;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A formal model for an analysis of an information flow in interconnection networks is presented. It is based on timed process algebra which can express also network properties. The information flow is based on a concept of deducibility on composition. Robustness of systems against network timing attacks is defined. A variety of different security properties which reflect different security requirements are defined and investigated.
引用
收藏
页码:167 / 180
页数:14
相关论文
共 12 条
[1]  
Bossi A., 2003, P SEFM 03
[2]  
Bossi A, 2005, J COMPUT SECUR, V13, P391
[3]  
Dhem J.-F., 2000, LNCS, V1820
[4]  
Felten E. W., 2000, P ACM C COMP COMM SE, DOI [10.1145/352600.352606, DOI 10.1145/352600.352606]
[5]  
Focardi R, 2002, P IEEE CSFW, P307
[6]  
FOCARDI R, 2000, P 13 COMP SEC FDN WO
[7]  
Focardi R., 2001, LNCS, V2171, P331
[8]  
Gruska DP, 2001, FUND INFORM, V45, P359
[9]  
Handschuh H, 1999, LECT NOTES COMPUT SC, V1556, P306
[10]  
Kocher Paul, LECT NOTES COMPUTER, V1109, P104