An improved certificateless aggregate signature scheme without bilinear pairings for vehicular ad hoc networks

2019 ◽  
Vol 44 ◽  
pp. 184-200 ◽  
Author(s):  
Ismaila Adeniyi Kamil ◽  
Sunday Oyinlola Ogundoyin
IET Networks ◽  
2020 ◽  
Vol 9 (6) ◽  
pp. 290-297
Author(s):  
Jian-Neng Chen ◽  
Zhen-Jie Huang ◽  
Yu-Ping Zhou ◽  
Fu-Min Zou ◽  
Chien-Ming Chen ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Xin Ye ◽  
Gencheng Xu ◽  
Xueli Cheng ◽  
Yuedi Li ◽  
Zhiguang Qin

Development of Internet of Vehicles (IoV) has aroused extensive attention in recent years. The IoV requires an efficient communication mode when the application scenarios are complicated. To reduce the verifying time and cut the length of signature, certificateless aggregate signature (CL-AS) is used to achieve improved performance in resource-constrained environments like vehicular ad hoc networks (VANETs), which is able to make it effective in environments constrained by bandwidth and storage. However, in the real application scenarios, messages should be kept untamed, unleashed, and authentic. In addition, most of the proposed schemes tend to be easy to attack by signers or malicious entities which can be called coalition attack. In this paper, we present an improved certificateless-based authentication and aggregate signature scheme, which can properly solve the coalition attack. Moreover, the proposed scheme not only uses pseudonyms in communications to prevent vehicles from revealing their identity but also achieves considerable efficiency compared with state-of-the-art work, certificateless signature (CLS), and CL-AS schemes. Furthermore, it demonstrates that when focused on the existential forgery on adaptive chosen message attack and coalition attack, the proposed schemes can be proved secure. Also, we show that our scheme exceeds existing certification schemes in both computing and communication costs.


2015 ◽  
Vol Vol. 17 no. 1 (Distributed Computing and...) ◽  
Author(s):  
Avleen Kaur Malhi ◽  
Shalini Batra

Distributed Computing and Networking International audience The state-of-the-art telecommunication technologies have widely been adapted for sensing the traffic related information and collection of it. Vehicular Ad-Hoc Networks (VANETs) have emerged as a novel technology for revolutionizing the driving experiences of human. The most effective and widely recognized way for mutual authentication among entities in VANETs is digital signature scheme. The new and attractive paradigm which eliminates the use of certificates in public key cryptography and solves the key escrow problem in identity based cryptography is certificateless cryptography. A new certificateless aggregate signature scheme is proposed in the paper for VANETs with constant pairing computations. Assuming the hardness of computational Diffie-Hellman Problem, the scheme is proved to be existentially unforgeable in the random oracle model against adaptive chosen-message attacks.


2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Zhiyan Xu ◽  
Debiao He ◽  
Neeraj Kumar ◽  
Kim-Kwang Raymond Choo

Certificateless public key cryptosystem solves both the complex certificate management problem in the public key cryptosystem based on the PKI and the key escrow issue in the public key cryptosystem based on identity. The aggregator can compress n different signatures with respect to n messages from n signers into an aggregate signature, which can help communication equipments to save a lot of bandwidth and computing resources. Therefore, the certificateless aggregate signature (CLAS) scheme is particularly well suited to address secure routing authentication issues in resource-constrained vehicular ad hoc networks. Unfortunately, most of the existing CLAS schemes have problems with security vulnerabilities or high computation and communication overheads. To avoid the above issues and better solve the secure routing authentication problem in vehicular ad hoc networks, we present a new CLAS scheme and give the formal security proof of our scheme under the CDH assumption in the random oracle model. We then evaluate the performance of our proposed CLAS scheme, and the results demonstrate that our proposal is more practical in resource-constrained vehicular ad hoc networks.


Sign in / Sign up

Export Citation Format

Share Document