Verification of security protocols with lists: From length one to unbounded length

Issue title: Security and Trust Principles

Guest editors: Pierpaolo DeganoGuest Editor and Joshua D. GuttmanGuest Editor

Article type: Research Article

Authors: Paiola, Miriam^{; *} | Blanchet, Bruno

Affiliations: INRIA Paris-Rocquencourt, Paris, France. E-mails: [email protected], [email protected]

Correspondence: [*] Corresponding author: Miriam Paiola, Inria, 23 avenue d'Italie, CS 81321, 75214 Paris Cedex 13, France. E-mail: [email protected]

Abstract: We present a novel, simple technique for proving secrecy properties for security protocols that manipulate lists of unbounded length, for an unbounded number of sessions. More specifically, our technique relies on the Horn clause approach used in the automatic verifier ProVerif: we show that if a protocol is proven secure by our technique with lists of length one, then it is secure for lists of unbounded length. Interestingly, this theorem relies on approximations made by our verification technique: in general, secrecy for lists of length one does not imply secrecy for lists of unbounded length. Our result can be used in particular to prove secrecy properties for group protocols with an unbounded number of participants and for some XML protocols (web services) with ProVerif.

Keywords: Verification, group protocols, symbolic model, secrecy, ProVerif

DOI: 10.3233/JCS-130471

Journal: Journal of Computer Security, vol. 21, no. 6, pp. 781-816, 2013