Skip to main content

Confidentiality-Preserving Publishing of EDPs for Credulous and Skeptical Users

  • Conference paper
  • First Online:
Applications of Declarative Programming and Knowledge Management (INAP 2011, WLP 2011)

Abstract

Publishing private data on external servers incurs the problem of how to avoid unwanted disclosure of confidential data. We study the problem of confidentiality-preservation when publishing extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how the differences between users who employ either credulous or skeptical non-monotonic reasoning affect confidentiality.

Lena Wiese was partially supported by a postdoctoral research grant of the German Academic Exchange Service (DAAD) while preparing this work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Afrati, F.N., Kolaitis, P.G.: Repair checking in inconsistent databases: algorithms and complexity. ICDT 2009. ACM International Conference Proceeding Series, vol. 361, pp. 31–41. ACM, New York (2009)

    Google Scholar 

  2. Biskup, J.: Usability confinement of server reactions: maintaining inference-proof client views by controlled interaction execution. In: Kikuchi, S., Sachdeva, S., Bhalla, S. (eds.) DNIS 2010. LNCS, vol. 5999, pp. 80–106. Springer, Heidelberg (2010)

    Google Scholar 

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

    Article  Google Scholar 

  4. Calimeri, F., et al.: The third answer set programming competition: preliminary report of the system competition track. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 388–403. Springer, Heidelberg (2011)

    Google Scholar 

  5. Dix, J., Faber, W., Subrahmanian, V.S.: The relationship between reasoning about privacy and default logics. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 637–650. Springer, Heidelberg (2005)

    Google Scholar 

  6. Farkas, C., Jajodia, S.: The inference problem: a survey. SIGKDD Explor. 4(2), 6–11 (2002)

    Article  Google Scholar 

  7. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gen. Comput. 9(3/4), 365–386 (1991)

    Article  Google Scholar 

  8. Grau, B.C., Horrocks, I.: Privacy-preserving query answering in logic-based information systems. In: ECAI 2008. Frontiers in Artificial Intelligence and Applications, vol. 178, pp. 40–44. IOS Press (2008)

    Google Scholar 

  9. Inoue, K., Sakama, C.: Abductive framework for nonmonotonic theory change. In: Fourteenth International Joint Conference on Artificial Intelligence (IJCAI 95), vol. 1, pp. 204–210. Morgan Kaufmann (1995)

    Google Scholar 

  10. Inoue, K., Sakama, C., Wiese, L.: Confidentiality-preserving data publishing for credulous users by extended abduction. Paper appears in the Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011), arXiv:1108.5825 (2011)

    Google Scholar 

  11. Ma, J., Russo, A., Broda, K., Lupu, E.: Multi-agent confidential abductive reasoning. In: ICLP (Technical Communications). LIPIcs, vol. 11, pp. 175–186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)

    Google Scholar 

  12. Sakama, C.: Dishonest reasoning by abduction. In: 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 1063–1064. IJCAI/AAAI (2011)

    Google Scholar 

  13. Sakama, C., Inoue, K.: An abductive framework for computing knowledge base updates. Theor. Pract. Logic Program. 3(6), 671–713 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Stouppa, P., Studer, T.: Data privacy for \(\cal ALC\) knowledge bases. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 409–421. Springer, Heidelberg (2008)

    Google Scholar 

  15. Toland, T.S., Farkas, C., Eastman, C.M.: The inference problem: Maintaining maximal availability in the presence of database updates. Comput. Secur. 29(1), 88–103 (2010)

    Article  Google Scholar 

  16. Wiese, L.: Horizontal fragmentation for data outsourcing with formula-based confidentiality constraints. In: Echizen, I., Kunihiro, N., Sasaki, R. (eds.) IWSEC 2010. LNCS, vol. 6434, pp. 101–116. Springer, Heidelberg (2010)

    Google Scholar 

  17. Zhao, L., Qian, J., Chang, L., Cai, G.: Using ASP for knowledge management with user authorization. Data Knowl. Eng. 69(8), 737–762 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lena Wiese .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inoue, K., Sakama, C., Wiese, L. (2013). Confidentiality-Preserving Publishing of EDPs for Credulous and Skeptical Users. In: Tompits, H., et al. Applications of Declarative Programming and Knowledge Management. INAP WLP 2011 2011. Lecture Notes in Computer Science(), vol 7773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41524-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41524-1_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41523-4

  • Online ISBN: 978-3-642-41524-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics