Optimal Two-Stage Algorithms for Group Testing Problems
SIAM Journal on Computing
Cryptographic hashing for virus localization
Proceedings of the 4th ACM workshop on Recurring malcode
Collision free hash functions and public key signature schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Data forensics constructions from cryptographic hashing and coding
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
| Hi-index | 0.00 |
Corruption-localizing hashing is a recently introduced cryptographic primitive that enhances the well-known primitive of collision-intractable hashing. In addition to allowing detection of changes in input data, they also provide a superset of the changes location, where the accuracy of this superset is formalized as a metric, called localization factor. In this paper we consider the problem of designing corruption-localizing hash schemes with reduced localization factor. We define a new and natural notion of localizing codes, and prove that any such code can be used in conjunction with collision-intractable hashing, to obtain corruption-localizing hashing, a general result of independent interest. Then we propose two localizing codes based on combinatorial group testing techniques (i.e., superimposed codes), resulting in the first corruption-localizing hash scheme with constant localization factor against an unbounded number of corruptions of distinct and unbounded lengths.