作者: Giovanni Di Crescenzo , Shaoquan Jiang , Reihaneh Safavi-Naini
DOI: 10.1007/978-3-642-04444-1_30
关键词:
摘要: Collision-intractable hashing is an important cryptographic primitive with numerous applications including efficient integrity checking for transmitted and stored data, software. In several of these applications, it that in addition to detecting corruption the data we also localize corruptions. This motivates us introduce investigate new notion corruptionlocalizing hashing, defined as a natural extension collision-intractable hashing. Our main contribution formally defining corruption-localizing hash schemes designing two such schemes, one starting from any function, other keyed function. Both have attractive efficiency properties three metrics: localization factor, tag length running time, capturing quality localization, performance terms storage time complexity, respectively. The closest previous results, when modified satisfy our formal definitions, only achieve similar case single corruption.