arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.5775cs.CRcs.DLcs.NI
收藏

可靠的URI:链接数据的可验证、不可变和永久数字工件

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

Tobias Kuhn, Michel Dumontier

摘要:

为了使网络上的数字资源是可验证的、不可变的和永久的,我们提出了一种在URI中包含加密哈希值的技术。我们称之为可信赖的URI,我们展示了如何将它们用于纳米出版等方法,不仅使特定的资源,而且使其整个参考树可验证。数字工件不仅可以在字节级别上识别,还可以在更抽象的级别上识别,例如RDF图,这意味着即使以不同的格式呈现,资源也会保留其哈希值。我们的方法坚持网络的核心原则,即开放性和去中心化架构,与现有标准和协议完全兼容,因此可以立即使用。对我们的参考实现的评估表明,这些所需的属性确实是通过我们的方法实现的,即使对于非常大的文件,它仍然是实用的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑