| 摘要: |
| 用户向Web服务组合提供隐私数据时，不同用户有自身的隐私信息暴露需求，服务组合应支持用户隐私需求的可满足性验证.首先提出一种面向服务组合的用户隐私需求规约方法，用户能够定义隐私数据及不同使用情境的敏感度，采用敏感度-信誉度函数明确可以使用隐私数据的成员服务，简化隐私需求的同时，提高了隐私需求的通用性.为了验证服务组合是否满足用户隐私需求，首先通过隐私数据项依赖图（privacy data item dependency graph，简称PDIDG）描述组合中隐私数据项的依赖关系，然后采用隐私开放工作流网（privacy open workflow net，简称POWFN）构建隐私敏感的服务组合模型，通过需求验证算法验证服务组合是否满足用户隐私需求，从而能够有效防止用户隐私信息的非法直接暴露和间接暴露.最后，通过实例分析说明了该方法的有效性，并对算法性能进行了实验分析. |
| 关键词: 信誉度 服务组合 隐私保护 隐私开放工作流网 隐私数据项依赖图 |
| DOI：10.13328/j.cnki.jos.004945 |
| 分类号: |
| 基金项目:国家自然科学基金（61272083）；国家高技术研究发展计划（863）（2015AA015303）；中国博士后科学基金（20110491411）；江苏省博士后科研计划（1101092C） |
|
| Specification and Verification of User Privacy Requirements for Service Composition |
|
PENG Huan-Feng1,2, HUANG Zhi-Qiu1, FAN Da-Juan2, ZHANG Yong-Long3
|
|
1.College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China;2.College of Computer Engineering, Nanjing Institute of Technology, Nanjing 21167, China;3.College of Information Engineering, Yangzhou University, Yangzhou 225127, China
|
| Abstract: |
| Users have different privacy information disclosure requirements when they submit private data to service composition, and the composition should support the verification of users' privacy requirements. This paper puts forward a flexible method for users to produce privacy requirement specifications. Users can define the sensitivity of private data and its usage in different situations, and restrict the member services that can use private data with sensitivity-reputation function. The simplification and universality of the privacy requirements can be improved by using this method. The process first establishes privacy data item relations by using the privacy data item dependency graph (PDIDG), then models the service composition with privacy open workflow net (POWFN), and at last, makes sure whether service composition meets the user's privacy requirements by privacy requirements verification algorithm. An example is provided to illustrate the effectiveness of the method, and experiment analysis on the performance of the verification algorithm is carried out at the end of paper. |
| Key words: reputation service composition privacy protection privacy open workflow net privacy data item dependency graph |
