Locating modifications in signed data for partial data integrity
We propose locating modifications in signed data to ensure partial data integrity. We use combinatorial group testing to locate which document blocks were modified. Efficient algorithms for signing and verifying are given and analyzed. Signature size is only moderately increased in this more robust scheme. The running time of our algorithms are compared with traditional signature schemes.
partial data integrity combinatorial group testing digital signatures modification localization cover-free families cryptography