Improving Disk Sector Integrity Using K-Dimension Hashing
Improving Disk Sector Integrity Using K-Dimension Hashing
复制标题
DOI：
10.1007/978-0-387-84927-0_8
复制
发表时间：
2008-01
期刊：
影响因子：
--
通讯作者：
Z. L. Jiang;L. Hui;S. Yiu
中科院分区：
文献类型：
--
作者：
Z. L. Jiang;L. Hui;S. Yiu
存储在硬盘上的数据的完整性通常通过以特定顺序计算磁盘扇区数据的链式散列值来验证。然而，当一个或多个扇区在存储期间变坏时，这种技术就会失败，从而无法计算它们的哈希值。本文提出了一种ak维哈希方案，它为每个硬盘扇区计算和存储多个哈希值。每个扇区的哈希值以不同的方式计算;因此，当硬盘出现坏扇区时，仍然可以验证未受影响扇区中数据的完整性。本文还讨论了如何调整散列参数以实现所需的属性，包括最小化由于其他扇区变坏而无法验证扇区完整性的概率。
The integrity of data stored on a hard disk is typically verified by computing the chained hash value of disk sector data in a specific order. However, this technique fails when one or more sectors turn bad during storage, making it impossible to compute their hash values. This paper presents ak-dimension hashing scheme, which computes and stores multiple hash values for each hard disk sector. The hash values for each sector are computed in different ways; thus, when a hard disk develops bad sectors, it is still possible to verify the integrity of the data in the unaffected sectors. The paper also discusses how hashing parameters may be tuned to achieve desirable properties, including minimizing the probability that the integrity of a sector cannot be verified because other sectors have gone bad.