安全服务编排的类型和效果

19th IEEE Computer Security Foundations Workshop (CSFW'06) Pub Date : 2006-07-05 DOI:10.1109/CSFW.2006.31

Massimo Bartoletti, P. Degano, G. Ferrari

{"title":"安全服务编排的类型和效果","authors":"Massimo Bartoletti, P. Degano, G. Ferrari","doi":"10.1109/CSFW.2006.31","DOIUrl":null,"url":null,"abstract":"A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security constraints that make their composition safe. A static approach is then proposed to determine how to compose services and guarantee that their execution is always secure, without resorting to any dynamic check","PeriodicalId":131951,"journal":{"name":"19th IEEE Computer Security Foundations Workshop (CSFW'06)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Types and effects for secure service orchestration\",\"authors\":\"Massimo Bartoletti, P. Degano, G. Ferrari\",\"doi\":\"10.1109/CSFW.2006.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security constraints that make their composition safe. A static approach is then proposed to determine how to compose services and guarantee that their execution is always secure, without resorting to any dynamic check\",\"PeriodicalId\":131951,\"journal\":{\"name\":\"19th IEEE Computer Security Foundations Workshop (CSFW'06)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"19th IEEE Computer Security Foundations Workshop (CSFW'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSFW.2006.31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th IEEE Computer Security Foundations Workshop (CSFW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSFW.2006.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 33

摘要

提出了一种用于描述服务网络的分布式演算方法。通过指定使其组合安全的安全约束，我们通过按属性调用机制为服务交互建模。然后，提出了一种静态方法来确定如何组合服务并保证其执行始终是安全的，而无需诉诸任何动态检查

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Types and effects for secure service orchestration

A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security constraints that make their composition safe. A static approach is then proposed to determine how to compose services and guarantee that their execution is always secure, without resorting to any dynamic check

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

19th IEEE Computer Security Foundations Workshop (CSFW'06)

自引率

0.00%

发文量