首页> 外文会议>ESWC 2014;Extended Semantic Web Conference >Trusty URIs: Verifiable, Immutable, and Permanent Digital Artifacts for Linked Data
【24h】

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

机译:值得信赖的URI:有关链接数据的可验证,不变和永久性数字伪影

获取原文
获取外文期刊封面目录资料

摘要

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.
机译:为了在Web可验证,不可变和永久性上进行数字资源,我们提出了一种在URI中包含加密哈希值的技术。 我们称之为信赖的URI,我们展示了如何使用纳米普鲁布及的方法,不仅可以制定特定的资源,而是可核实的整个参考树。 数字伪像不仅可以在字节级别上识别,而是在诸如RDF图之类的更多抽象级别上识别,这意味着即使以不同的格式呈现,资源也会保持哈希值。 我们的方法牢记了网络的核心原则,即开放性和分散架构,与现有的标准和协议完全兼容,因此可以立即使用。 对我们的参考实施的评估表明,这些所需的属性确实是通过我们的方法完成的,并且即使对于非常大的文件,它仍然是实用的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号