Access Control Enforcement for Selective Disclosure of Linked Data

  • Tarek Sayah
  • Emmanuel Coquery
  • Romuald Thion
  • Mohand-Saïd Hacid
Conference paper

DOI: 10.1007/978-3-319-46598-2_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9871)
Cite this paper as:
Sayah T., Coquery E., Thion R., Hacid MS. (2016) Access Control Enforcement for Selective Disclosure of Linked Data. In: Barthe G., Markatos E., Samarati P. (eds) Security and Trust Management. STM 2016. Lecture Notes in Computer Science, vol 9871. Springer, Cham

Abstract

The Semantic Web technologies enable Web-scaled data linking between large RDF repositories. However, it happens that organizations cannot publish their whole datasets but only some subsets of them, due to ethical, legal or confidentiality considerations. Different user profiles may have access to different authorized subsets. In this case, selective disclosure appears as a promising incentive for linked data. In this paper, we show that modular, fine-grained and efficient selective disclosure can be achieved on top of existing RDF stores. We use a data-annotation approach to enforce access control policies. Our results are grounded on previously established formal results proposed in [14]. We present an implementation of our ideas and we show that our solution for selective disclosure scales, is independent of the user query language, and incurs reasonable overhead at runtime.

Keywords

RDF Authorization Enforcement Linked Data 

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Tarek Sayah
    • 1
  • Emmanuel Coquery
    • 1
  • Romuald Thion
    • 1
  • Mohand-Saïd Hacid
    • 1
  1. 1.Université de Lyon, CNRS, Université Lyon 1, LIRIS, UMR5205LyonFrance

Personalised recommendations