Possibilities to Encrypt an RDF-Graph

Abstract

In this paper different approaches on achieving privacy protection in RDF graphs are discussed. Mainly this means encryption of elements and subgraphs of an RDF graph. Existing solutions have the disadvantage, that along 'with the encryption many new statements have to be generated, 'what results in a rapidly growing graph. By combining different approaches, these disadvantages can be eliminated. The result 'will be an elegant possibility to encrypt parts of an RDF graph, 'without increasing the 'whole RDF graph unnecessarily.