We use a distributed, enriched λ-calculus for describing networks of services. Both services and their clients can protect themselves, by imposing security constraints on each other's behaviour. Then, service Interaction results in a call-by-property mechanism, that matches the client requests with service's. A static approach is also described, that determines how to compose services while guaranteeing that their execution Is always secure, without resorting to any dynamic check. © IFIP International Federation for Information Processing 2006.
CITATION STYLE
Bartoletti, M., Degano, P., & Ferrari, G. L. (2006). Security issues in service composition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4037 LNCS, pp. 1–16). Springer Verlag. https://doi.org/10.1007/11768869_1
Mendeley helps you to discover research relevant for your work.