A GROUP MANAGEMENT SCHEME OF VEHICLE NETWORKING BASED ON HIERARCHICAL DISTRIBUTION
DOI:
https://doi.org/10.52292/j.laar.2023.767Keywords:
Chinese remainder theorem, elliptic curve signature algorithm (ECDSA), Internet of vehicles, Anonymity, groupsAbstract
We introduce and implement a new centralized distribution algorithm and apply it to the vehicle networking environment, reconstruct the principle structure of the one-way function binary tree based on the Chinese remainder theorem, and generate the final group key from the bottom up. The analysis shows that the final data distribution can be reduced to the logarithmic level of the traditional centralized distribution data. In the aspect of authentication, we use the elliptic curve signature algorithm (ECDSA), which is more lightweight than RSA and DSA signature algorithm, which makes it more able to adapt to the fast-moving vehicle network environment, faster and more convenient to authenticate and manage the vehicles in the coverage area. Experiments show that our model can be applied to mobile and large number of node environments, and can achieve anonymity, traceability, non-repudiation and backward security in terms of security.
Published
Issue
Section
License
Copyright (c) 2023 Latin American Applied Research

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Once a paper is accepted for publication, the author is assumed to have transferred its copyright to the Publisher. The Publisher will not, however, put any limitation on the personal freedom of the author to use material from the paper in other publications. From September 2019 it is required that authors explicitly sign a copyright release form before their paper gets published. The Author Copyright Release form can be found here