Towards a configurable framework for iterative signing of distributed graph data

Citation

Kasten A & Scherp A (2013) Towards a configurable framework for iterative signing of distributed graph data. In: Decker S, Hendler J & Kirrane 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 2013: Society, Privacy and the Semantic Web - Policy and Technology, Sydney, Australia, 21.10.2013-22.10.2013. Aachen, Germany: CEUR Workshop Proceedings.

Abstract
When publishing graph data on the web such as vocabularies using RDF(S) or OWL, one has only limited means to verify its authenticity and integrity. Today’s approaches require a high signature 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 supports 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 different 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.

Journal
CEUR Workshop Proceedings: Volume 1121