Privacy aware service selection of composite web services invited paper

A. Squicciarini, B. Carminati, Sushama Karumanchi
{"title":"Privacy aware service selection of composite web services invited paper","authors":"A. Squicciarini, B. Carminati, Sushama Karumanchi","doi":"10.4108/ICST.COLLABORATECOM.2013.254264","DOIUrl":null,"url":null,"abstract":"Web service selection involves finding services from a possibly huge database of similar services. Hence, the challenges involved in finding a suitable service include large time consumption, and difficulty of finding a perfect match according to the user specified search keywords. In addition, significant privacy and security concerns arise, as the information involved with service selection and provisioning may be sensitive for both providers and users. In this paper, we propose a comprehensive framework to uniformly protect users and service providers at the time of service selection. We define a solution that (a) supports private service selection, such that both criteria and service attributes are kept private during the matching and (b) includes an approach to protect service provisioning rules from unwanted disclosure, both from the user and the service provider's perspective. We implemented our solution and integrated with the current Web service standard technologies. We conducted an extensive experimental evaluation, using datasets of actual WSDL documents. Our experimental evaluation and complexity analysis demonstrate that our algorithms are both effective and efficient.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254264","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Web service selection involves finding services from a possibly huge database of similar services. Hence, the challenges involved in finding a suitable service include large time consumption, and difficulty of finding a perfect match according to the user specified search keywords. In addition, significant privacy and security concerns arise, as the information involved with service selection and provisioning may be sensitive for both providers and users. In this paper, we propose a comprehensive framework to uniformly protect users and service providers at the time of service selection. We define a solution that (a) supports private service selection, such that both criteria and service attributes are kept private during the matching and (b) includes an approach to protect service provisioning rules from unwanted disclosure, both from the user and the service provider's perspective. We implemented our solution and integrated with the current Web service standard technologies. We conducted an extensive experimental evaluation, using datasets of actual WSDL documents. Our experimental evaluation and complexity analysis demonstrate that our algorithms are both effective and efficient.
复合web服务的隐私感知服务选择
Web服务选择涉及到从可能庞大的类似服务数据库中查找服务。因此,寻找合适的服务所涉及的挑战包括大量的时间消耗,以及根据用户指定的搜索关键字找到完美匹配的困难。此外,还会出现重要的隐私和安全问题,因为与服务选择和供应有关的信息可能对提供者和用户都很敏感。在本文中,我们提出了一个在服务选择时统一保护用户和服务提供商的综合框架。我们定义了这样一个解决方案:(a)支持私有服务选择,这样在匹配过程中,标准和服务属性都是私有的;(b)包括一种方法,从用户和服务提供者的角度保护服务供应规则免受不必要的披露。我们实现了我们的解决方案,并集成了当前的Web服务标准技术。我们使用实际WSDL文档的数据集进行了广泛的实验评估。我们的实验评估和复杂性分析表明,我们的算法是有效和高效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信