skip to main content
10.1145/1698790.1698813acmotherconferencesArticle/Chapter ViewAbstractPublication PagesedbtConference Proceedingsconference-collections
research-article

COP: privacy-preserving multidimensional partition in DAS paradigm

Published: 22 March 2009 Publication History

Abstract

Database-as-a-Service (DAS) is an emerging database management paradigm wherein partition based index is an effective way to querying encrypted data. However, previous research either focuses on one-dimensional partition or ignores multidimensional data distribution characteristic, especially sparsity and locality. In this paper, we propose Cluster based Onion Partition (COP), which is designed to decrease both false positive and dead space at the same time. Basically, COP is composed of two steps. First, it partition covered space level by level, which is like peeling of onion; second, at each level, a clustering algorithm based on local density is proposed to achieve local optimal secure partition. Extensive experiments on real dataset and synthetic dataset show that COP is a secure multidimensional partition with much less efficiency loss than previous top down or bottom up counterparts.

References

[1]
Hacigumus H, Iyer B, Mehrotra S. Providing Database as a Service. In Proc. of 18th International Conference on Data Engineering, San Jose, CA, USA, February 2002.
[2]
Li FF, Hadjieleftheriou M, Kollios G, Reyzin L. Dynamic authenticated index structures for outsourced databases. In SIGMOD Conference, pages 121--132. ACM, 2006.
[3]
Hacigumus H, Iyer B, Li C, Mehrotra S. Executing SQL over Encrypted Data in the Database Service Provider Model. SIGMOD 2002, June4--6, Madison, Wisconsin, USA
[4]
Damiani E, Vimercati SDC, Jajodia S, Paraboschi S, Samarati P. Balancing Confidentiality and Efficiency in Untrusted Relational DBMSs. In 10th ACM CCS, Washington, 2003
[5]
Hore, B., Mehrotra, S., Tsudik, G.: A Privacy-Preserving Index for Range Queries. In Proc. of the 30th VLDB Conference, Toronto, Canada, 2004.
[6]
Wang JP, Du XY, A Secure Multi-dimensional Partition Based Index in DAS, In Proceeding of the 10th Asia Pacific Web Conference, Shenyang, April 2008, LNCS 4976, pp. 319--330.
[7]
Bruno, N., Chauhuri, S., Gravano, L.: STHoles: A Multidimensional Workload-Aware Histogram. In proceedings of the 2001 ACM International Conference on Management of Data (SIGMOD'01), 2001.
[8]
LeFevre K., DeWitt D. J., and Ramakrishnan R. Incognito: Efficient Full-domain k-Anonymity. In Proc. of ACM SIGMOD, pages 49--60, 2005.
[9]
LeFevre K., DeWitt D. J., and Ramakrishnan R. Mondrian Multidimensional k-Anonymity. In Proc. Of ICDE, 2006.
[10]
Aggarwal G., Feder T., Kenthapadi K., Khuller S., Panigrahy R., Thomas D., and Zhu A., "Achieving Anonymity via Clustering," in Proc. of ACM PODS, 2006, pp. 153--162.
[11]
Meyerson A. and Williams R. On the Complexity of Optimal K-anonymity. In Proc. of ACM PODS, pages 223--228, 2004
[12]
Aggarwal C. C., On k-Anonymity and the Curse of Dimensionality. In Proc. of VLDB, 2005, pp. 901--909.
[13]
Xu J., Wang W., Pei J., Wang X., Shi B., and Fu A., "Utility-Based Anonymization Using Local Recoding," in Proc. of SIGKDD, 2006, pp. 20--23.
[14]
Agrawal R., Gehrke J., Gunopulos D., Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data, Seattle.
[15]
Jagadish HV, Linear Clustering of Objects with Multiple Attributes, Proc. ACM SIGMOD Conf., PP. 332--342, May 1990
[16]
Blake, C., Keogh, E., Merz, C.: UCI repository of machine learning databases. University of Califonia, Ivrine, Dept. of Informaiton and Computer Science, URL=http://mlearn.ics.uci.edu/MLRepository.html.
[17]
Ghinita G., Karras P., Kalnis P. and Mamoulis N. Fast Data Anonymization with Low Information Loss. In Proc. of VLDB, 2007, pp. 758--769.

Index Terms

  1. COP: privacy-preserving multidimensional partition in DAS paradigm

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      EDBT/ICDT '09: Proceedings of the 2009 EDBT/ICDT Workshops
      March 2009
      218 pages
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 22 March 2009

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. DAS
      2. cluster
      3. database security
      4. multi-dimensional partition

      Qualifiers

      • Research-article

      Funding Sources

      • MOE project

      Conference

      EDBT/ICDT '09
      EDBT/ICDT '09: EDBT/ICDT '09 joint conference
      March 22, 2009
      Saint-Petersburg, Russia

      Acceptance Rates

      Overall Acceptance Rate 7 of 10 submissions, 70%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 130
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 14 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media