Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
复制标题
DOI:
10.1007/3-540-61042-1_43
复制
发表时间:
1996-03
期刊:
影响因子:
--
通讯作者:
G. Lowe
中科院分区:
文献类型:
--
作者:
G. Lowe
In this paper we analyse the well known Needham-Schroeder Public-Key Protocol using FDR, a refinement checker for CSP. We use FDR to discover an attack upon the protocol, which allows an intruder to impersonate another agent. We adapt the protocol, and then use FDR to show that the new protocol is secure, at least for a small system. Finally we prove a result which tells us that if this small system is secure, then so is a system of arbitrary size.