University of Sussex
Browse
toplas03.ps (393.28 kB)

Information flow vs. resource access in the asynchronous pi-calculus

Download (393.28 kB)
journal contribution
posted on 2023-06-07, 14:10 authored by Matthew Hennessy, James Riely
We propose an extension of the asynchronous p-calculus in which a variety of security properties may be captured using types. These are an extension of the input/output types for the p-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 s cannot access resources with a security level higher than s. 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.

History

Publication status

  • Published

Journal

ACM Transactions on Programming Languages and Systems

ISSN

0164-0925

Publisher

ACM Press

Issue

5

Volume

24

Page range

566-591

Department affiliated with

  • Informatics Publications

Notes

Publisher's version available at official url

Full text available

  • Yes

Peer reviewed?

  • Yes

Legacy Posted Date

2008-02-27

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Exports