Visible to the public The Scalable Group Testing of Invalid Signatures based on Latin Square in Wireless Sensors Networks

TitleThe Scalable Group Testing of Invalid Signatures based on Latin Square in Wireless Sensors Networks
Publication TypeConference Paper
Year of Publication2021
AuthorsWang, Hong, Liu, Xiangyang, Xie, Yunhong, Zeng, Han
Conference Name2021 6th International Conference on Intelligent Computing and Signal Processing (ICSP)
Date Publishedapr
KeywordsBatch verification, compositionality, digital signature, Encryption, identification of invalid signature, Latin square, Metrics, parallel processing, pubcrawl, resilience, Resiliency, Scalability, scalable verification, Signal processing, Signal processing algorithms, Wireless communication, Wireless sensor networks, wireless sensors networks
AbstractDigital signature is more appropriate for message security in Wireless Sensors Networks (WSNs), which is energy-limited, than costly encryption. However, it meets with difficulty of verification when a large amount of message-signature pairs swarm into the central node in WSNs. In this paper, a scalable group testing algorithm based on Latin square (SGTLS) is proposed, which focus on both batch verification of signatures and invalid signature identification. To address the problem of long time-delay during individual verification, we adapt aggregate signature for batch verification so as to judge whether there are any invalid signatures among the collection of signatures once. In particular, when batch verification fails, an invalid signature identification algorithm is presented based on scalable OR-checking matrix of Latin square, which can adjust the number of group testing by itself with the variation of invalid signatures. Comprehensive analyses show that SGTLS has more advantages, such as scalability, suitability for parallel computing and flexible design (Latin square is popular), than other algorithm.
DOI10.1109/ICSP51882.2021.9408780
Citation Keywang_scalable_2021