Precisely Answering Multi-Dimensional Range Queries without Privacy Breach
Publication Type
Conference Proceeding Article
Publication Date
10-2003
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.
Discipline
Information Security
Research Areas
Information Security and Trust
Publication
European Symposium on Research in Computer Security (ESORICS)
First Page
100
Last Page
115
ISBN
9783540203001
Identifier
10.1007/b13237
Publisher
Springer Verlag
City or Country
Gjovik, Norway
Citation
WANG, Lingyu; LI, Yingjiu; Wijesekera, Duminda; and Jajodia, Sushil.
Precisely Answering Multi-Dimensional Range Queries without Privacy Breach. (2003). European Symposium on Research in Computer Security (ESORICS). 100-115.
Available at: https://ink.library.smu.edu.sg/sis_research/556
Additional URL
http://dx.doi.org/10.1007/b13237