DMCA
Computationally sound implementations of equational theories against passive adversaries (2008)
Cached
Download Links
| Citations: | 59 - 14 self |
BibTeX
@MISC{Baudet08computationallysound,
author = {Mathieu Baudet and Véronique Cortier and Steve Kremer},
title = {Computationally sound implementations of equational theories against passive adversaries},
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 for comparing a cryptographic implementation 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.
Keyphrases
sound implementation equational theory static equivalence arbitrary equational theory passive adversary cryptographic implementation fixed set various security notion standard tool many theory cryptographic pi calculus computational soundness security protocol cryptographic model soundness criterion
