Back to ProVerif
Xavier Allamigeon and Bruno Blanchet. Reconstruction of Attacks against Cryptographic Protocols. In 18th IEEE Computer Security Foundations Workshop (CSFW-18), pages 140-154, Aix-en-Provence, France, June 2005. IEEE Computer Society. Tool feature

Get the paper

.ps.gz, 147 Kb, .pdf, 187 Kb


Long version with proof sketches


We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded number of sessions of the protocol. However, up to now, it gave no definite information when the proof failed. In this paper, we present an algorithm for reconstructing an attack against the protocol when the desired security property does not hold. We have proved soundness, termination, as well as a partial completeness result for our algorithm. We have also implemented it in the automatic protocol verifier ProVerif. As an extreme example, we could reconstruct an attack involving 200 parallel sessions against the f200g200 protocol.


  AUTHOR = {Xavier Allamigeon and Bruno Blanchet},
  TITLE = {Reconstruction of {A}ttacks against {C}ryptographic {P}rotocols},
  BOOKTITLE = {18th IEEE Computer Security Foundations Workshop (CSFW-18)},
  PAGES = {140--154},
  YEAR = 2005,
  ADDRESS = {Aix-en-Provence, France},
  PUBLISHER = {IEEE Computer Society}