Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

6089 Computational Secrecy by Typing for the Pi Calculus
Home Policy Brochure Browse Search User Area Contact Help

Abadi, M. and Corin, R.J. and Fournet, C. (2006) Computational Secrecy by Typing for the Pi Calculus. In: The Fourth ASIAN Symposium on Programming Languages and Systems (APLAS 2006), 8 Nov - 10 Nov 2006, Sydney, Australia. pp. 253-269. Lecture Notes in Computer Science 4279. Springer Verlag. ISBN 3-540-48937-1

Full text available as:

- Univ. of Twente only
301 Kb

Official URL:

Exported to Metis


We define and study a distributed cryptographic implementation for an asynchronous pi calculus. At the source level, we adapt simple type systems designed for establishing formal secrecy properties. We show that those secrecy properties have counterparts in the implementation, not formally but at the level of bitstrings, and with respect to probabilistic polynomial-time active adversaries. We rely on compilation to a typed intermediate language with a fixed scheduling strategy. While we exploit interesting, previous theorems for that intermediate language, our result appears to be the first computational soundness theorem for a standard process calculus with mobile channels.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-DIES: Distributed and Embedded Security
Research Program:CTIT-ISTRICE: Integrated Security and Privacy in a Networked World
Research Project:Account: Accountability in Electronic Commerce Protocols
ID Code:6089
Deposited On:01 September 2006
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item