A historical probability based noise generation strategy for privacy protection in cloud computing
- Publication Type:
- Journal Article
- Journal of Computer and System Sciences, 2012, 78 (5), pp. 1374 - 1381
- Issue Date:
Cloud computing promises an open environment where customers can deploy IT services in pay-as-you-go fashion while saving huge capital investment in their own IT infrastructure. Due to the openness, various malicious service providers can exist. Such service providers may record service requests from a customer and then collectively deduce the customer private information. Therefore, customers need to take certain actions to protect their privacy. Obfuscation with noise injection, that mixes noise service requests with real customer service requests so that service providers will be confused about which requests are real ones, is an effective approach in this regard if those request occurrence probabilities are about the same. However, current obfuscation with noise injection uses random noise requests. Due to the randomness it needs a large number of noise requests to hide the real ones so that all of their occurrence probabilities are about the same, i.e. service providers would be confused. In pay-as-you-go cloud environment, a noise request will cost the same as a real request. Hence, with the same level of confusion, i.e. customer privacy protection, the number of noise requests should be kept as few as possible. Therefore in this paper we develop a novel historical probability based noise generation strategy. Our strategy generates noise requests based on their historical occurrence probability so that all requests including noise and real ones can reach about the same occurrence probability, and then service providers would not be able to distinguish in between. Our strategy can significantly reduce the number of noise requests over the random strategy, by more than 90% as demonstrated by simulation evaluation. © 2011 Elsevier Inc.
Please use this identifier to cite or link to this item: