Specifying Authentication Protocols Using Rewriting and Strategies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Specifying Authentication Protocols Using Rewriting and Strategies


Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public-Key protocol is specified in \elan, the system developed in Nancy to model and compute in the rewriting calculus. The protocol aims to establish a mutual authentication between an initiator and a responder that communicate via an insecure network. The protocol has been shown to be vulnerable and a correction has been proposed. The behavior of the agents and of the intruders as well as the security invariants the protocol should verify are naturally described by conditional rewrite rules whose application is controlled by strategies. Similar attacks to those already described in the literature have been discovered. We show how different strategies using the same set of rewrite rules can improve the efficiency in finding the attacks and we compare our results to existing approaches.
No file

Dates and versions

inria-00100509 , version 1 (26-09-2006)


  • HAL Id : inria-00100509 , version 1


Horatiu Cirstea. Specifying Authentication Protocols Using Rewriting and Strategies. Third International Workshop on Practical Aspects of Declarative Languages - PADl'01, Mar 2001, Las Vegas, Nevada, USA, 15 p. ⟨inria-00100509⟩
83 View
0 Download


Gmail Facebook X LinkedIn More