English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Automatic Verification of Cryptographic Protocols : A Logic Programming Approach

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Blanchet, Bruno1, Author           
Affiliations:
1Static Analysis, MPI for Informatics, Max Planck Society, ou_1116553              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2004-07-022003
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 520658
Other: Local-ID: C1256BDD001D715B-52C4DC76AD216E30C1256D9500557AB6-BlanchetPPDP2003
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Uppsala, Sweden
Start-/End Date: 2003-08-27 - 2003-08-29

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Fifth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP-03)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1 - 3 Identifier: ISBN: 1-58113-705-2