Security properties: two agents are sufficient

Hubert Comon-Lundh (1) , Véronique Cortier (2)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 CASSIS - Combination of approaches to the security of infinite states systems

We consider an important family of cryptographic protocols and a class of security properties which encompasses secrecy and authentication. We show that it is always sufficient to consider a bounded number of agents b (b=2 for secrecy properties for example): if there is an attack involving n agents, then there is an attack involving at most b agents.

Mots clés: cryptographic protocols; agents; secrecy; secret; authentification; authentication; protocoles cryptographiques

Domaines: Autre [cs.OH]

Hubert Comon-Lundh, Véronique Cortier. Security properties: two agents are sufficient. Science of Computer Programming, 2004, 50 (1-3), pp.51-71. ⟨inria-00099981⟩