Synthesizing secure protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Synthesizing secure protocols

Abstract

We propose a general transformation that maps a protocol secure in an extremely weak sense (essentially in a model where no adversary is present) into a protocol that is secure against a fully active adversary which interacts with an unbounded number of protocol sessions, and has absolute control over the network. The transformation works for arbitrary protocols with any number of participants, written with usual cryptographic primitives. Our transformation provably preserves a large class of security properties that contains secrecy and authenticity. An important byproduct contribution of this paper is a modular protocol development paradigm where designers focus their effort on an extremely simple execution setting -- security in more complex settings being ensured by our generic transformation. Conceptually, the transformation is very simple, and has a clean, well motivated design. Each message is tied to the session for which it is intended via digital signatures and on-the-fly generated session identifiers, and prevents replay attacks by encrypting the messages under the recipient's public key.
Fichier principal
Vignette du fichier
RR-6166.pdf (347.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00140932 , version 1 (10-04-2007)
inria-00140932 , version 2 (24-04-2007)

Identifiers

  • HAL Id : inria-00140932 , version 2

Cite

Véronique Cortier, Bogdan Warinschi, Eugen Zalinescu. Synthesizing secure protocols. [Research Report] RR-6166, INRIA. 2007, pp.32. ⟨inria-00140932v2⟩
116 View
216 Download

Share

Gmail Facebook X LinkedIn More