An efficient integrity check method for fine-grained data over Galois field

作者：Chen Long^*; Wang Guo Yin

来源：Chinese Journal of Computers, 2011, 34(5): 846-855.

DOI：10.3724/SP.J.1016.2011.00847

• Check structures
• Combinatorial coding
• Corrupted data
• D dimensions
• Data integrity
• Finer grains
• Galois fields
• Hash
• Integrity check
• Integrity checking

Fine-grained data integrity checking methods by crossing hashing could isolate a portion of corrupted data segments and assure the integrity of other data at the same time, so as to mitigate the disaster effect on the data by some random errors or intentional forging modification. To improve the efficient of current available method for multi-error cases, a new crossing-hash integrity checking method is proposed based on Galois field uniform partition of multi-dimension structure, herein an efficient integrity indication code for multi-errors case is constructed accordingly. The method has a modular hash check structure. All hashes are divided into several groups, where each group with q rows d-1 columns hashes can indicate the integrity of all data independently in a moderate grain and combined hashes of several groups can indicate the integrity of data in a finer grain. At the same time, in a d dimension vector space over GF(q), one more error can be indicated by adding q rows d-1 columns hashes every time. Performances with various parameters of the code are analyzed. The performances analysis and experiments results show that this code can indicate multiple errors accurately and efficiently. The code provides a scalable scheme for different applications with several parameters.

• 出版日期2011