PaiolaBlanchetPOST12

Miriam Paiola and Bruno Blanchet, Verification of Security Protocols with Lists: from Length One to Unbounded Length. Lecture Notes in Computer Science, 2012, Volume 7215, Principles of Security and Trust, Pages 69-88.

Get the paper

Long version with proofs available: .pdf, 441.1Kb

The original publication is available at Springerlink

Links

ProVerif scritps:

The automatic verifier ProVerif is available here.

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.

Bibtex


 @INPROCEEDINGS{PaiolaBlanchetPOST13,
  AUTHOR = {Miriam Paiola and Bruno Blanchet},
  TITLE = {Verification of Security Protocols with Lists: 
	from Length One to Unbounded Length}, 
  BOOKTITLE = {Principles of Security and Trust (POST 2013)},
  PAGES = {69--88},
  YEAR = 2012,
  EDITOR = {Pierpaolo Degano and Joshua D. Guttman},
  VOLUME = 7215,
  SERIES = {Lecture Notes in Computer Science},
  ADDRESS = {Tallin, Estonia},
  MONTH = MAR,
  PUBLISHER = {Springer}
 }