Controlled query evaluation with open queries for a decidable relational submodel

DOI10.1007/S10472-007-9070-5zbMATH Open1129.68029OpenAlexW2097314293MaRDI QIDQ2385449FDOQ2385449

P. A. Bonatti, Joachim Biskup

Publication date: 12 October 2007

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-007-9070-5

Recommendations

• Foundations of Information and Knowledge Systems
• Confidentiality policies and their enforcement for controlled query evaluation
• Controlled query evaluation for known policies by combining lying and refusal
• scientific article; zbMATH DE number 2080022
• Reducing inference control to access control for normalized database schemas

zbMATH Keywords

Finite model theoryRelational databaseDescription logicFirst-order logicConfidentialityPropositional logicCombined methodCompleteness testControlled query evaluationDB-interpretationDomain-independent queryImplication problemLyingOpen queryRefusalSafe queryBernays-Schönfinkel class

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Database theory (68P15) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Elements of finite model theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lying versus refusal for known potential secrets
• Title not available (Why is that?)
• Solvable cases of the decision problem
• Controlled query evaluation for known policies by combining lying and refusal
• Cover story management
• Answering queries without revealing secrets
• Title not available (Why is that?)
• Title not available (Why is that?)
• For unknown secrecies refusal is better than lying
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• On the finite controllability of conjunctive query answering in databases under open-world assumption
• A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
• Controlled query evaluation for known policies by combining lying and refusal
• A false sense of security
• Relational schemas with multiplicity bounds, diversity bounds and functional dependencies
• A universal approach to guarantee data privacy
• Combining Consistency and Confidentiality Requirements in First-Order Databases

This page was built for publication: Controlled query evaluation with open queries for a decidable relational submodel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385449)