Exploring the BAN approach to protocol analysis

Abstract

The BAN approach to analysis of cryptographic protocols (M. Burrows et al., 1988) transforms a correctness requirement into a proof obligation of a formal belief logic. It is shown that the BAN protocol annotation rules make flaws due solely to protocol step permutation undetectable by the BAN logic. This is illustrated by a short example. In the style of BAN logic, the author defines the concept of a terminating idealized protocol. BAN logic has been used to prove the correctness of an insecure protocol (D. Nessett, 1990). The author shows that this protocol belongs to the class of nonterminating protocols.<>