Issue No. 03 - June (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.390247
<p><it>Abstract</it>—In this paper, we develop a formal logical foundation for secure deductive databases. This logical foundation is based on an extended logic involving several modal operators. We develop two models of interaction between the user and the database called “yes-no” dialogs, and “yes-no-don’t know” dialogs. Both dialog frameworks allow the database to lie to the user. We develop an algorithm for answering queries using yes-no dialogs and prove that secure query processing using yes-no dialogs is NP-complete. Consequently, the degree of computational intractability of query processing with yes-no dialogs is no worse than for ordinary databases. Furthermore, the algorithm is maximally cooperative to user in the sense that lying is resorted to only when absolutely necessary. For Horn databases, we show that secure query processing can be achieved in linear time - hence, this is no more intractable than the situation in ordinary databases. Finally, we identify necessary and sufficient conditions for the database to be able to preserve security. Similar results are also obtained for yes-no-don’t know dialogs.</p>
Deductive databases, secure databases, computer security, logic programming.
P. A. Bonatti, S. Kraus and V. Subrahmanian, "Foundations of Secure Deductive Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 406-422, 1995.