Abstract
With the popularity of the outsourced database, protecting sensitive associations in this environment is greatly desired and receives high attention. Table decomposition based method, which is suited for the current query evaluation of the database engine, provides an alternative to the conventional encryption method. Although some work on table decomposition has been done to handle single sensitive association in data publishing scenario or multiple associations in multiple servers, fewer attempts have been made to deal with multiple associations in single outsourced database. In this paper, we first illustrate that the simple extension of existing work will lead to new kinds of information leakages, and then we propose a novel table decomposition method, which achieves l-diversity, defeats the new information leakages, while at the same time, considers the query efficiency over the decomposed sub-tables. The final experimental results validate the effectiveness and efficiency of our method.
This work was supported by the National High Technology Research and Development Program(“863”Program) of China under Grant No. 2009AA01Z150, 2007AA01Z191, 2006AA01Z230; the National Natural Science Foundation of China under Grant No. 60873062; the Peking University−Morgan Stanley Research Aid Program. Jun Gao is the contact author for this paper.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Microsoft sql server data service, http://www.microsoft.com/azure/data.mspx
Simple database in amazon, http://aws.amazon.com/simpledb/
Aggarwal, G., Bawa, M., Ganesan, P., et al.: Two can keep a secret: A distributed architecture for secure database services. In: Proc. of CIDR, pp. 186–199 (2005)
Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order preserving encryption for numeric data. In: Proc. of SIGMOD, pp. 563–574 (2004)
Chung, S.S., Ozsoyoglu, G.: Processing Aggregation Queries over Encrypted Databases. In: Proc. of ICDE (2006)
Damiani, E., Vimercati, S.D.C., Jajodia, S., et al.: Balancing confidentiality and efficiency in untrusted relational DBMSs. In: Proc. of CCS, pp. 93–102 (2003)
Hacigümüş, H., Iyer, B., Li, C., Mehrotra, S.: Executing SQL over encrypted data in the database-service-provider model. In: Proc. of SIGMOD, pp. 216–227 (2002)
Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: Proc. of VLDB, pp. 720–731 (2004)
Kambayashi, Y., Yoshikawa, M., Yajima, S.: Query processing for distributed databases using generalized semi-joins. In: Proc. of SIGMOD, pp. 151–160 (1982)
Li, J., Omiecinski, E.R.: Efficiency and security trade-off in supporting range queries on encrypted databases. In: DBSec, pp. 69–83 (2005)
Xiao, X., Tao, Y.: Anatomy: Simple and effective privacy preservation. In: Proc. of VLDB, pp. 139–150 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, X., Gao, J., Wang, T., Yang, D. (2010). Multiple Sensitive Association Protection in the Outsourced Database. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds) Database Systems for Advanced Applications. DASFAA 2010. Lecture Notes in Computer Science, vol 5982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12098-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-12098-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12097-8
Online ISBN: 978-3-642-12098-5
eBook Packages: Computer ScienceComputer Science (R0)