Trusty URIs: Verifiable, immutable, and permanent digital artifacts for linked data

Tobias Kuhn, M. Dumontier

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

43 Downloads (Pure)

Abstract

To make digital resources on the web verifiable, immutable, and permanent, we propose a technique to include cryptographic hash values in uris. We call them trusty uris and we show how they can be used for approaches like nanopublications to make not only specific resources but their entire reference trees verifiable. Digital artifacts can be identified not only on the byte level but on more abstract levels such as rdf graphs, which means that resources keep their hash values even when presented in a different format. Our approach sticks to the core principles of the web, namely openness and decentralized architecture, is fully compatible with existing standards and protocols, and can therefore be used right away. Evaluation of our reference implementations shows that these desired properties are indeed accomplished by our approach, and that it remains practical even for very large files.
Original languageEnglish
Title of host publicationThe Semantic Web: Trends and Challenges
Subtitle of host publication11th International Conference, ESWC 2014, Anissaras, Crete, Greece, May 25-29, 2014. Proceedings
PublisherSpringer, Cham
Pages395-410
Number of pages16
ISBN (Electronic)9783319074436
ISBN (Print)9783319074429
DOIs
Publication statusPublished - 16 Jan 2014
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science
Volume8465
ISSN0302-9743

Cite this

Kuhn, T., & Dumontier, M. (2014). Trusty URIs: Verifiable, immutable, and permanent digital artifacts for linked data. In The Semantic Web: Trends and Challenges: 11th International Conference, ESWC 2014, Anissaras, Crete, Greece, May 25-29, 2014. Proceedings (pp. 395-410). Springer, Cham. Lecture Notes in Computer Science, Vol.. 8465 https://doi.org/10.1007/978-3-319-07443-6_27