Language Design for Computationally Sound Communications Abstractions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Language Design for Computationally Sound Communications Abstractions


We are interested in computationally sound implementations for languages of distributed communicating processes, with secure high-level primitives for authentication and secrecy, but without explicit cryptography. We develop such an implementation for a variant of the pi calculus [6]. In this language, security properties can be studied using traces and equivalences that account for the presence of an arbitrary (abstract) adversary that controls the network. The cryptographic implementation of the language uses standard primitives and assumptions; it guarantees that these abstract properties also hold in a concrete, distributed setting, against probabilistic polynomial-time active adversaries. At FCC'06, we intend to review and discuss the design space for programming languages with cryptographically sound implementations. In particular, we motivate some unusual design choices for our language, we discuss its current limitations, and we consider possible extensions.
Fichier principal
Vignette du fichier
paper3.pdf (55.66 Ko) Télécharger le fichier

Dates and versions

inria-00080672 , version 1 (20-06-2006)


  • HAL Id : inria-00080672 , version 1


Pedro Adao, Cédric Fournet. Language Design for Computationally Sound Communications Abstractions. Workshop on Formal and Computational Cryptography (FCC 2006), Véronique Cortier et Steve Kremer, Jul 2006, Venice/Italy. ⟨inria-00080672⟩


59 View
29 Download


Gmail Facebook Twitter LinkedIn More