Security properties: two agents are sufficient

Security properties: two agents are sufficient. Hubert Comon-Lundh and Véronique Cortier. In Proceedings of the 12th European Symposium on Programming (ESOP'03), pp. 99–113, Lecture Notes in Computer Science 2618, Springer, Warsaw, Poland, April 2003.

Download

[PDF] [PS]

Abstract

We consider arbitrary cryptographic protocols and security properties. We show that it is always sufficient to consider a bounded number of agents b (actually b = 2 in most of the cases): if there is an attack involving n agents, then there is an attack involving at most b agents.

BibTeX

@inproceedings{esop03,
  address =       {Warsaw, Poland},
  author =        {Comon{-}Lundh, Hubert and Cortier, V{\'e}ronique},
  booktitle =     {{P}roceedings of the 12th {E}uropean {S}ymposium on
                   {P}rogramming ({ESOP}'03)},
  editor =        {Degano, Pierpaolo},
  month =         apr,
  pages =         {99-113},
  publisher =     {Springer},
  series =        {Lecture Notes in Computer Science},
  title =         {Security properties: two agents are sufficient},
  volume =        {2618},
  year =          {2003},
  abstract = {We consider arbitrary cryptographic protocols and security properties. We show that it is always sufficient to consider a bounded number of agents b (actually b = 2 in most of the cases): if there is an attack involving n agents, then there is an attack involving at most b agents.},
}