DBScholar

Back to papers

Explainable Security for Relational Databases

Summary: Formal, explainable security model for relational DBs; every query decision (allow/deny) yields a concise, formal explanation. Rooted in disclosure lattices and policy algebras, with a practical engine for disclosing/denying SQL under complex constraints. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h6c5b130737436ac3
Venue
SIGMOD
Year
2014
Pagerank
5.7726401e-05
Overall Rank
6,477 | 56.46%
DOI
10.1145/2588555.2593663

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bender_sigmod14,
        title = {{Explainable Security for Relational Databases}},
        author = {Bender, Gabriel and Kot, Łucja and Gehrke, Johannes},
        series = {{SIGMOD} '14},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2588555.2593663},
        url = {https://dl.acm.org/doi/10.1145/2588555.2593663},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
310 Optimization of Real Conjunctive Queries 1993 PODS 0.00021374145
568 Extending Query Rewriting Techniques for Fine-Grained Access Control 2004 SIGMOD 0.00016262553
2,387 Query-Based Data Pricing 2012 PODS 8.5381364e-05
12,547 Fine-Grained Disclosure Control for App Ecosystems 2013 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Semantically Similar Papers