基于正交拉丁方理论的数字签名分组批量验证

Orthogonal Latin square theory based group and batch verification for digital signatures

针对态势感知网络中海量的、时敏性强的消息需要中心节点进行快速、安全验证的问题,基于组合数学的正交拉丁方理论设计了数字签名分组批量认证方案。该方案着眼于消息安全性验证效率的提升,利用正交拉丁方理论设计数字签名的分组方案,以聚合签名理论作为签名批量验证算法,构建了一个采取多个处理器并行运算的非适应性数字签名分组批量验证模型。理论证明和仿真分析表明,所提模型在非法数字签名个数上限d(d<<n)已知的条件下,能以大约√n次数完成n个非法数字签名的识别,特别是在多个处理器计算的情况下相比逐一验证、二分法验证具有时效高、容错性强的特点。

In order to solve the problem of fast security verification of massive and time-intensive messages on a central node in situational awareness networks, orthogonal Latin square theory based scheme was considered. Considering efficiency promotion of security verification of messages, group design of digital signatures based on orthogonal Latin square theory was formulated, batch verification of digital signatures was processed by aggregate signature, then an efficient, parallel and non-adaptive batch verification scheme of digital signatures was proposed in according with multiple processors. Theoretical analysis and simulation results demonstrate that it will be able to identify n digital signatures by approximately n;times given the upper bound d(d<<n) of invalid digital signatures, together with higher time-efficiency and stronger error-tolerance by comparing with individual testing and binary splitting algorithms especially when multiple processors are available.