On the Properties of Cryptographic Protocols and the Weaknesses of the BAN-like logics

Abstract

The researches on the cryptographic protocols, especially on the formal analysis methods, have been paid much attention to in the last two decades. However, the formal methods already presented can not perfectly prove a protocol really secure. In this paper, we unfold the properties that cryptographic protocols should possess and then prove, with respect to which, that the BAN-like logic tools have only limited capacity for proving a protocol really secure.