Skip to Main content Skip to Navigation
Conference papers

Automatic Verification of Protocols with Lists of Unbounded Length

Abstract : We present a novel automatic technique for proving secrecy and authentication properties for security protocols that manipulate lists of unbounded length, for an unbounded number of sessions. This result is achieved by extending the Horn clause approach of the automatic protocol verifier ProVerif. We extend the Horn clauses to be able to represent lists of unbounded length. We adapt the resolution algorithm to handle the new class of Horn clauses, and prove the soundness of this new algorithm. We have implemented our algorithm and successfully tested it on several protocol examples, including XML protocols coming from web services.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00918849
Contributor : Ben Smyth <>
Submitted on : Sunday, December 15, 2013 - 5:05:48 PM
Last modification on : Friday, May 25, 2018 - 12:02:06 PM

Identifiers

Collections

Citation

Bruno Blanchet, Miriam Paiola. Automatic Verification of Protocols with Lists of Unbounded Length. CCS'13 - ACM Conference on Computer and Communications Security, ACM SIGSAC, Nov 2013, Berlin, Germany. pp.573--584, ⟨10.1145/2508859.2516679⟩. ⟨hal-00918849⟩

Share

Metrics

Record views

167