论文标题
在签名数据中定位部分数据完整性
Locating modifications in signed data for partial data integrity
论文作者
论文摘要
我们考虑在签名数据中检测和定位修改以确保部分数据完整性的问题。我们假设数据分为$ n $块（不一定为相同的大小），并且为该方案可以支持的最大修改块提供了阈值$ d $。我们提出了有效的签名和验证步骤的算法，这些算法提供了相当紧凑的签名大小，相对于$ n $，可控尺寸为$ d $。例如，对于固定的$ d $，标准签名大小将乘以$ O（\ log n）$的倍数，同时允许识别高达$ d $修改的块。我们的计划基于非适应性组合组测试和无覆盖家庭。
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 fixed $d$ the standard signature size gets multiplied by a factor of $O(\log n)$, while allowing the identification of up to $d$ modified blocks. Our scheme is based on nonadaptive combinatorial group testing and cover-free families.
