Skip to Main content Skip to Navigation
Conference papers

Language Design for Computationally Sound Communications Abstractions

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Véronique Cortier Connect in order to contact the contributor
Submitted on : Tuesday, June 20, 2006 - 3:03:51 PM
Last modification on : Tuesday, June 20, 2006 - 3:27:50 PM
Long-term archiving on: : Monday, April 5, 2010 - 11:06:21 PM


  • 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⟩



Record views


Files downloads