Security properties: two agents are sufficient

Hubert Comon-Lundh 1 Véronique Cortier 2
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00099981
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:13:04 AM
Last modification on : Friday, July 6, 2018 - 3:06:10 PM

Identifiers

  • HAL Id : inria-00099981, version 1

Citation

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

Share

Metrics

Record views

207