Adaptive Bitwise Division-based Searching Algorithm for Batch Verification
Authors: 
Gencheng Xu, Shiyu Jin, Kaicheng Tang, and Yimin ZhouAuthors Info & Claims
Gencheng Xu, Shiyu Jin, Kaicheng Tang, and Yimin ZhouAuthors Info & ClaimsJanuary 2022
Pages 42 - 46
Abstract
With the development of multicore processor, parallel computation is adopted to accelerate computation for higher efficiency. In signature verification process, batch verification has a high efficiency due to its aggregate operation. However, when there exists a invalid signature, the verification turns out failure, which is time-consuming. This paper proposes an adaptive bitwise division-based searching (ABDS) algorithm to provide a solution to the challenge. When there is only one invalid signature, the time complexity of ABDS algorithm is O(n) = 2 in parallel computation, while that of binary search (BS) algorithm is 1 + log 2n. Compared with BS algorithm, ABDS algorithm has a significant advantage in parallel computation when there are a small number of invalid signatures. The work can be used in searching problem where verification time greatly exceeds aggregation time.
References
[1]
[1] Jingwei Liu, Jinping Han, Longfei Wu, Rong Sun, and Xiaojiang Du. Vdas: verifiable data aggregation scheme for internet of things. In 2017 IEEE International Conference on Communications (ICC), pages 1–6. IEEE, 2017.
[2]
[2] Ismaila Adeniyi Kamil and Sunday Oyinlola Ogundoyin. An improved certificateless aggregate signature scheme without bilinear pairings for vehicular ad hoc networks. Journal of information security and applications, 44:184–200, 2019.
[3]
[3] Xiaodong Yang, Chunlin Chen, Tingchun Ma, Yutong Li, and Caifen Wang. An improved certificateless aggregate signature scheme for vehicular ad-hoc networks. In 2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), 2018.
[4]
[4] Xin Ye, Gencheng Xu, Xueli Cheng, Jin Zhou, and Zhiguang Qin. Invalid signatures searching bitwise divisions-based algorithm for vehicular ad-hoc networks. Journal of Advanced Transportation, 2021, 2021.
[5]
[5] X. Hu, W. Tan, C. Ma, F. Chen, and C. Yu. Study on security analysis and efficient imrovement of certificateless aggregate signature scheme. In 2020 IEEE 11th International Conference on Software Engineering and Service Science (ICSESS), pages 343–346, 2020.
[6]
[6] Xin Ye, Gencheng Xu, Xueli Cheng, Yuedi Li, and Zhiguang Qin. Certificateless-based anonymous authentication and aggregate signature scheme for vehicular ad hoc networks. Wireless Communications and Mobile Computing, 2021, 2021.
[7]
[7] Sattar B. Sadkhan and Basim S. Yaseen. Hybrid method to implement a parallel search of the cryptosystem keys. In 2019 International Conference on Advanced Science and Engineering (ICOASE), pages 204–207, 2019.
[8]
[8] Yuxiang Li and Zhiyong Zhang. Parallel computing: Review and perspective. In 2018 5th International Conference on Information Science and Control Engineering (ICISCE), pages 365–369, 2018.
[9]
[9] Fauzi Mohd Johar, Farah Ayuni Azmin, Mohamad Kadim Suaidi, Abdul Samad Shibghatullah, Badrul Hisham Ahmad, Siti Nadzirah Salleh, Mohamad Zoinol Abidin Abd Aziz, and Mahfuzah Md Shukor. A review of genetic algorithms and parallel genetic algorithms on graphics processing unit (gpu). In 2013 IEEE International Conference on Control System, Computing and Engineering, pages 264–269, 2013.
[10]
[10] Anna Lisa Ferrara, Matthew Green, Susan Hohenberger, and Michael Østergaard Pedersen. Practical short signature batch verification. In Marc Fischlin, editor, Topics in Cryptology – CT-RSA 2009, pages 309–324, Berlin, Heidelberg, 2009. Springer Berlin Heidelberg.
[11]
[11] Jiun Long Huang, Lo Yao Yeh, and Hung Yu Chien. Abaka: An anonymous batch authenticated and key agreement scheme for value-added services in vehicular ad hoc networks. IEEE Transactions on Vehicular Technology, 60(1):248–262, 2011.
[12]
[12] Laurie Law and Brian J. Matt. Finding invalid signatures in pairing-based batches. In Steven D. Galbraith, editor, Cryptography and Coding, pages 34–53, Berlin, Heidelberg, 2007. Springer Berlin Heidelberg.
[13]
[13] Jung Hee Cheon and Dong Hoon Lee. Use of sparse and/or complex exponents in batch verification of exponentiations. IEEE Transactions on Computers, 55(12):1536–1542, 2006.
[14]
[14] Jung Yeon Hwang, Boyeon Song, Daeseon Choi, Seung-Hun Jin, Hyun Sook Cho, and Mun-Kyu Lee. Simplified small exponent test for batch verification. Theoretical Computer Science, 662:48 – 58, 2017.
[15]
[15] Y. Huang, C. Lin, and F. Leu. Verification of a batch of bad signatures by using the matrix-detection algorithm. In 2011 First International Conference on Data Compression, Communications and Processing, pages 299–306, 2011.
[16]
[16] H. Ferng, J. Chen, M. Lotfolahi, Y. Tseng, and S. Zhang. Messages classification and dynamic batch verification scheme for vanets. IEEE Transactions on Mobile Computing, pages 1–1, 2019.
Recommendations
Improved DSA variant for batch verification
Batch verification is a method to verify multiple signatures at once. There are two issues associated with batch verification. One is the security problem and the other is the computational speed. In 1998, Bellare et al. have proposed an approach called ...
A pre-computable signature scheme with efficient verification for RFID
ISPEC'12: Proceedings of the 8th international conference on Information Security Practice and ExperiencePassive RFID tags have limited rewritable memory for data storage and limited computation power, which pose difficulties to implement security protection on RFID tags. It has been shown that strong security and privacy protections for RFID require ...
Batch verification of Digital Signatures
Digital Signatures can be considered analogous to an ordinary handwritten signature for signing messages in the Digital world. Digital signature must be unique and exclusive for each signer. Multiple Digital Signatures signed by either single or ...
Comments
Information & Contributors
Information
Published In
January 2022
159 pages
ISBN:9781450396219
DOI:10.1145/3514105
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 2022
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
icWCSN 2022
icWCSN 2022: 2022 9th international Conference on Wireless Communication and Sensor Networks
January 11 - 13, 2022
Dalian, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 29Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format