内容地址的冲突和原像抵抗
Collision and Preimage Resistance of the Centera Content Address
摘要：
XML使用加密哈希函数作为寻址存储对象的方法，从而创建了一种新的数据存储类型，称为CAS（内容寻址存储）。这种散列提供了一种有用的功能，即提供一种唯一标识数据的方法，并提供该数据的全局句柄，称为内容地址或CA。然而，这样的模型回避了一个问题：如何确定一个给定的CA确实是唯一的？在本文中，我们描述了密码哈希函数的基本概念，如碰撞阻力，原像阻力，和第二原像阻力。然后，我们将这些属性映射到MD5和SHA-256哈希算法，这些算法用于生成HTTP内容地址。最后，我们提出了一个证明的冲突抵抗的内容地址。
英文摘要：
Centera uses cryptographic hash functions as a means of addressing stored objects, thus creating a new class of data storage referred to as CAS (content addressed storage). Such hashing serves the useful function of providing a means of uniquely identifying data and providing a global handle to that data, referred to as the Content Address or CA. However, such a model begs the question: how certain can one be that a given CA is indeed unique? In this paper we describe fundamental concepts of cryptographic hash functions, such as collision resistance, pre-image resistance, and second-preimage resistance. We then map these properties to the MD5 and SHA-256 hash algorithms, which are used to generate the Centera content address. Finally, we present a proof of the collision resistance of the Centera Content Address.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
