English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Automatic Proof of Strong Secrecy for Security Protocols

Blanchet, B. (2004). Automatic Proof of Strong Secrecy for Security Protocols. In 2004 IEEE Symposium on Security and Privacy (pp. 86-100). Piscataway, USA: IEEE.

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 new automatic technique for proving strong secrecy for security protocols. Strong secrecy means that an adversary cannot see any difference when the value of the secret changes. Our technique relies on an automatic translation of the protocol into Horn clauses, and a resolution algorithm on the clauses. It requires important extensions with respect to previous work for the proof of (standard) secrecy and authenticity. This technique can handle a wide range of cryptographic primitives, and yields proofs valid for an unbounded number of sessions and an unbounded message space; it is also flexible and efficient. We have proved its correctness, implemented it, and tested it on several examples of protocols including JFK (a proposed replacement for IPsec).

Details

show
hide
Language(s): eng - English
 Dates: 2004-05-102004
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 520661
Other: Local-ID: C1256BDD001D715B-CF5790F12295ED53C1256E900001A96E-Blanchet2004
 Degree: -

Event

show
hide
Title: S & P 2002
Place of Event: Oakland, USA
Start-/End Date: 2004-05-10 - 2004-05-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: 2004 IEEE Symposium on Security and Privacy
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Piscataway, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 86 - 100 Identifier: ISBN: 0-7695-2136-3