Secure implementations of typed channel abstractions

• DOI: 10.1145/1190215.1190253
• Publication Date: 2007-04-05T19:52:18Z
• Authors: Michele Bugliesi; Marco Giunti
• Keywords: 0202 electrical engineering, electronic engineering, information engineering; Typed Behavioral Theories; Language Encodings; Full Abstraction; 0102 computer and information sciences; 02 engineering and technology; 01 natural sciences

The challenges hidden in the implementation of high-level process calculi into low-level environments are well understood [3]. This paper develops a secure implementation of a typed pi calculus, in which capability types are employed to realize the policies for the access to communication channels. Our implementation compiles high-level processes of the pi-calculus into low-level principals of a cryptographic process calculus based on the applied-pi calculus [1]. In this translation, the high-level type capabilities are implemented as term capabilities protected by encryption keys only known to the intended receivers. As such, the implementation is effective even when the compiled, low-level principals are deployed in open contexts for which no assumption on trust and behavior may be made. Our technique and results draw on, and extend, previous work on secure implementation of channel abstractions in a dialect of the join calculus [2]. In particular, our translation preserves the forward secrecy of communications in a calculus that includes matching and supports the dynamic exchange of write and read access-rights among processes. We establish the adequacy and full abstraction of the implementation by contrasting the untyped equivalences of the low-level cryptographic calculus, with the typed equivalences of the high-level source calculus.