Relating two standard notions of secrecy - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2007

Relating two standard notions of secrecy


Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never be disclosed while equivalence-based secrecy states that two executions of a protocol with distinct instances for s should be indistinguishable to an attacker. Although the second formulation ensures a higher level of security and is closer to cryptographic notions of secrecy, decidability results and automatic tools have mainly focused on the first definition so far. This paper initiates a systematic investigation of the situations where syntactic secrecy entails strong secrecy. We show that in the passive case, reachability-based secrecy actually implies equivalence-based secrecy for digital signatures, symmetric and asymmetric encryption provided that the primitives are probabilistic. For active adversaries, we provide sufficient (and rather tight) conditions on the protocol for this implication to hold.

Dates and versions

inria-00178352 , version 1 (10-10-2007)



Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu. Relating two standard notions of secrecy. Logical Methods in Computer Science, 2007, 3 (3, paper 2), pp.1-29. ⟨10.2168/LMCS-3(3:2)2007⟩. ⟨inria-00178352⟩
51 View
0 Download



Gmail Facebook Twitter LinkedIn More