A simple approach to specifying concurrent systems
Communications of the ACM
Selected papers of the Second Workshop on Concurrency and compositionality
Authentication in distributed systems: theory and practice
ACM Transactions on Computer Systems (TOCS)
Authentication and authenticated key exchanges
Designs, Codes and Cryptography
A calculus of mobile processes, I
Information and Computation
Secure communication using remote procedure calls
ACM Transactions on Computer Systems (TOCS)
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A General Theory of Composition for a Class of "Possibilistic" Properties
IEEE Transactions on Software Engineering
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The AltaVista tunnel: using the Internet to extend corporate networks
Digital Technical Journal
A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
A calculus for cryptographic protocols
Information and Computation
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authentication primitives and their compilation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using encryption for authentication in large networks of computers
Communications of the ACM
Communication and Concurrency
Handbook of Applied Cryptography
Handbook of Applied Cryptography
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Protection in Programming-Language Translations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Implicit Typing à la ML for the Join-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Secure Implementation of Channel Abstractions
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Proving Trust in Systems of 2nd-Order Processes: Preliminary Results
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Design and implementation of modular key management protocol and IP secure tunnel on AIX
SSYM'95 Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Formal security analysis of basic network-attached storage
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Secure implementations of typed channel abstractions
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Preservation of epistemic properties in security protocol implementations
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
A secure compiler for session abstractions
Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
Channel abstractions for network security†
Mathematical Structures in Computer Science
Hiding names: private authentication in the applied pi calculus
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A formal implementation of value commitment
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Developing security protocols by refinement
Proceedings of the 17th ACM conference on Computer and communications security
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
Typed processes in untyped contexts
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
Ownership types for the join calculus
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Dynamic policy discovery with remote attestation
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Cryptographically sound implementations for communicating processes
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Computational secrecy by typing for the pi calculus
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Formally-Based black-box monitoring of security protocols
ESSoS'10 Proceedings of the Second international conference on Engineering Secure Software and Systems
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Fully abstract compilation to JavaScript
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hi-index | 0.00 |
Communication in distributed systems often relies on useful abstractions such as channels, remote procedure calls, and remote method invocations. The implementations of these abstractions sometimes provide security properties, in particular through encryption. In this paper we study those security properties, focusing on channel abstractions. We introduce a simple high-level language that includes constructs for creating and using secure channels. The language is a variant of the join-calculus and belongs to the same family as the pi-calculus. We show how to translate the high-level language into a lower-level language that includes cryptographic primitives. In this translation, we map communication on secure channels to encrypted communication on public channels. We obtain a correctness theorem for our translation; this theorem implies that one can reason about programs in the high-level language without mentioning the subtle cryptographic protocols used in their lower-level implementation. 2002 Elsevier Science (USA).