Filtern
Schlagworte
- ontology (4)
- Linked Open Data (2)
- mobile phone (2)
- multimedia metadata (2)
- Core Ontology on Multimedia (1)
- Core Ontology on Multimedia (COMM) (1)
- Linked Data Modeling (1)
- Model-Driven Engineering (1)
- Multimedia Metadata Ontology (1)
- OWL (1)
- Ontology alignment (1)
- POIs (1)
- RDF (1)
- Schema Information (1)
- Semantic Web (1)
- Support System (1)
- Vocabulary Mapping (1)
- Vocabulary Reuse (1)
- application programming interfaces (1)
- business process management (1)
- core ontologies (1)
- event model (1)
- event-based systems (1)
- events (1)
- faceted search (1)
- gaze information (1)
- image semantics (1)
- knowledge work (1)
- metadata formats (1)
- metadata standards (1)
- minimum self-contained graphs (1)
- mobile application (1)
- mobile devices (1)
- mobile facets (1)
- mobile interaction (1)
- personal information management (1)
- persönliches Informationsmanagement (1)
- points of interest (1)
- rich multimedia presentations (1)
- semantic annotation (1)
- semantic desktop (1)
- semantics (1)
- semantischer Desktop (1)
- social media (1)
- social media data (1)
- summative evaluation (1)
- tagging (1)
- visualization (1)
Iterative Signing of RDF(S) Graphs, Named Graphs, and OWL Graphs: Formalization and Application
(2013)
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.