The University of Southampton
University of Southampton Institutional Repository

A Type Inference Algorithm for Secure Ambients

A Type Inference Algorithm for Secure Ambients
A Type Inference Algorithm for Secure Ambients
We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We present a bottom-up algorithm that, given an untyped process $P$, computes a minimal set of constraints on security levels such that all actions during runs of $P$ are performed without violating the security level priorities. Such an algorithm appears to be a prerequisite to use type systems to ensure security properties in the web scenario.
security levels, access control, ambient calculus, types
19 pp
Barbanera, F.
1b4d3842-40c3-406e-83ab-9df24588493e
Dezani, M.
2e61224f-bf6f-403f-8ada-589c0febe12a
Salvo, I.
dde74332-11ef-4b81-be1a-7e75b0ddd188
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Barbanera, F.
1b4d3842-40c3-406e-83ab-9df24588493e
Dezani, M.
2e61224f-bf6f-403f-8ada-589c0febe12a
Salvo, I.
dde74332-11ef-4b81-be1a-7e75b0ddd188
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7

Barbanera, F., Dezani, M., Salvo, I. and Sassone, V. (2001) A Type Inference Algorithm for Secure Ambients. Theory of Concurrency, Higher Order and Types, TOSCA Workshop 2001.. 19 pp .

Record type: Conference or Workshop Item (Paper)

Abstract

We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We present a bottom-up algorithm that, given an untyped process $P$, computes a minimal set of constraints on security levels such that all actions during runs of $P$ are performed without violating the security level priorities. Such an algorithm appears to be a prerequisite to use type systems to ensure security properties in the web scenario.

Text
BaDeSSa.pdf - Other
Download (249kB)

More information

Published date: 2001
Venue - Dates: Theory of Concurrency, Higher Order and Types, TOSCA Workshop 2001., 2001-01-01
Keywords: security levels, access control, ambient calculus, types
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 262286
URI: http://eprints.soton.ac.uk/id/eprint/262286
PURE UUID: 1d3be150-c417-42cc-9f5e-10520556532f

Catalogue record

Date deposited: 11 Apr 2006
Last modified: 14 Mar 2024 07:09

Export record

Contributors

Author: F. Barbanera
Author: M. Dezani
Author: I. Salvo
Author: V. Sassone

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×