Towards search on encrypted graph data

Citation

Kasten A, Scherp A, Armknecht F & Krause M (2014) Towards search on encrypted graph data. In: Kirrane S, Hendler J & Decker S (eds.) Proceedings of the Workshop on Society, Privacy and the Semantic Web - Policy and Technology (PrivOn2013) co-located with the 12th International Semantic Web Conference (ISWC 2013), volume 1121. CEUR Workshop Proceedings, 1121. Privacy Online 2017: Society, Privacy and the Semantic Web - Policy and Technology, 21.10.2013-22.10.2013. Aachen, Germany: CEUR Workshop Proceedings. http://ceur-ws.org/Vol-1121/privon2013_paper5.pdf

Abstract
We present an approach where one can execute user defined SPARQL queries on encrypted graph data. The graph data is only partially revealed to those users authorised for executing a query. 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.

Journal
CEUR Workshop Proceedings: Volume 1121

• Kasten et al 2013