 |
 |
|
|
| HAL: inria-00426620, version 1 |
| DOI: 10.1016/j.ic.2008.12.005 |
| See detailed view |  BibTeX,EndNote,... |
 |
| Information and Computation 207, 4 (2009) 496-520 |
|
|
|
|
| Computationally Sound Implementations of Equational Theories against Passive Adversaries |
|
|
| Mathieu BaudetVéronique Cortier 1 |
|
|
| (2009) |
|
|
|
| In this paper we study the link between formal and cryptographic models for security protocols in the presence of passive adversaries. In contrast to other works, we do not consider a fixed set of primitives but aim at results for arbitrary equational theories. We define a framework forcomparing a cryptographicimplementation and its idealization with respect to various security notions. In particular, we concentrate on the computational soundness of static equivalence, a standard tool in cryptographic pi calculi. We present a soundness criterion, which for many theories is not only sufficient but also necessary. Finally, to illustrate our framework, we establish the soundness of static equivalence for the exclusive OR and a theory of ciphers and lists. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | CASSIS (INRIA Lorraine - LORIA / LIFC) |
|
|
|
INRIA – CNRS : FRE2661 – Université de Franche-Comté – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL) |
|
|
| 2: | Laboratoire Spécification et Vérification [Cachan] (LSV) |
|
|
|
CNRS : UMR8643 – INRIA – École normale supérieure de Cachan - ENS Cachan |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Cryptography and Security |
| inria-00426620, version 1 | |
| http://hal.inria.fr/inria-00426620 | |
| oai:hal.inria.fr:inria-00426620 | |
| From: Véronique Cortier | |
| Submitted on: Tuesday, 27 October 2009 09:33:30 | |
| Updated on: Monday, 9 November 2009 17:03:29 | |
