Prometheus: Privacy-aware data retrieval on hybrid cloud
Authors:
- 1 April 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 2643-2651
Abstract
With the advent of cloud computing, data owner is motivated to outsource their data to the cloud platform for great flexibility and economic savings. However, the development is hampered by data privacy concerns: Data owner may have privacy data and the data cannot be outsourced to cloud directly. Previous solutions mainly use encryption. However, encryption causes a lot of inconveniences and large overheads for other data operations, such as search and query. To address the challenge, we adopt hybrid cloud. In this paper, we present a suit of novel techniques for efficient privacy-aware data retrieval. The basic idea is to split data, keeping sensitive data in trusted private cloud while moving insensitive data to public cloud. However, privacy-aware data retrieval on hybrid cloud is not supported by current frameworks. Data owners have to split data manually. Our system, called Prometheus, adopts the popular MapReduce framework, and uses data partition strategy independent to specific applications. Prometheus can automatically separate sensitive information from public data. We formally prove the privacy-preserving feature of Prometheus. We also show that our scheme can defend against the malicious cloud model, in addition to the semi-honest cloud model. We implement Prometheus on Hadoop and evaluate its performance using real data set on a large-scale cloud test-bed. Our extensive experiments demonstrate the validity and practicality of the proposed scheme.Keywords
This publication has 15 references indexed in Scilit:
- Performance analysis of Coupling Scheduler for MapReduce/Hadoop2012
- Anonymity meets game theory: secure data integration with malicious participantsThe VLDB Journal, 2010
- Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases2009
- A break in the cloudsACM SIGCOMM Computer Communication Review, 2008
- Deterministic and Efficiently Searchable Encryption2007
- Searchable symmetric encryption2006
- Modeling and assessing inference exposure in encrypted databasesACM Transactions on Information and System Security, 2005
- Balancing confidentiality and efficiency in untrusted relational DBMSs2003
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Non-Cooperative GamesAnnals of Mathematics, 1951