TY - GEN A1 - Kasten, Andreas A1 - Scherp, Ansgar T1 - Iterative Signing of RDF(S) Graphs, Named Graphs, and OWL Graphs: Formalization and Application N2 - When publishing graph data on the web such as vocabulariesrnusing RDF(S) or OWL, one has only limited means to verify the authenticity and integrity of the graph data. Today's approaches require a high signature overhead and do not allow for an iterative signing of graph data. This paper presents a formally defined 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 for 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. T3 - Arbeitsberichte, FB Informatik - 2013,3 KW - Semantic Web KW - OWL KW - RDF KW - minimum self-contained graphs Y1 - 2013 UR - https://kola.opus.hbz-nrw.de/frontdoor/index/index/docId/741 UR - https://nbn-resolving.org/urn:nbn:de:kola-7417 ER -