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

Hong WANG; Chengzhe LAI; Xiangyang LIU; Han ZENG

doi:10.11959/j.issn.1000-436x.2022036

您当前的位置：

首页 >

文章列表页 >

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

Papers | 更新时间：2024-06-05

- Orthogonal Latin square theory based group and batch verification for digital signatures
- Journal on Communications Vol. 43, Issue 2, Pages: 44-54(2022)
- 作者机构：
  
  1. 国防科技大学信息通信学院，陕西西安 710106
  2. 西安邮电大学网络空间安全学院，陕西西安 710121
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61871471);The Key Research and Develop-ment Program of Shaanxi Province(2021ZDLGY06-02)
- DOI：10.11959/j.issn.1000-436x.2022036
  CLC： TN918
- Online First：2022-02，
  
  Published：25 February 2022
- 稿件说明：
移动端阅览
Hong WANG, Chengzhe LAI, Xiangyang LIU, et al. Orthogonal Latin square theory based group and batch verification for digital signatures[J]. Journal on Communications, 2022, 43(2): 44-54.
DOI：

Hong WANG, Chengzhe LAI, Xiangyang LIU, et al. Orthogonal Latin square theory based group and batch verification for digital signatures[J]. Journal on Communications, 2022, 43(2): 44-54. DOI： 10.11959/j.issn.1000-436x.2022036.

摘要

针对态势感知网络中海量的、时敏性强的消息需要中心节点进行快速、安全验证的问题，基于组合数学的正交拉丁方理论设计了数字签名分组批量认证方案。该方案着眼于消息安全性验证效率的提升，利用正交拉丁方理论设计数字签名的分组方案，以聚合签名理论作为签名批量验证算法，构建了一个采取多个处理器并行运算的非适应性数字签名分组批量验证模型。理论证明和仿真分析表明，所提模型在非法数字签名个数上限d（

）已知的条件下，能以大约

次数完成 n 个非法数字签名的识别，特别是在多个处理器计算的情况下相比逐一验证、二分法验证具有时效高、容错性强的特点。

Abstract

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

times given the upper bound d (

) 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.

关键词

Keywords

references

ZHANG C X , HO P H , TAPOLCAI J . On batch verification with group testing for vehicular communications [J ] . Wireless Networks , 2011 , 17 ( 8 ): 1851 - 1865 .

WANG Y H , . A trust management model for Internet of vehicles [C ] // Proceedings of the 2020 4th International Conference on Cryptography,Security and Privacy . New York:ACM Press , 2020 : 136 - 140 .

王宏 , 李建华 , 赖成喆 , 等 . 基于纠错码理论的群组认证 [J ] . 电子学报 , 2019 , 47 ( 7 ): 1393 - 1400 .

WANG H , LI J H , LAI C Z , et al . Group authentication based on error correction coding theory [J ] . Acta Electronica Sinica , 2019 , 47 ( 7 ): 1393 - 1400 .

MAKAROV A . A survey of aggregate signature applications [J ] . Advanced Technologies in Robotics and Intelligent Systems , 2020 , 80 ( 1 ): 309 - 317 .

KOZINA G L , SAVCHENKO D K . Aggregate signature protocol with group leader [J ] . Cybernetics and Systems Analysis , 2021 , 57 ( 1 ): 165 - 172 .

TEZUKA M , TANAKA K . Improved security proof for the camenisch-lysyanskaya signature-based synchronized aggregate signature scheme [M ] . Cham : Springer , 2020 .

HE M , LI X M , NI J B , et al . Balancing efficiency and security for network access control in space-air-ground integrated networks [C ] // Proceedings of 2021 18th International Conference on Privacy,Security and Trust (PST) . Piscataway:IEEE Press , 2021 : 1 - 10 .

杨涛 , 孔令波 , 胡建斌 , 等 . 聚合签名及其应用研究综述 [J ] . 计算机研究与发展 , 2012 , 49 ( S2 ): 192 - 199 .

YANG T , KONG L B , HU J B , et al . Survey on aggregate signature and its applications [J ] . Journal of Computer Research and Development , 2012 , 49 ( S2 ): 192 - 199 .

BONEH D , GENTRY C , LYNN B , et al . Aggregate and verifiably encrypted signatures from bilinear maps [J ] . IACR Cryptology ePrint Archive,2002 , 2002 :175.

HWANG J Y , LEE D H , YUNG M . Universal forgery of the identity-based sequential aggregate signature scheme [C ] // Proceedings of the 4th International Symposium on Information,Computer,and Communications Security .[S.l.:s.n. ] , 2009 : 157 - 160 .

WEI X J , ZHANG L , LU D J . An aggregate signature scheme with forward security and non-repudiation [C ] // Proceedings of the 2019 2nd International Conference on Information Hiding and Image Processing . New York:ACM Press , 2019 : 15 - 20 .

DU D Z , HWANG F K . Combinatorial group testing and its applications [M ] . Singapore : World Scientific , 1993 .

ZAVERUCHA G M , STINSON D R . Group testing and batch verification [J ] . IACR Cryptology ePrint Archive,2009 , 2009 :240.

SCARLETT J , CEVHER V . Phase transitions in group testing [C ] // Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms . Philadelphia:Society for Industrial and Applied Mathematics , 2016 : 40 - 53 .

SHANGGUAN C , GE G N . New bounds on the number of tests for disjunct matrices [J ] . IEEE Transactions on Information Theory , 2016 , 62 ( 12 ): 7518 - 7521 .

INDYK P , NGO H Q , RUDRA A . Efficiently decodable non-adaptive group testing [C ] // Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms . Philadelphia:Society for Industrial and Applied Mathematics , 2010 : 1126 - 1142 .

ISCEN A , FURON T . Group testing for identification with privacy [C ] // Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security . New York:ACM Press , 2016 : 51 - 56 .

CHERAGHCHI M , NAKOS V . Combinatorial group testing and sparse recovery schemes with near-optimal decoding time [C ] // Proceedings of 2020 IEEE 61st Annual Symposium on Foundations of Computer Science . Piscataway:IEEE Press , 2020 : 1203 - 1213 .

BONEH D , GENTRY C , LYNN B , et al . Aggregate and verifiably encrypted signatures from bilinear maps [C ] // Advances in Cryptology— EUROCRYPT 2003 .[S.l.:s.n. ] , 2003 : 416 - 428 .

BRUALDI R . Introductory combinatorics [M ] . New Jersey : Prentice Hall , 2004 .

PASTUSZAK J , PIEPRZYK J , SEBERRY J . Codes identifying bad signatures in batches [C ] // Proceedings of 2000 International Conference on Cryptology in India (INDOCRYPT) . Berlin:Springer , 2000 : 143 - 154 .

邵嘉裕 . 组合数学 [M ] . 上海 : 同济大学出版社 , 1991 .

SHAO J Y . Combinatorial mathematics [M ] . Shanghai : Tongji University Press , 1991 .

WAN Z X . Finite fields and galois rings [M ] . Singapore : World Scientific Publishing , 2011 .

Views

2181

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Novel and lightweight digital signature scheme

Related Author

WANG Hou-zhen1

ZHANG Huan-guo1

Related Institution

The Key Laboratory of Aerospace Information Security and Trusted Computing,Ministry of Education,School of Computer,Wuhan University

Key Laboratory of Mathematics Mechanization,Chinese Academy of Sciences

AI问答

⁰