Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Just Fast Keying in the Pi Calculus Martin Abadi
 

Summary: Just Fast Keying in the Pi Calculus
Mart´in Abadi
University of California, Santa Cruz, and Microsoft Research
and
Bruno Blanchet
CNRS, ´Ecole Normale Sup´erieure, Paris
and
C´edric Fournet
Microsoft Research
JFK is a recent, attractive protocol for fast key establishment as part of securing IP commu-
nication. In this paper, we analyze it formally in the applied pi calculus (partly in terms of
observational equivalences, partly with the assistance of an automatic protocol verifier). We treat
JFK's core security properties, and also other properties that are rarely articulated and studied
rigorously, such as plausible deniability and resistance to denial-of-service attacks. In the course
of this analysis we found some ambiguities and minor problems, such as limitations in identity
protection, but we mostly obtain positive results about JFK. For this purpose, we develop ideas
and techniques that should be useful more generally in the specification and verification of security
protocols.
Categories and Subject Descriptors: C.2.0 [Computer-Communication Networks]: General--security and pro-
tection; C.2.2 [Computer-Communication Networks]: Network protocols--protocol verification; D.2.4 [Soft-

  

Source: Abadi, Martín - Department of Computer Science, University of California at Santa Cruz
Blanchet, Bruno - Département d'Informatique, École Normale Supérieure

 

Collections: Computer Technologies and Information Sciences