Towards Threshold Anonymous Announcement With Batch Verification for Cooperative Intelligent Transport Systems
File version
Accepted Manuscript (AM)
Author(s)
Yu Zhang, Leo
Zhang, Xiaosong
Wang, Xiaofen
Wang, Fuyi
Hu, Shengshan
Doss, Robin
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
License
Abstract
In Cooperative Intelligent Transport Systems (C-ITS), vehicles can disseminate announcements to the traffic Application Server (AS) and nearby vehicles to enhance traffic safety and efficiency. To build reliable dissemination environments, various threshold announcement approaches are proposed, wherein receivers accept a traffic event only when t (threshold) vehicles have endorsed it. Among these approaches, group signaturebased approaches have emerged as promising choices for C-ITS due to their optimal tradeoff among certificate management, privacy protection, and traceability. However, existing group signature-based approaches have three limitations: 1) Announcement verification is time-consuming, making them unable to meet the fast authentication requirement of C-ITS. 2) Receivers face significant storage burdens in maintaining numerous traffic events and endorsements. 3) Unsuitable for vehicle-to-AS announcement dissemination as their one-by-one dissemination mode would impose unaffordable costs to the central AS, which limits their applicability in certain scenarios. To overcome these issues, we design an efficient group signature scheme tailored to reliable anonymous announcement dissemination. Building upon this scheme, we further present a novel threshold anonymous announcement protocol, which optimizes the announcement's dissemination mode and enables efficient batch verification. Specifically, instead of the traditional one-by-one dissemination, a compressed anonymous announcement with t endorsements is disseminated to receivers. This dissemination mode facilitates immediate announcement processing, eliminates the need for extensive traffic information maintenance, and is suitable for both Vehicle-to-Vehicle (V2V) and vehicle-to-AS announcement dissemination scenarios. Meanwhile, regardless of the threshold t, the announcement can be verified with only a small constant number of pairing and scalar multiplication operations. The theoretical analysis demonstrates that our protocol achieves the expected properties, and extensive simulation results show that our protocol outperforms the state-of-the-art protocols, indicating the performance and practicability of our protocol.
Journal Title
IEEE Transactions on Vehicular Technology
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
This work is covered by copyright. You must assume that re-use is limited to personal use and that permission from the copyright owner must be obtained for all other uses. If the document is available under a specified licence, refer to the licence for details of permitted re-use. If you believe that this work infringes copyright please make a copyright takedown request using the form at https://www.griffith.edu.au/copyright-matters.
Item Access Status
Note
This publication has been entered in Griffith Research Online as an advance online version.
Access the data
Related item(s)
Subject
Engineering
Information and computing sciences
Persistent link to this record
Citation
Wang, Y; Yu Zhang, L; Zhang, X; Wang, X; Wang, F; Hu, S; Doss, R, Towards Threshold Anonymous Announcement With Batch Verification for Cooperative Intelligent Transport Systems, IEEE Transactions on Vehicular Technology, 2024