@InProceedings{Hoefig2014,
  author    = {Edzard H{\"o}fig and Ina Kathrin Schieferdecker},
  booktitle = {Proceedings of the 10th International Workshop on Uncertainty Reasoning for the Semantic Web {(URSW} 2014) co-located with the 13th International Semantic Web Conference {(ISWC} 2014), Riva del Garda, Italy, October 19, 2014.},
  title     = {Hashing of {RDF} Graphs and a Solution to the Blank Node Problem},
  pages     = {55--66},
  url       = {https://ceur-ws.org/Vol-1259/method2014_submission_1.pdf},
  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.},
  file      = {:2014/Hoefig2014 - Hashing of RDF Graphs and a Solution to the Blank Node Problem.pdf:PDF},
  type      = {conference},
  year      = {2014}
}