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

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

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.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-24T02:00:01.246996+00:00
License: CC-BY-4.0