Automatic Verification of Cryptographic Protocols : A Logic Programming Approach

Blanchet, Bruno

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

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

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

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

要旨

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.