Verification of Security Protocols With Lists: From Length One to Unbounded Length

The authors 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, their technique relies on the Horn clause approach used in the automatic verifier ProVerif: they show that if a protocol is proven secure by their technique with lists of length one, then it is secure for lists of unbounded length. Interestingly, this theorem relies on approximations made by their verification technique: in general, secrecy for lists of length one does not imply secrecy for lists of unbounded length.

Provided by: INRIA Topic: Security Date Added: Jan 2012 Format: PDF

Find By Topic