On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Information and Computation
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulations in the join-calculus
Theoretical Computer Science
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Secure implementation of channel abstractions
Information and Computation
Proof Techniques for Cryptographic Processes
SIAM Journal on Computing
Protection in Programming-Language Translations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
From Secrecy to Authenticity in Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
Analyzing security protocols with secrecy types and logic programs
Journal of the ACM (JACM)
Typed processes in untyped contexts
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
A fully abstract encoding of the π-calculus with data terms
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A type system for discretionary access control†
Mathematical Structures in Computer Science
Static vs dynamic typing for access control in pi-calculus
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
AnBx: security protocols design and verification
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Timed migration and interaction with access permissions
FM'11 Proceedings of the 17th international conference on Formal methods
Hi-index | 0.00 |
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.