Modular plans for secure service composition

Issue title: ARSPA-WITS'10

Guest editors: Alessandro ArmandoEditor and Gavin LoweEditor

Article type: Research Article

Authors: Costa, Gabriele^{a; b} | Degano, Pierpaolo^b | Martinelli, Fabio^a

Affiliations: [a] Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, Pisa, Italy | [b] Dipartimento di Informatica, Università di Pisa, Pisa, Italy

Abstract: Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for requests from clients and they often result from the composition of many (sub-)services. We address here the problem of statically guaranteeing security of open services, i.e., services with unknown components. Security constraints are expressed by policies that service components must obey. We present here a type and effect system that safely over-approximates the possible run-time behaviour of open services, collecting partial information on the behaviour of their components. From such an approximation, we then extract a (partial) plan that drives executions of an open system that raises no security violations when plugged in any context.

Keywords: Secure service composition, language-based security, open networks

DOI: 10.3233/JCS-2011-0430

Journal: Journal of Computer Security, vol. 20, no. 1, pp. 81-117, 2012