An association probability based noise generation strategy for privacy protection in cloud computing

  • Authors:
  • Gaofeng Zhang;Xuyun Zhang;Yun Yang;Chang Liu;Jinjun Chen

  • Affiliations:
  • Faculty of Information and Communication Technologies, Swinburne University of Technology, Melbourne, Australia;Faculty of Engineering and Information Technology, University of Technology, Sydney, NSW, Australia;School of Computer Science and Technology, Anhui University, Hefei, China,Faculty of Information and Communication Technologies, Swinburne University of Technology, Melbourne, Australia;Faculty of Engineering and Information Technology, University of Technology, Sydney, NSW, Australia;Faculty of Engineering and Information Technology, University of Technology, Sydney, NSW, Australia

  • Venue:
  • ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.