Home // DBKDA 2015, The Seventh International Conference on Advances in Databases, Knowledge, and Data Applications // View article


Query-Based l-Diversity

Authors:
Chittaphone Phonharath
Ryunosuke Takayama
Kenji Hashimoto
Hiroyuki Seki

Keywords: Database Privacy; Diversity; Inference Attack; Relational Databases.

Abstract:
We propose a new privacy notion called query-based l-diversity. A database instance T is l-diverse with respect to given authorized queries if an attacker cannot narrow down the number of possible values of the sensitive information to less than l by inference using the result of the authorized queries on the instance T and the meaning of the queries. We provide two approaches to deciding the query-based l-diversity. In the first approach, a decision algorithm is given by using relational operations, which can be directly implemented by a relational database management system, e.g., Structured Query Language (SQL). The second approach transforms a given input to a logical formula and decides the problem by model counting using a #SAT solver. We discuss the effectiveness and scalability of the two approaches based on the experimental results.

Pages: 15 to 20

Copyright: Copyright (c) IARIA, 2015

Publication date: May 24, 2015

Published in: conference

ISSN: 2308-4332

ISBN: 978-1-61208-408-4

Location: Rome, Italy

Dates: from May 24, 2015 to May 29, 2015