We present a logic for analyzing cryptographic protocols. This logic encompasses a
unification of four of its predecessors in the BAN family of logics, namely those given by Li …

Logics for cryptographic protocol analysis are presented and a study is made of the protocol
features that they are appropriate for analyzing some are appropriate for analyzing trust …

The pioneering and well-known work of M. Burrows, M. Abadi and R. Needham (1989),(the
BAN logic) which dominates the area of security protocol analysis is shown to take an …

We present a logic for analyzing cryptographic protocols. This logic is based on a unification
of four of its predecessors in the BAN family of logics, namely those given in GNY90, AT91 …

We develop a model of computation for the NRL Protocol Analyzer by modifying and
extending the model of computation for Burrows, Abadi, and Needham (BAN) logic (M …

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 …

In a recent paper [1], Burrows, Abadi and Needham propose a logic for the analysis of
authentication protocols. Formulated as a collection of notational constructs acted upon by …

In [BAN89] Burrows, Abadi, and Needham presented a logic (BAN) for analyzing
cryptographic protocols in terms of belief. This logic is quite useful in uncovering flaws in …

This paper describes a Higher Order Logic (HOL) theory formalizing an extended version of
the Gong, Needham, Yahalom (GNY) belief logic, a theory used by software that …

In this paper, we examine current approaches and the state of the art in the application of
formal methods to the analysis of cryptographic protocols. We use Meadows' classification of …