Abstract
In the past few years a lot of attention has been paid to the use of special logics to analyse cryptographic protocols, foremost among these being the logic of Burrows, Abadi and Needham (the BAN logic). These logics have been successful in finding weaknesses in various examples. In this paper a limitation of the BAN logic is illustrated with two examples. These show that it is easy for the BAN logic to approve protocols that are in practice unsound.
Cite
CITATION STYLE
Boyd, C., & Mao, W. (1994). On a limitation of BAN logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 765 LNCS, pp. 240–247). Springer Verlag. https://doi.org/10.1007/3-540-48285-7_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
