scholarly journals Location-Based Distributed Group Key Agreement Scheme for Vehicular Ad Hoc Network

2014 ◽  
Vol 10 (2) ◽  
pp. 759601 ◽  
Author(s):  
Eric Ke Wang ◽  
Yuming Ye ◽  
Xiaofei Xu
Keyword(s):  
Ad Hoc Network ◽  
Key Agreement ◽  
Ad Hoc ◽  
Vehicular Ad Hoc Network ◽  
Group Key ◽  
Group Key Agreement

Group Key Agreement Scheme for Single Link Failure in Ad-Hoc Network

2009 ◽  
Author(s):  
Jin-Ok Hwang ◽  
Young-Il Choi ◽  
Joo-Sang Youn ◽  
YoungJun Lee ◽  
Sung-Gi Min
Keyword(s):  
Ad Hoc Network ◽  
Key Agreement ◽  
Ad Hoc ◽  
Link Failure ◽  
Group Key ◽  
Group Key Agreement ◽  
Single Link

scholarly journals Blockchain-Based Dynamic Group Key Agreement Protocol for Ad Hoc Network

2020 ◽  
Vol 29 (3) ◽  
pp. 447-454
Author(s):  
Qikun Zhang ◽  
Bingli Wang ◽  
Xiaosong Zhang ◽  
Junling Yuan ◽  
Ruifang Wang
Keyword(s):  
Ad Hoc Network ◽  
Key Agreement ◽  
Ad Hoc ◽  
Group Key ◽  
Group Key Agreement ◽  
Key Agreement Protocol ◽  
Dynamic Group ◽  
Group Key Agreement Protocol

scholarly journals A Secure and Efficient Group Key Agreement Scheme for VANET

Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 482 ◽  
Author(s):  
Lianhai Liu ◽  
Yujue Wang ◽  
Jingwei Zhang ◽  
Qing Yang
Keyword(s):  
Ad Hoc Network ◽  
Key Agreement ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Security Requirements ◽  
Security And Privacy ◽  
Secret Key ◽  
Group Key ◽  
Group Key Agreement ◽  
Authentication Mechanism

A vehicular ad hoc network (VANET) is a special mobile ad hoc network that provides vehicle collaborative security applications using intervehicle communication technology. The method enables vehicles to exchange information (e.g., emergency brake). In VANET, there are many vehicle platoon driving scenes, where vehicles with identical attributes (location, organization, etc.) are organized as a group. However, this organization causes the issue of security threats (message confidentiality, identity privacy, etc.) because of an unsafe wireless communication channel. To protect the security and privacy of group communication, it is necessary to design an effective group key agreement scheme. By negotiating a dynamic session secret key using a fixed roadside unit (RSU), which has stronger computational ability than the on-board unit (OBU) equipped on the vehicle, the designed scheme can help to provide more stable communication performance and speed up the encryption and decryption processes. To effectively implement the anonymous authentication mechanism and authentication efficiency, we use a batch authentication scheme and a shared secret key mechanism among the vehicles, RSUs and trusted authority (TA). We design an efficient group secret key agreement scheme, which satisfies the above communication and security requirements, protects the privacy of vehicles, and traces the real identity of the vehicle at a time when it is necessary. Computational analysis shows that the proposed scheme is secure and more efficient than existing schemes.

scholarly journals A Chebyshev Polynomial-Based Conditional Privacy-Preserving Authentication and Group-Key Agreement Scheme for VANET

2021 ◽  
Author(s):  
Jiyun Yang ◽  
Jiamin Deng ◽  
Tao Xiang ◽  
Bo Tang
Keyword(s):  
Chebyshev Polynomial ◽  
Ad Hoc Network ◽  
Key Agreement ◽  
Ad Hoc ◽  
Chinese Remainder Theorem ◽  
Privacy Preserving ◽  
Open Communication ◽  
Group Key ◽  
Group Key Agreement ◽  
Group Members

Abstract Vehicle ad hoc network (VANET) is an open communication environment. Any user can broadcast messages, which means that it can be easily attacked by malicious users. Therefore, the authentication of vehicles is needed. In this paper, we propose a Chebyshev polynomial-based conditional privacy-preserving authentication and group-key agreement scheme for VANET. Specifically, we solve three problems in VANET: (1) we improve the effectiveness of TA by using Chebyshev polynomial to authenticate vehicles; (2) we reduce the computational burden of TA by using Chinese remainder theorem to manage group members; (3) we provide conditional privacy for users by using traceable pseudonym scheme. Theoretical and experimental results show that the proposed scheme is more efficient than existing related work.

Sign in / Sign up

Export Citation Format

Share Document