TY - GEN
T1 - Secrecy-preserving query answering for instance checking in EL
AU - Tao, Jia
AU - Slutzki, Giora
AU - Honavar, Vasant
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2010
Y1 - 2010
N2 - We consider the problem of answering queries against an EL knowledge base (KB) using secrets, whenever it is possible to do so without compromising secrets. We provide a polynomial time algorithm that, given an EL KB ∑, a set of secrets to be protected and a query q, outputs "Yes" whenever and the answer to ∑ q, together with the answers to any previous queries answered by the KB, does not allow the querying agent to deduce any of the secrets in S. This approach allows more flexible information sharing than is possible with traditional access control mechanisms.
AB - We consider the problem of answering queries against an EL knowledge base (KB) using secrets, whenever it is possible to do so without compromising secrets. We provide a polynomial time algorithm that, given an EL KB ∑, a set of secrets to be protected and a query q, outputs "Yes" whenever and the answer to ∑ q, together with the answers to any previous queries answered by the KB, does not allow the querying agent to deduce any of the secrets in S. This approach allows more flexible information sharing than is possible with traditional access control mechanisms.
UR - https://www.scopus.com/pages/publications/78049410931
UR - https://www.scopus.com/pages/publications/78049410931#tab=citedBy
U2 - 10.1007/978-3-642-15918-3_16
DO - 10.1007/978-3-642-15918-3_16
M3 - Conference contribution
AN - SCOPUS:78049410931
SN - 3642159176
SN - 9783642159176
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 195
EP - 203
BT - Web Reasoning and Rule Systems - Fourth International Conference, RR 2010, Proceedings
T2 - 4th International Conference on Web Reasoning and Rule Systems, RR 2010
Y2 - 22 September 2010 through 24 September 2010
ER -