Research Article
An Efficient Authentication and Key Agreement Scheme for CAV Internal Applications
@INPROCEEDINGS{10.1007/978-3-031-54528-3_23, author={Yang Li and Qingyang Zhang and Wenwen Cao and Jie Cui and Hong Zhong}, title={An Efficient Authentication and Key Agreement Scheme for CAV Internal Applications}, proceedings={Collaborative Computing: Networking, Applications and Worksharing. 19th EAI International Conference, CollaborateCom 2023, Corfu Island, Greece, October 4-6, 2023, Proceedings, Part II}, proceedings_a={COLLABORATECOM PART 2}, year={2024}, month={2}, keywords={Connected and autonomous vehicles Signcryption Chaotic map Chinese remainder theorem}, doi={10.1007/978-3-031-54528-3_23} }- Yang Li
Qingyang Zhang
Wenwen Cao
Jie Cui
Hong Zhong
Year: 2024
An Efficient Authentication and Key Agreement Scheme for CAV Internal Applications
COLLABORATECOM PART 2
Springer
DOI: 10.1007/978-3-031-54528-3_23
Abstract
The data of applications in connected and autonomous vehicles are important, which is usually collected by service providers to improve their services, such as object detection model. But, wireless communication is susceptible to various kinds of attacks. Thus, the data of the application module needs to be securely shared to the corresponding service provider. However, current schemes are with limited performance while a service provider collects multiple application data at the same time. By adopting signcryption and chaotic map, an efficient authentication and key agreement scheme is proposed, while batch authentication is achieved for efficient message authentication of multiple applications, and the efficient revocation is realized based on Chinese remainder theorem under the assistance of trusted execution environment supported vehicle computing/communication unit. The formal security proof shows that the scheme is secure under the random oracle model, and the experiment results shows that the scheme is more efficient than related schemes and can meet the requirements of CAV.
