Towards a configurable framework for iterative signing of distributed graph data
Andreas Kasten, Ansgar Scherp · Stirling Online Research Repository (University of Stirling) · 2013
Abstract. When publishing graph data on the web such as vocabu-laries using RDF(S) or OWL, one has only limited means to verify its authenticity and integrity. Today’s approaches require a high sig-nature overhead and do not allow for an iterative signing of graph data. This paper presents a configurable framework for signing arbitrary graph data provided in RDF(S), Named Graphs, or OWL. Our framework sup-ports signing graph data at different levels of granularity: minimum self-contained graphs (MSG), sets of MSGs, and entire graphs. It supports an iterative signing of graph data, e. g., when different parties provide dif-ferent parts of a common graph, and allows for signing multiple graphs. Both can be done with a constant, low overhead for the signature graph, even when iteratively signing graph data. 1