Orthogonal Latin square theory based group and batch verification for digital signatures
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 di...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2022-02-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022036/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <msqrt> <mi>n</mi> </msqrt> </math></inline-formula> times given the upper bound d (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>d</mi><mo>≪</mo><mi>n</mi></math></inline-formula>) 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. |
|---|---|
| ISSN: | 1000-436X |