Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11944836_18 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
hash function,public key,random oracle,satisfiability | Journal | 2006 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-49994-6 | 30 |
PageRank | References | Authors |
1.25 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Véronique Cortier | 1 | 1135 | 56.32 |
| Steve Kremer | 2 | 116 | 3.64 |
| Ralf Küsters | 3 | 1014 | 69.62 |
| Bogdan Warinschi | 4 | 1514 | 68.98 |