Sciweavers

Share
FSTTCS
2006
Springer

Computationally Sound Symbolic Secrecy in the Presence of Hash Functions

11 years 10 months ago
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper we devise and motivate a more appropriate secrecy criterion which exactly captures a standard cryptographic notion of secrecy for protocols involving public-key enryption and hash functions: protocols that satisfy it are computationally secure while any violation of our criterion directly leads to an attack. Furthermore, we prove that our criterion is decidable via an NP decision procedure. Our results hold for standard security notions for encryption and hash functions modeled as random oracles.
Véronique Cortier, Steve Kremer, Ralf K&uum
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2006
Where FSTTCS
Authors Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
Comments (0)
books