 |
|
|
|
| HAL: inria-00448703, version 1 |
| See detailed view |  BibTeX,EndNote,... |
|
|
| 5th ACM Symposium on Information, Computer and Communications Security - ASIACCS 2010, Beijing : Chine (2010) |
|
|
|
|
| Cap Unification: Application to Protocol Security modulo Homomorphic Encryption |
|
|
| Siva Anantharaman 1Hai Lin |
|
|
| (2010-04) |
|
|
|
| We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and the intruder abilities as an equational theory. The problem of active intrusion -- such as whether a secret term can be derived, possibly via interaction with the honest participants of the protocol -- is then formulated as a Cap Unification problem. Cap Unification is an extension of Equational Unification: look for a cap to be placed on a given set of terms, so as to unify it with a given term modulo the equational theory. We give a decision procedure for Cap Unification, when the intruder capabilities are modeled as homomorphic encryption theory. Our procedure can be employed in a simple manner to detect attacks exploiting some properties of block ciphers. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
| 2: | CASSIS (INRIA Lorraine - LORIA / LIFC) |
|
|
|
INRIA – CNRS : UMR7503 – CNRS : FRE2661 – Université de Franche-Comté – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Computation and Language |
|
|
| Rewriting – Unification – Protocol – Secrecy Analysis |
|
| inria-00448703, version 1 | |
| http://hal.inria.fr/inria-00448703 | |
| oai:hal.inria.fr:inria-00448703 | |
| From: Siva Anantharaman | |
| Submitted on: Tuesday, 19 January 2010 17:51:17 | |
| Updated on: Wednesday, 27 January 2010 09:53:05 | |
