Vortrag vom 12.02.2014

Vortragender: Andreas Kasten

Titel: Searching Encrypted RDF Graphs


When searching encrypted RDF graphs, the plaintext graph is not disclosed to the searching party. Instead, the party can only access the search result. In this talk, a first approach for performing user-defined SPARQL queries on
encrypted RDF graphs is presented. The approach is based on eight different types of queries, corresponding to the different binding possibilities in a single SPARQL triple pattern. The allowed queries can be further restricted by the owner of the graph data, e.g., through pre-defining a specific predicate or object. Single triple patterns can be combined to query group patterns as they can be stated in SPARQL queries and allow to execute a wide range of SELECT and ASK queries.