|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Title:||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|
|Series/Report no.:||CEUR Workshop Proceedings, 1121|
|Conference Name:||Privacy Online 2017: Society, Privacy and the Semantic Web - Policy and Technology|
|Conference Dates:||2013-10-21 - 2013-10-22|
|Conference Location:||Aachen, Germany|
|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.|
|Status:||VoR - Version of Record|
|Rights:||The copyright is owned by the authors. Copying is permitted only for private and academic purposes. The permission for academic use implies an attribution obligation, i.e., you must properly cite the items that you use in your own published work. Modification is not permitted unless a suitable license is granted by its copyright owners. Copying or use for commercial purposes is forbidden unless an explicit permission is acquired from the copyright owners.|
|Kasten et al 2013.pdf||Fulltext - Published Version||417.72 kB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.