Modular plans for secure service composition

  • Authors:

  • Gabriele Costa;Pierpaolo Degano;Fabio Martinelli

  • Affiliations:

  • Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche and Dipartimento di Informatica, Università di Pisa;Dipartimento di Informatica, Università di Pisa;Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche

  • Venue:
  • ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
  • Year:
  • 2010

Quantified Score

Hi-index 0.03

Visualization

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.