A secure multi-dimensional partition based index in das

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Database-as-a-Service is an emerging data management paradigm wherein data owners outsource their data to external untrusted server. To keep server from unauthorized access, sensitive data are encrypted before outsource. Although partition based index is an effective way of querying encrypted data, several such indexes would lead to extra information leakage because of un-uniform multi-dimensional data distribution. In this paper we first introduce two security constraints based on minimal confidential interval and minimal occupation number, then propose a multi-dimensional partition which satisfies previous security constraints. Since optimal multi-dimensional partition is a NP-hard problem, we propose a heuristic based greedy algorithm which is simple and efficient. Experiments show that our index could achieve a stable trade-off between security and efficiency compared to multiple single-dimensional indexes. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, J., & Du, X. (2008). A secure multi-dimensional partition based index in das. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4976 LNCS, pp. 319–330). https://doi.org/10.1007/978-3-540-78849-2_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free