Trusty URIs: Verifiable, Immutable, and Permanent Digital Artifacts for Linked Data

author: Tobias Kuhn, ETH Zurich
published: July 30, 2014,   recorded: May 2014,   views: 45
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

To make digital resources on the web verifi able, 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 speci fic resources but their entire reference trees veri fiable. Digital artifacts can be identi ed 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 di fferent 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.

See Also:

Download slides icon Download slides: eswc2014_kuhn_linked_data_01.pdf (444.2┬áKB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: