Security properties: two agents are sufficient - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Science of Computer Programming Year : 2004

Security properties: two agents are sufficient

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.
No file

Dates and versions

inria-00099981 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099981 , version 1

Cite

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⟩
89 View
0 Download

Share

Gmail Facebook X LinkedIn More