Information flow vs resource access in the asynchronous pi-calculus.
Item Type:Journal Article
Citation:Matthew Hennessy and James Riely., Information flow vs resource access in the asynchronous pi-calculus., ACM Transactions on Programming Languages and Systems, 24, 5, 2002, 556-591
information.pdf (Published (author's copy) - Peer Reviewed) 263.3Kb
We propose an extension of the asynchronous ?-calculus in which a variety of security properties may be captured using types. These are an extension of the input/output types for the ?-calculus in which I/O capabilities are assigned specific security levels. The main innovation is a uniform typing system that, by varying slightly the allowed set of types, captures different notions of security.We first define a typing system that ensures that processes running at security level ? cannot access resources with a security level higher than ?. The notion of access control guaranteed by this system is formalized in terms of a Type Safety Theorem.We then show that, by restricting the allowed types, our system prohibits implicit information flow from high-level to low-level processes. We prove that low-level behavior can not be influenced by changes to high-level behavior. This is formalized as a noninterference theorem with respect to may testing.
Author: HENNESSY, MATTHEW
Type of material:Journal Article
Series/Report no:ACM Transactions on Programming Languages and Systems;
Availability:Full text available