Deciding Recognizability under Dolev-Yao Intruder Model

被引:0
|
作者
Li, Zhiwei [1 ]
Wang, Weichao [1 ]
机构
[1] UNC Charlotte, Dept SIS, Charlotte, NC 28262 USA
来源
INFORMATION SECURITY | 2011年 / 6531卷
关键词
Security; Verification; Formal Methods; SECURITY;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The importance of reasoning about recognizability has recently been stressed in finding type flaw attacks, in which a protocol message may be forged from another message. However, the problem of deciding recognizability has never been fully exploited. To fill this gap, we present a terminating procedure to decide recognizability under the standard Dolev-Yao model. By incorporating the proposed procedure with Athena, a well-know security protocol verifier, our experiments succeed in finding potential type flaw attacks.
引用
收藏
页码:416 / 429
页数:14
相关论文
共 32 条