Precisely answering multi-dimensional range queries without privacy breaches

23Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper studies the privacy breaches caused by multi-dimensional range (MDR) sum queries in online analytical processing (OLAP) systems. We show that existing inference control methods are generally infeasible for controlling MDR queries.We then consider restricting users to even MDR queries (that is, the MDR queries involving even numbers of data values). We show that the collection of such even MDR queries is safe if and only if a special set of sum-two queries (that is, queries involving exactly two values) is safe. On the basis of this result, we give an efficient method to decide the safety of even MDR queries. Besides safe even MDR queries we show that any odd MDR query is unsafe. Moreover, any such odd MDR query is different from the union of some even MDR queries by only one tuple. We also extend those results to the safe subsets of unsafe even MDR queries.

Cite

CITATION STYLE

APA

Wang, L., Li, Y., Wijesekera, D., & Jajodia, S. (2003). Precisely answering multi-dimensional range queries without privacy breaches. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2808, pp. 100–115). Springer Verlag. https://doi.org/10.1007/978-3-540-39650-5_6

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