Modular Plans for Secure Service Composition

Abstract : Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from the composition of many services. We address here the problem of statically guaranteeing security of open services, i.e. services with unknown components. Security constraints are expressed by local policies that service components must obey. We present here a type and effect system that safely over-approximates, in the form of history expressions, the possible run-time behaviour of open services, collecting partial information on the behaviours of their components. From a history expression, we then extract a plan that drives executions that never rise security violations. Finally, we show how partial plans satisfying security requirements can be put together to obtain a safe orchestration plan.
Type de document :
Communication dans un congrès
Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, Mar 2010, Paphos, Cyprus. pp.41-58, 2011, 〈10.1007/978-3-642-16074-5_4〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00536652
Contributeur : Emmanuelle Grousset <>
Soumis le : jeudi 18 novembre 2010 - 14:02:29
Dernière modification le : vendredi 19 novembre 2010 - 09:17:00
Document(s) archivé(s) le : samedi 19 février 2011 - 02:47:20

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Gabriele Costa, Pierpaola Degano, Fabio Martinelli. Modular Plans for Secure Service Composition. Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, Mar 2010, Paphos, Cyprus. pp.41-58, 2011, 〈10.1007/978-3-642-16074-5_4〉. 〈inria-00536652〉

Partager

Métriques

Consultations de la notice

84

Téléchargements de fichiers

146