Security in a Model for Long-running Transactions

被引:0
作者
Gruska, Damas P. [1 ]
Maggiolo-Schettini, Andrea [2 ]
Milazzo, Paolo [2 ]
机构
[1] Comenius Univ, Inst Informat, Bratislava 84248, Slovakia
[2] Univ Pisa, Dipartimento Informat, I-56127 Pisa, Italy
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Communicating Hierarchical Transaction-based Timed Automata have been introduced to model systems performing long-running transactions. Here, for these automata a Security concept is introduced. which is based on a notion of opacity and on the assumption that in attacker can not only observe public system activities, but also cause abortion of some of them. Different intruder capabilities as well as different kinds of opacity are defined and the resulting security properties are investigated. Security of long-running transactions is defined by the mentioned notion of opacity and conditions for compositionality are established.
引用
收藏
页码:189 / 203
页数:15
相关论文
共 13 条
[1]  
Alur R., 1994, THEORETICAL COMPUTER, V126
[2]  
Bryans J., 2004, P 2 INT WORKSH SEC I
[3]  
Bryans J., 2006, LNCS, V3866
[4]  
Busi N., 2004, LNCS, V3099
[5]  
Dhem J.-F., 2000, LNCS, V1820
[6]  
Felten E. W., 2000, P 7 ACM C COMP COMM
[7]  
Goguen J.A., 1982, P IEEE S SEC PRIV
[8]  
GORRIERI R, 2004, SCI COMPUTER PROGRAM, V50
[9]  
HANDSCHUH H, 1999, LNCS, V1556
[10]  
KOCHER P, 1996, LNCS, V1109