Using SAT-Solvers to compute inference-proof database instances

Authors:
Cornelia Tadros;Lena Wiese
Affiliations:
Technische Universität Dortmund, Dortmund, Germany;Technische Universität Dortmund, Dortmund, Germany
Venue:
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
Year:
2009

Citing 8
Cited 4

Cover story management

Data & Knowledge Engineering
Controlled query evaluation with open queries for a decidable relational submodel

Annals of Mathematics and Artificial Intelligence
A logical approach to efficient Max-SAT solving

Artificial Intelligence
Preprocessing for controlled query evaluation with availability policy

Journal of Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'06)
Combining Consistency and Confidentiality Requirements in First-Order Databases

ISC '09 Proceedings of the 12th International Conference on Information Security
MINIMAXSAT: an efficient weighted max-SAT solver

Journal of Artificial Intelligence Research
Dynamic disclosure monitor (D2Mon): an improved query processing solution

SDM'05 Proceedings of the Second VDLB international conference on Secure Data Management
TPTP, TSTP, CASC, etc.

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Keeping secrets in possibilistic knowledge bases with necessity-valued privacy policies

IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
A sound and complete model-generation procedure for consistent and confidentiality-preserving databases

Theoretical Computer Science
Usability confinement of server reactions: maintaining inference-proof client views by controlled interaction execution

DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Inference-usability confinement by maintaining inference-proof views of an information system

International Journal of Computational Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

An inference-proof database instance is a published, secure view of an input instance containing secret information with respect to a security policy and a user profile. In this paper, we show how the problem of generating an inference-proof database instance can be represented by the partial maximum satisfiability problem. We present a prototypical implementation that relies on highly efficient SAT-solving technology and study its performance in a number of test cases.