A framework for iterative signing of graph data on the web

Citation

Kasten A, Scherp A & Schauß P (2014) A framework for iterative signing of graph data on the web. In: Presutti V, d’Amato C, Gandon F, Tordai A, d’Aquin M & Staab S (eds.) The Semantic Web: Trends and Challenges. ESWC 2014. Lecture Notes in Computer Science, 8465. 11th International Conference, European Semantic Web Conference (ESWC) 2014, Anissaras, Greece, 25.05.2014-29.05.2014. Cham, Switzerland: Springer Verlag, pp. 146-160. https://doi.org/10.1007/978-3-319-07443-6_11

Abstract
Existing algorithms for signing graph data typically do not cover the whole signing process. In addition, they lack distinctive features such as signing graph data at different levels of granularity, iterative signing of graph data, and signing multiple graphs. In this paper, we introduce a novel framework for signing arbitrary graph data provided, e g., as RDF(S), Named Graphs, or OWL. We conduct an extensive theoretical and empirical analysis of the runtime and space complexity of different framework configurations. The experiments are performed on synthetic and real-world graph data of different size and different number of blank nodes. We investigate security issues, present a trust model, and discuss practical considerations for using our signing framework.

Keywords
#eswc2014Kasten

Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)