.png){kind=icon}
返回
FOUNDATIONS OF SECURE DEDUCTIVE DATABASES
.png){kind=icon}
PRE
AI
DOI：10.1109/69.390247.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
DEDUCTIVE DATABASES
SECURE DATABASES
COMPUTER SECURITY
LOGIC PROGRAMMING
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏The solar absolute spectral irradiance 1150–3173 Å: May 17, 1982太阳绝对光谱辐照度1150-3173 Å: 1982年5月17日
PREAI
分享收藏Mouse ICSI with frozen–thawed sperm: The impact of sperm freezing procedure and sperm donor strain
PREAI
分享收藏
查看更多内容