• English
  • Deutsch
  • Log In
    or
  • Research Outputs
  • Projects
  • Researchers
  • Institutes
  • Statistics
Repository logo
Fraunhofer-Gesellschaft
  1. Home
  2. Fraunhofer-Gesellschaft
  3. Konferenzschrift
  4. Hashing of RDF graphs and a solution to the blank node problem
 
  • Details
  • Full
Options
2014
Conference Paper
Titel

Hashing of RDF graphs and a solution to the blank node problem

Abstract
The ability to calculate hash values is fundamental for using cryptographic tools, such as digital signatures, with RDF data. Without hashing it is difficult to implement tamper-resistant attribution or provenance tracking, both important for establishing trust with open data. We propose a novel hash function for RDF graphs, which does not require altering the contents of the graph, does not need to record additional information, and does not depend on a concrete RDF syntax. We are also presenting a solution to the deterministic blank node labeling problem.
Author(s)
Höfig, Edzard
Schieferdecker, Ina
Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS
Hauptwerk
10th International Workshop on Uncertainty Reasoning for the Semantic Web, URSW 2014. Proceedings
Konferenz
International Workshop on Uncertainty Reasoning for the Semantic Web (URSW) 2014
International Semantic Web Conference (ISWC) 2014
Thumbnail Image
Externer Link
Externer Link
Language
English
google-scholar
Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS
  • Cookie settings
  • Imprint
  • Privacy policy
  • Api
  • Send Feedback
© 2022