Automatic verification of cryptographic protocols: a logic programming approach

Authors:
Bruno Blanchet
Affiliations:
CNRS, É/cole Normale Supé/rieure, Paris and Max-Planck-Institut f#&252/r Informatik, Saarbrü/cken
Venue:
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Year:
2003

Citing 11
Cited 8

A calculus for cryptographic protocols

Information and Computation
Using encryption for authentication in large networks of computers

Communications of the ACM
Mobile values, new names, and secure communication

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analyzing security protocols with secrecy types and logic programs

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
From Secrecy to Authenticity in Security Protocols

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
A Semantic Model for Authentication Protocols

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Verification of cryptographic Protocols: tagging enforces termination

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
New decidability results for fragments of first-order logic and application to cryptographic protocols

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Computer-assisted verification of a protocol for certified email

SAS'03 Proceedings of the 10th international conference on Static analysis
Handling encryption in an analysis for secure information flow

ESOP'03 Proceedings of the 12th European conference on Programming

A formal semantics for protocol narrations

Theoretical Computer Science
Towards an Independent Semantics and Verification Technology for the HLPSL Specification Language

Electronic Notes in Theoretical Computer Science (ENTCS)
Multi-Attacker Protocol Validation

Journal of Automated Reasoning
A typed specification for security protocols

DNCOCO'06 Proceedings of the 5th WSEAS international conference on Data networks, communications and computers
A formal semantics for protocol narrations

TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Security protocols verification in abductive logic programming: a case study

ESAW'05 Proceedings of the 6th international conference on Engineering Societies in the Agents World
Security protocol verification: symbolic and computational models

POST'12 Proceedings of the First international conference on Principles of Security and Trust
From model-checking to automated testing of security protocols: bridging the gap

TAP'12 Proceedings of the 6th international conference on Tests and Proofs

Quantified Score

Hi-index	0.00

Visualization

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.