dezaghilpantvara08 (Article)
|
Author(s) | Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, Jovanka Pantovic and Daniele Varacca |
Title | « Security Types for Dynamic Web Data » |
Journal | Theoret. Comput. Sci. |
Number | 402 |
Page(s) | 156--171 |
Year | 2008 |
URL | http://www.di.unito.it/~dezani/papers/dgpv.pdf |
Abstract |
We describe a type system for the X calculus of Gardner and Maffeis. An X-network is a network of locations, where each location consists of both a data tree (which contains scripts and pointers to nodes in trees at different locations) and a process, for modelling process interaction, process migration and interaction between processes and data. Our type system is based on types for locations, data and processes, expressing security levels. A tree can store data of different security level, independently from the security level of the enclosing location. The access and mobility rights of a process depend on the security level of the ``source'' location of the process itself, i.e. of the location where the process was in the initial network or where the process was created by the activation of a script. The type system enjoys type preservation under reduction (subject reduction). In consequence of subject reduction we prove the following security properties. In a well-typed X-network, a process whose source location is of level can copy data of security level at most and update data of security level less than . Moreover, the process can only communicate data and go to locations of security level equal or less than . |
@article{dezaghilpantvara08,
number = {402},
author = {Mariangiola Dezani-Ciancaglini and Silvia Ghilezan and Jovanka
Pantovic and Daniele Varacca},
url = {http://www.di.unito.it/~dezani/papers/dgpv.pdf},
title = {{Security Types for Dynamic Web Data}},
abstract = {We describe a type system for the X$d\pi$ calculus of Gardner and
Maffeis. An X$d\pi$-network is a network of locations, where each
location consists of both a data tree (which contains scripts and
pointers to nodes in trees at different locations) and a process,
for modelling process interaction, process migration and
interaction between processes and data. Our type system is based
on types for locations, {data} and processes, expressing security
levels. {A tree can store data of different security level,
independently from the security level of the enclosing location.
The access and mobility rights of a process depend on the security
level of the ``source'' location of the process itself, i.e. of
the location where the process was in the initial network or where
the process was created by the activation of a script.} The type
system enjoys type preservation under reduction (subject
reduction). In consequence of subject reduction we prove the
following security properties. In a well-typed X$d\pi$-network, a
process $P$ whose source location is of level $h$ can copy data of
security level at most $h$ and update data of security level less
than $h$. Moreover, the process $P$ can only communicate data and
go to locations of security level equal or less than $h$.},
year = {2008},
journal = {Theoret. Comput. Sci.},
pages = {156--171},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)
