A Universal Approach to Guarantee Data Privacy

被引：1

作者：

Studer T. ^{[1
]}

机构：

[1] Institut für Informatik und angewandte Mathematik, Universität Bern, 3012 Bern

来源：

Logica Universalis | 2013年 / 7卷 / 2期

关键词：

controlled query evaluation; Data privacy; description logic; inference control; knowledge base systems; lying; propositional logic;

D O I：

10.1007/s11787-012-0060-y

中图分类号：

学科分类号：

摘要：

The problem of data privacy is to verify that confidential information stored in an information system is not provided to unauthorized users and, therefore, personal and other sensitive data remain private. One way to guarantee this is to distort a knowledge base such that it does not reveal sensitive information. In the present paper we will give a universal definition of the problem of knowledge base distortion. It is universal in the sense that is independent of any particular knowledge representation formalism. We will then present a basic and general algorithm for knowledge base distortion to guarantee data privacy. This algorithm provides us with upper bounds for the complexity of the distortion problem. Moreover, we examine heuristics to improve its average performance. © 2012 Springer Basel AG.

引用

页码：195 / 209

页数：14

共 15 条

[1]

Agrawal R., Kiernan J., Srikant R., Xu Y., Hippocratic databases, Proc. of 28th VLDB Conference, (2002)

[2]

Baader F., Brandt S., Lutz C., Pushing the εL envelope, IJCAI-05, Proceedings, pp. 364-369, (2005)

[3]

Biskup J., Bonatti P.A., Controlled query evaluation for enforcing confidentiality in complete information systems, Int. J. Inf. Secur., 3, 1, pp. 14-27, (2004)

[4]

Biskup J., Bonatti P.A., Controlled query evaluation for known policies by combining lying and refusal, Ann. Math. Artif. Intell., 40, 1-2, pp. 37-62, (2004)

[5]

Biskup J., Bonatti P.A., Controlled query evaluation with open queries for a decidable relational submodel, Ann. Math. Artif. Intell., 50, 1-2, pp. 39-77, (2007)

[6]

Biskup J., Weibert T., Keeping secrets in incomplete databases, Int. J. Inf. Sec., 7, 3, (2008)

[7]

Biskup J., Wiese L., Preprocessing for controlled query evaluation with availability policy, J. Comput. Secur., 16, 4, pp. 477-494, (2008)

[8]

Bonatti P.A., Kraus S., Subrahmanian V.S., Foundations of secure deductive databases, Trans. Knowl. Data Eng., 7, 3, pp. 406-422, (1995)

[9]

Bovet D.P., Crescenzi P., Introduction to the theory of complexity, (1994)

[10]

Calvanese D., Giacomo G., Lembo D., Lenzerini M., Rosati R., Tractable reasoning and efficient query answering in description logics: The DL-Lite family, J. Autom. Reason., 39, 3, pp. 385-429, (2007)

← 1 2 →