• search hit 1 of 3
Back to Result List

Iterative Signing of RDF(S) Graphs, Named Graphs, and OWL Graphs: Formalization and Application

  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Andreas Kasten, Ansgar Scherp
URN:urn:nbn:de:kola-7417
Series (Volume no.):Arbeitsberichte, FB Informatik (2013,3)
Document Type:Part of Periodical
Language:English
Date of completion:2013/06/11
Date of publication:2013/06/11
Publishing institution:Universität Koblenz-Landau, Universitätsbibliothek
Release Date:2013/06/11
Tag:OWL; RDF; Semantic Web; minimum self-contained graphs
Number of pages:28
Institutes:Fachbereich 4 / Fachbereich 4
Fachbereich 4 / Institut für Wirtschafts- und Verwaltungsinformatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):License LogoEs gilt das deutsche Urheberrecht: § 53 UrhG