Balancing Privacy Risk and Benefit in Service Selection for Multiprovision Cloud Service Composition
Open Access
- 13 May 2022
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 10 (10) , 1675
Abstract
The popularity of cloud computing has fueled the growth in multiprovision cloud service composition (MPCSC), where each cloud service provider (CSP) can fulfill multiple tasks, i.e., offer multiple services, simultaneously. In the MPCSC, users would rather disclose some private data for more benefits (e.g., personalized services). However, the more private data is released, the more serious the privacy risk faced by users. In particular, the multiservice provision characteristic of MPCSC further exacerbates the privacy risk. Therefore, how to balance the privacy risk and benefit in service selection for MPCSC is a challenging research problem. In this paper, firstly we explore the service selection problem of balancing privacy risk and benefit in MPCSC (SSBM), then we propose an improved Kuhn–Munkres (KM) algorithm solution to the SSBM problem. Furthermore, we conduct a series of simulation experiments to evaluate the proposed approach. The experimental results show that the proposed approach is both efficient and effective for solving the SSBM problem.Keywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada (RGPIN-2018-04818, 2016-GH0303-00022)
- Jiangsu Province Planning Subject for the 13th Five Year Plan of Education Sciences (RGPIN-2018-04818, 2016-GH0303-00022)
This publication has 46 references indexed in Scilit:
- Towards Trustworthy Multi-Cloud Services Communities: A Trust-Based Hedonic Coalitional GameIEEE Transactions on Services Computing, 2016
- Cost Effective, Reliable and Secure Workflow Deployment over Federated CloudsIEEE Transactions on Services Computing, 2016
- Service Selection for Composition with QoS CorrelationsIEEE Transactions on Services Computing, 2014
- Quality-Aware Service Selection for Service-Based Systems Based on Iterative Multi-Attribute Combinatorial AuctionIEEE Transactions on Software Engineering, 2014
- An Efficient and Trustworthy Resource Sharing Platform for Collaborative Cloud ComputingIEEE Transactions on Parallel and Distributed Systems, 2013
- Private traits and attributes are predictable from digital records of human behaviorProceedings of the National Academy of Sciences, 2013
- Dynamic risk-based decision methods for access control systemsComputers & Security, 2012
- An Extended Privacy Calculus Model for E-Commerce TransactionsInformation Systems Research, 2006
- Algorithms for the Assignment and Transportation ProblemsJournal of the Society for Industrial and Applied Mathematics, 1957
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955