An efficient certificateless aggregate signature scheme for the Internet of Vehicles

• Published in: Transactions on emerging telecommunications technologies Vol. 31; no. 5
• Main Authors: Zhao, Yanan, Hou, Yingzhe, Wang, Lili, Kumari, Saru, Khan, Muhammad Khurram, Xiong, Hu
• Format: Journal Article
• Language: English
• Published: 01.05.2020
• DOI: 10.1002/ett.3708
• ISSN: 2161-3915

In recent years, the research of Internet of vehicles (IoV) has received extensive attention. In IoV, vehicles can make intelligent decisions by exchanging the real‐time traffic information between other vehicles and IoV infrastructures, thereby reducing the probability of traffic jams and accidents. Although IoV has many advantages, it is necessary to ensure that the data are not edited, forged, or disclosed during the transmission. Also, the certificateless signature (CLS) seems to be the solution to this problem. While in the high‐intensity data transmission environment, the CLS scheme is inefficient for application. To improve the efficiency, the function of aggregation was introduced into the CLS. The certificateless aggregate signature (CL‐AS) can aggregate multiple signatures into a brief signature, reducing the computational cost and the size of signature. Nevertheless, most of the recent proposed CL‐AS schemes have problems of security or efficiency. In this paper, we presented an advanced efficient CL‐AS scheme with elliptic curve cryptography for the IoV environment. In addition, the proposed scheme uses pseudonyms in communications to prevent vehicles from revealing their identity. We proved the security of our proposal in the random oracle based on computational Diffie‐Hellman assumption. Also, the efficiency analysis and simulation show the superiority of our scheme. The key findings of our scheme can be summarized as follows: 1. We presented an advanced efficient CL‐AS scheme with elliptic curve cryptography for the IoV environment. 2. The proposed scheme uses pseudonyms in communications to prevent vehicles from revealing their identity. 3. We proved the security of our proposal in the random oracle based on computational Diffie‐Hellman assumption. Simultaneously, the efficiency analysis and simulation show the superiority of our scheme.