Computer Science – Cryptography and Security
Scientific paper
2007-06-04
LMCS 3 (3:2) 2007
Computer Science
Cryptography and Security
29 pages, published in LMCS
Scientific paper
10.2168/LMCS-3(3:2)2007
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.
Cortier Véronique
Rusinovitch Michael
Zalinescu Eugen
No associations
LandOfFree
Relating two standard notions of secrecy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Relating two standard notions of secrecy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relating two standard notions of secrecy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726939