The Future of Research Communications and e-Scholarship

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

I am very happy to announce that our paper on Trusty URIs (previously hash-URis) got accepted for ESWC 2014. This is the 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.

Archive: https://archive.force11.net/node/5035

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Related Articles

Membership

Join the FORCE11 community and take part in our groups, conference, summer school, post on FORCE11, and attend other events.

Membership

FORCE2022 Sponsors

The FORCE11 community thanks the following organizations for their financial support of the
FORCE2022 annual conference.