Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Automated Verification of Selected Equivalences for Security Protocols
 

Summary: Automated Verification of Selected Equivalences
for Security Protocols
Bruno Blanchet
CNRS, ´Ecole Normale Sup´erieure, Paris
Mart´in Abadi
University of California, Santa Cruz
and Microsoft Research, Silicon valley
C´edric Fournet
Microsoft Research, Cambridge
July 11, 2007
Abstract
In the analysis of security protocols, methods and tools for reasoning about
protocol behaviors have been quite effective. We aim to expand the scope of those
methods and tools. We focus on proving equivalences P Q in which P and Q
are two processes that differ only in the choice of some terms. These equivalences
arise often in applications. We show how to treat them as predicates on the be-
haviors of a process that represents P and Q at the same time. We develop our
techniques in the context of the applied pi calculus and implement them in the tool
ProVerif.
1 Introduction

  

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