Automatic Verification of Cryptographic Protocols : A Logic Programming Approach

Blanchet, Bruno

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Automatic Verification of Cryptographic Protocols : A Logic Programming Approach

MPS-Authors

/persons/resource/persons44141

Blanchet, Bruno
Static Analysis, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Blanchet, B. (2003). Automatic Verification of Cryptographic Protocols: A Logic Programming Approach. In Proceedings of the Fifth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP-03) (pp. 1-3). New York, USA: ACM.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2E9C-2

Abstract

We present a technique for cryptographic protocol verification, based on an intermediate representation of the protocol by a set of Horn clauses (a logic program). This technique makes it possible to verify security properties of the protocols, such as secrecy and authenticity, in a fully automatic way. Furthermore, the obtained security proofs are valid for an unbounded number of sessions of the protocol.