Abstract
Controlled Query Evaluation (CQE) is a logical framework for the protection of secrets in databases. In this article, we extend the CQE framework to possibilistic logic: knowledge base, a priori knowledge and privacy policy are expressed with necessity-valued formulas that represent several degrees of certainty. We present a formal security definition and analyze an appropriate controlled evaluation algorithm for this possibilistic case.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Biskup, J., Weibert, T.: Keeping secrets in incomplete databases. International Journal of Information Security 7(3), 199–217 (2008)
Biskup, J., Bonatti, P.: Controlled query evaluation for enforcing confidentiality in complete information systems. International Journal of Information Security 3, 14–27 (2004)
Biskup, J., Tadros, C., Wiese, L.: Towards controlled query evaluation for incomplete first-order databases. In: Link, S. (ed.) FoIKS 2010. LNCS, vol. 5956, pp. 230–247. Springer, Heidelberg (2010)
Benferhat, S., Dubois, D., Prade, H.: Towards a possibilistic logic handling of preferences. Applied Intelligence 14(3), 303–317 (2001)
Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets and Systems 144(1), 3–23 (2004)
Lang, J.: Possibilistic logic: complexity and algorithms. In: Lang, J. (ed.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 5, pp. 179–200. Kluwer Academic Publishers, Dordrecht (2000)
Tadros, C., Wiese, L.: Using SAT-solvers to compute inference-proof database instances. In: Garcia-Alfaro, J. (ed.) DPM 2009 and SETOP 2009. LNCS, vol. 5939, pp. 65–77. Springer, Heidelberg (2009)
Ciriani, V., di Vimercati, S.D.C., Foresti, S., Samarati, P.: k-anonymity. In: Secure Data Management in Decentralized Systems. Advances in Information Security, vol. 33, pp. 323–353. Springer, Heidelberg (2007)
Dawson, S., di Vimercati, S.D.C., Lincoln, P., Samarati, P.: Minimal data upgrading to prevent inference and association. In: Symposium on Principles of Database Systems (PODS 1999), pp. 114–125. ACM Press, New York (1999)
Evfimievski, A.V., Fagin, R., Woodruff, D.P.: Epistemic privacy. In: Symposium on Principles of Database Systems (PODS 2008), pp. 171–180. ACM, New York (2008)
Stouppa, P., Studer, T.: Data privacy for knowledge bases. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 409–421. Springer, Heidelberg (2008)
Halpern, J.Y., O’Neill, K.R.: Secrecy in multiagent systems. ACM Transactions on Information and System Security (TISSEC) 12(1) (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiese, L. (2010). Keeping Secrets in Possibilistic Knowledge Bases with Necessity-Valued Privacy Policies. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds) Computational Intelligence for Knowledge-Based Systems Design. IPMU 2010. Lecture Notes in Computer Science(), vol 6178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14049-5_67
Download citation
DOI: https://doi.org/10.1007/978-3-642-14049-5_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14048-8
Online ISBN: 978-3-642-14049-5
eBook Packages: Computer ScienceComputer Science (R0)