MPI-I-2004-NWG1-001
Automatic proof of strong secrecy for security protocols
Blanchet, Bruno
July 2004, 78 pages.
.
Status: available - back from printing
We present a new automatic technique for proving strong secrecy
for security protocols. Strong secrecy means that an adversary cannot
see any difference when the value of the secret changes. Our technique
relies on an automatic translation of the protocol into Horn clauses,
and a resolution algorithm on the clauses. Applying this technique
to strong secrecy requires important
extensions with respect to previous work for the proof of (standard)
secrecy and authenticity. This technique can handle a wide range of
cryptographic primitives, and yields proofs valid for an unbounded
number of sessions and an unbounded message space; it is also flexible
and efficient. We have proved its correctness, implemented it,
and tested it on several examples of protocols including JFK
(a proposed replacement for IKE in IPsec).
-
- Attachement: MPI-I-2004-NWG1-001.ps (737 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2004-NWG1-001
BibTeX
@TECHREPORT{Blanchet2004,
AUTHOR = {Blanchet, Bruno},
TITLE = {Automatic proof of strong secrecy for security protocols},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-2004-NWG1-001},
MONTH = {July},
YEAR = {2004},
ISSN = {0946-011X},
}