An Association Probability Based Noise Generation Strategy for Privacy Protection in Cloud Computing
Cloud computing allows customers to utilise IT services in a pay-as-you-go fashion to save huge cost on IT infrastructure. In open cloud, ‘malicious’ service providers could record service data from a cloud customer and collectively deduce the customer’s privacy without the customer’s permission. Accordingly, customers need to take certain actions to protect their privacy automatically at client sides, such as noise obfuscation. For instance, it can generate and inject noise service requests into real ones so that service providers are hard to distinguish which ones are real. Existing noise obfuscations focus on concealing occurrence probabilities of service requests. But in reality, association probabilities of service requests can also reveal customer privacy. So, we present a novel association probability based noise generation strategy by concealing these association probabilities. The simulation comparison demonstrates that this strategy can improve the effectiveness of privacy protection significantly from the perspective of association probability.
KeywordsCloud service Privacy protection Noise generation Association probability
- 3.Ren, K., Liu, X., Chen, J., Xiao, N., Song, J., Zhang, W.: A QSQL-based Efficient Planning Algorithm for Fully-automated Service Composition in Dynamic Service Environments. In: 2008 IEEE International Conference on Service Computing (SCC 2008), pp. 301–308. IEEE Press (2008)Google Scholar
- 5.Bu, Y., Fu, A., Wong, R., Chen, L., Li, J.: Privacy Preserving Serial Data Publishing by Role Composition. In: 34th Internationasl Conference on Very Large Data Bases (VLDB 2008), pp. 845–856 (2008)Google Scholar
- 10.Liu, K., Jin, H., Chen, J., Liu, X., Yuan, D., Yang, Y.: A Compromised-time-cost Scheduling Algorithm in SwinDeW-C for Instance-intensive Cost-constrained Workflows on a Cloud Computing Platform. International Journal of High Performance Computing Applications 24(4), 445–456 (2010)CrossRefGoogle Scholar