Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-26T09:27:26.776Z Has data issue: false hasContentIssue false
  • English
  • Français

Linked data privacy

Published online by Cambridge University Press:  18 March 2015

SVETLANA JAKŠIĆ ,
JOVANKA PANTOVIĆ  and
SILVIA GHILEZAN
SVETLANA JAKŠIĆ
Affiliation:
University of Novi Sad, Trg Dositeja Obradovica 6, Novi Sad, Serbia
JOVANKA PANTOVIĆ
Affiliation:
University of Novi Sad, Trg Dositeja Obradovica 6, Novi Sad, Serbia
SILVIA GHILEZAN
Affiliation:
University of Novi Sad, Trg Dositeja Obradovica 6, Novi Sad, Serbia
Get access Rights & Permissions [Opens in a new window]

Abstract

Web of Linked Data introduces common format and principles for publishing and linking data on the Web. Such a network of linked data is publicly available and easily consumable. This paper introduces a calculus for modelling networks of linked data with encoded privacy preferences.

In that calculus, a network is a parallel composition of users, where each user is named and consists of data, representing the user's profile, and a process. Data is a parallel composition of triples with names (resources) as components. Associated with each name and each triple of names are their privacy protection policies, that are represented by queries. A data triple is accessible to a user if the user's data satisfies the query assigned to that triple.

The main contribution of this model lies in the type system which together with the introduced query order ensures that static type-checking prevents privacy violations. We say that a network is well behaved if

  • — access to a triple is more restrictive than access to its components and less restrictive than access to the user name it is enclosed with,

  • — each user can completely access their own profile,

  • — each user can update or partly delete profiles that they own (can access the whole profiles), and

  • — each user can update the privacy preference policy of data of another profile that they own or write data to another profile only if the newly obtained profile stays fully accessible to their owner.

We prove that any well-typed network is well behaved.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 27 , Issue 1 , January 2017 , pp. 33 - 53
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abadi, M. and Blanchet, B. (2003). Secrecy types for asymmetric communication. Theoretical Computer Science 3 (298) 387–415.Google Scholar
Abadi, M., Corin, R. and Fournet, C. (2006). Computational secrecy by typing for the pi calculus. In: Kobayashi, N. (ed.) APLAS. Springer Lecture Notes in Computer Science 4279 253–269.Google Scholar
Berners-Lee, T., Hendler, J. and Lassila, O. (2001). The semantic web. Scientific Am. 284 (5) 35–43.Google Scholar
Bizer, C. (2009). The emerging web of linked data. IEEE Inteligent Systems 24 87–92.CrossRefGoogle Scholar
Bizer, C., Heath, T. and Berners-Lee, T. (2009). Linked data - the story so far. International Journal on Semantic Web and Information Systems 5 (3) 1–22.Google Scholar
Brickley, D. and Guha, R. V. (2004). RDF Vocabulary Description Language 1.0: RDF Schema. W3C, MIT, Cambridge, MA. REC-rdf-schema-20040210.Google Scholar
Dezani-Ciancaglini, M., Ghilezan, S., Jakšić, S. and Pantovic, J. (2010). Types for role-based access control of dynamic web data. In: WFLP'10. Lecture Notes in Computer Science 6559 1–29.Google Scholar
Dezani-Ciancaglini, M., Ghilezan, S., Pantović, J. and Varacca, D. (2008). Security types for dynamic web data. Theoretical Computer Science 402 (2–3) 156–171.Google Scholar
Dezani-Ciancaglini, M., Horne, R. and Sassone, V. (2012). Tracing where and who provenance in Linked Data: A calculus. Theoretical Computer Science 464 113–129.Google Scholar
Fournet, C., Gordon, A. and Maffeis, S. (2007). A type discipline for authorization in distributed systems. In: CSF IEEE Computer Society 31–48.Google Scholar
Fournet, C., Laneve, C., Maranget, L. and Rémy, D. (2003). Inheritance in the join calculus. Journal of Logic and Algebraic Programming 57 (1–2) 23–69.CrossRefGoogle Scholar
Haack, C. and Jeffrey, A. (2005). Timed spi-calculus with types for secrecy and authenticity. In: Abadi, M. and de Alfaro, L. (eds.) CONCUR. Springer Lecture Notes in Computer Science 3653 202–216.Google Scholar
Haris, S., Seaborne, A. and Prud'hommeaux, E. (2011). SPARQL 1.1 query language. W3C, MIT, Cambridge, MA. WD-sparql11-query-20110512.Google Scholar
Heath, T. (2011) Linked data - welcome to the data network. IEEE Internet Computing 15 (6) 70–73.Google Scholar
Heath, T. and Bizer, C. (2001). Linked data: Evolving the web into a global data space. Synthesis Lectures on the Semantic Web: Theory and Technology 1 (1) 1–136.Google Scholar
Hennessy, M. (2007). A Distributed Pi-Calculus, Cambridge University Press.Google Scholar
Horne, R. and Sassone, V. (2011a). A typed model for linked data. Technical Report, available online at http://eprints.ecs.soton.ac.uk/21996/5/paper.pdf.Google Scholar
Horne, R. and Sassone, V. (2011b). A verified algebra for linked data. In: Mousavi, M. R. and Ravara, A. (eds.) FOCLASA. Electronic Proceedings in Theoretical Computer Science 58 20–33.Google Scholar
Horne, R., Sassone, V. and Gibbins, N. (2011). Operational semantics for SPARQL update. In: 1st Joint International Semantic Technology Conference, 4–7th December 2011, Hangzhou, China 1–16.Google Scholar
Klyne, G. and Caroll, J. (2004). Resource description framework: Concepts and abstract syntax. W3C, MIT, Cambridge, MA, REC-rdf-concepts-20040210.Google Scholar
Merro, M. and Sangiorgi, D. (1998). On asynchrony in name-passing calculi. In: Larsen, K. G., Skyum, S. and Winskel, G. (eds.) ICALP. Springer Lecture Notes in Computer Science 1443 856–867.Google Scholar
Milner, R. (1999). Communicating and Mobile Systems: The π-Calculus, Cambridge University Press.Google Scholar
Milner, R., Parrow, J. and Walker, D. (1992). A calculus of mobile processes, part I and II. Information and Computation 100 (1) 1–40.Google Scholar
Prud'hommeaux, E. and Seaborne, A. (2008). SPARQL query language for RDF. W3C, MIT, Cambridge, MA. REC-rdf-sparql-query-20080115.Google Scholar
Sacco, O. and Passant, A. (2011a). A privacy preference ontology (ppo) for linked data. In: Proceedings of the Linked Data on the Web Workshop (LDOW2011), available online at http://ceur-ws.org/Vol-813/.Google Scholar
Sacco, O. and Passant, A. (2011b). A privacy preference manager for the social semantic Web. In: Proceedings of the 2nd Workshop on Semantic Personalized Information Management: Retrieval and Recommendation 42–53.Google Scholar
Sangiorgi, D. and Walker, D. (2001). The π-Calculus: A Theory of Mobile Processes, Cambridge University Press.Google Scholar
Stanković, M., Passant, A. and Laublet, P. (2009). Directing status messages to their audience in online communities. In: COIN@AAMAS&IJCAI&MALLOW. Springer Lecture Notes in Computer Science 6069 195–210.Google Scholar
Westin, A. (1967). Privacy and Freedom, New York: Atheneum.Google Scholar