Confining data and processes in global computing applications
โ Scribed by Rocco De Nicola; Daniele Gorla; Rosario Pugliese
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 587 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0167-6423
No coin nor oath required. For personal study only.
โฆ Synopsis
A programming notation is introduced that can be used for protecting secrecy and integrity of data in global computing applications. The approach is based on the explicit annotations of data and network nodes. Data are tagged with information about the allowed movements, network nodes are tagged with information about the nodes that can send data and spawn processes to them. The annotations are used to confine movements of data and processes. The approach is illustrated by applying it to three paradigmatic calculi for global computing, namely CKLAIM (a calculus at the basis of CKLAIM), Dฯ (a distributed version of the ฯ -calculus) and Mobile Ambients Calculus. For all of these formalisms, it is shown that their semantics guarantees that computations proceed only while respecting confinement constraints. Namely, it is proven that, after successful static type checking, data can reside at and cross only authorised nodes. "Local" formulations of this property where only relevant subnets type check are also presented. Finally, the theory is tested by using it to model secure behaviours of a UNIX-like multiuser system.
๐ SIMILAR VOLUMES
Javelin is a Java-based infrastructure for global computing. This paper presents Javelin++, an extension of Javelin, intended to support a much larger set of computational hosts. Contributions to scalability and fault tolerance are presented. This is the focus of the paper. Two scheduling schemes ar
A typical single course on dynamics and control is limited in the coverage that can be given to either topic. At Rensselaer, we have had separate one-semester courses on dynamic systems (process dynamics) and process control for a number of years. In this article, we discuss how MATLAB and SIMULINK
High-performance computing applications with data-driven communication and computation characteristics require synchronization routines in the form of eureka, barrier, or termination synchronization. In this paper, we consider termination synchronization for two different execution models, the AP an
This article is categorized under: Applications of Computational Statistics > Organizations and Publications