Locating modifications in signed data for partial data integrity. (arXiv:2208.01411v1 [cs.CR])

We consider the problem of detecting and locating modifications in signed
data to ensure partial data integrity. We assume that the data is divided into
$n$ blocks (not necessarily of the same size) and that a threshold $d$ is given
for the maximum amount of modified blocks that the scheme can support. We
propose efficient algorithms for signature and verification steps which provide
a reasonably compact signature size, for controlled sizes of $d$ with respect
to $n$. For instance, for …

data integrity