Trusty URIs: Verifiable, Immutable, and Permanent Digital Artifacts for Linked Data thumbnail
slide-image
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

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

Published on Jul 30, 20143908 Views

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 us

Related categories

Chapter list

Trusty URIs: Verifiable, Immutable, and Permanent Digital Artifacts for Linked Data00:00
Motivation 100:08
Motivation 201:18
Motivation 303:06
Problem04:16
We need URIs we can Trust!04:57
Trusty URIs05:09
Trusty URIs: Range of Veri ability07:53
Trusty URI Modules09:08
Example: Nanobrowser10:17
Verifiable11:36
Immutable12:40
Permanent12:59
Permanent Digital Artifacts13:22
Implementations14:38
Evaluation 1: Nanopubs15:10
Evaluation 2: Bio2RDF16:23
Make This a Community Effort17:47
Conclusions and Future Work18:38
Thank you for your Attention!19:58