Achieving Data Privacy through Secrecy Views and Null-Based Virtual Updates

@article{Bertossi2013AchievingDP,
  title={Achieving Data Privacy through Secrecy Views and Null-Based Virtual Updates},
  author={L. Bertossi and Lechen Li},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  year={2013},
  volume={25},
  pages={987-1000}
}
  • L. Bertossi, Lechen Li
  • Published 2013
  • Computer Science
  • IEEE Transactions on Knowledge and Data Engineering
We may want to keep sensitive information in a relational database hidden from a user or group thereof. We characterize sensitive data as the extensions of secrecy views. The database, before returning the answers to a query posed by a restricted user, is updated to make the secrecy views empty or a single tuple with null values. Then, a query about any of those views returns no meaningful information. Since the database is not supposed to be physically changed for this purpose, the updates are… Expand
Logical foundations of information disclosure in ontology-based data integration
TLDR
The problem of determining whether a given data integration system discloses a source query to an attacker is formalised and studied, and a number of techniques for analysing logical privacy issues in ontology-based data integration are introduced. Expand
Revisiting Controlled Query Evaluation in Description Logics
Controlled Query Evaluation (CQE) is a confidentiality-preserving framework in which private information is protected through a policy, and a (optimal) censor guarantees that answers to queries areExpand
First-order under-approximations of consistent query answers
TLDR
A new framework for divulging an inconsistent database to end users is proposed, which adopts two postulates and imposes an upper bound on the data complexity of query answering. Expand
A Survival Study on Privacy Preservation of Data Sharing with Optimal Side Effects
TLDR
In this work, association rule mining technique is used to send data to all the users with optimal side effects and helps to maintain the individual privacy for these sensitive attributes. Expand
Inference-Proof Data Publishing by Minimally Weakening a Database Instance
TLDR
This work proposes an approach to weaken an original database instance: within a logic-oriented modeling definite knowledge is replaced by disjunctive knowledge to introduce uncertainty about confidential information. Expand
Inference-Proof Materialized Views
TLDR
Next, beside the sharing of data, another key goal of data publishing lies in the preservation of confidentiality requirements, this applies in particular to data containing personal information. Expand
Incomplete Data and Data Dependencies in Relational Databases
TLDR
This book discusses fundamental issues concerning data dependencies and incomplete data with a particular focus on the chase and its applications in different database areas with particular attention devoted to query answering in the presence of data Dependencies and database schema design. Expand
Characterizing Causes for Query Answers in Databases via Database Repairs and their Computation through Repair Programs
TLDR
Answer-set programs that specify repairs of databases are used as a basis for solving computational and reasoning problems about causes, and causes are also introduced at the attribute level by appealing to a both null-based and attribute-based repair semantics. Expand
An Operational Approach to Consistent Query Answering
TLDR
This work replaces the current declarative definition of a repair with an operational one, which explains how a repair is constructed, and how likely it is that a consistent instance is a repair, and studies the complexity of both exact and approximate CQA. Expand
An Operational Approach to ConsistentQuery Answering
Consistent query answering (CQA) aims to findmeaningful answers to queries when databases are inconsistent, i.e., do not conform to their specifications. Such answers must be certainly true in allExpand
...
1
2
3
...

References

SHOWING 1-10 OF 54 REFERENCES
A framework for inference control in incomplete logic databases
TLDR
This thesis presents a framework for Controlled Query Evaluation in incomplete logic databases, and shows how to operationally enforce confidentiality policies based on epistemic potential secrets. Expand
Keeping secrets in incomplete databases
TLDR
This work introduces a framework in which CQE can be analyzed wrt. Expand
Semantically Correct Query Answers in the Presence of Null Values
TLDR
A precise semantics for IC satisfaction in a database with null values is proposed that is compatible with the way null values are treated in commercial database management systems and a precise notion of repair is introduced that privileges the introduction of null values when repairing foreign key constraints. Expand
Authorization Views and Conditional Query Containment
TLDR
An algorithm to test conditional containment of conjunctive queries with respect to a set of materialized conj unctive views is given and it is shown the problem is ${\it \Pi}^{p}_{2}$-complete. Expand
Extending query rewriting techniques for fine-grained access control
TLDR
A novel fine-grained access control model based on authorization views that allows "authorization-transparent" querying is presented, that is, user queries can be phrased in terms of the database relations, and are valid if they can be answered using only the information contained in these authorization views. Expand
Confidentiality Policies for Controlled Query Evaluation
TLDR
This paper considers incomplete logic databases and investigates the semantic ways of protecting a piece of information, and gives a formal definition of such confidentiality policies and shows how to enforce them by reusing the existing methods for CQE. Expand
On the computation of relational view complements
Views as a means to describe parts of a given data collection play an important role in many database applications. In dynamic environments, where data is updated, not only information provided byExpand
Minimal-change integrity maintenance using tuple deletions
TLDR
This work addresses the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases, and considers denial constraints, general functional and inclusion dependencies, as well as key and foreign key constraints. Expand
Towards Controlled Query Evaluation for Incomplete First-Order Databases
TLDR
This article extends CQE to incomplete first-order databases, a data model which suits a broader range of applications than a previously studied propositional incomplete data model. Expand
On the computation of relational view complements
TLDR
In this article, it is shown how to compute reasonably small (and in special cases even minimal) complements for a large class of relational views. Expand
...
1
2
3
4
5
...