Pub Date : 2026-04-01Epub Date: 2026-01-10DOI: 10.1016/j.vehcom.2026.100999
Sang-Quang Nguyen , Duy Tran Trung , Lam-Thanh Tu , Anh Le-Thi , Mui Van Nguyen
This paper proposes a novel secure downlink framework that integrates Partial Non-Orthogonal Multiple Access (PNOMA) with short-packet communications (SPC) under keyhole fading channels, tailored for ultra-reliable low-latency (URLLC) services. Unlike prior studies that addressed NOMA, SPC, or keyhole effects in isolation, our work is the first to jointly consider all three aspects in a unified design. Closed-form expressions for the average secure block error rate (SBLER) and block error rate (BLER) are derived under both partial and full transmission information (PTI/FTI) assumptions at the eavesdropper, together with asymptotic analysis capturing the impact of blocklength, power allocation, and keyhole severity. Numerical simulations confirm that the proposed PNOMA-SPC system consistently outperforms conventional NOMA scheme in terms of latency, reliability, and secrecy, even under strong eavesdropping conditions. These contributions provide new theoretical and practical insights into the secure design of multiple access schemes for next-generation 6G URLLC scenarios.
{"title":"Securing short-packet transmissions via partial NOMA: Performance analysis under keyhole fading","authors":"Sang-Quang Nguyen , Duy Tran Trung , Lam-Thanh Tu , Anh Le-Thi , Mui Van Nguyen","doi":"10.1016/j.vehcom.2026.100999","DOIUrl":"10.1016/j.vehcom.2026.100999","url":null,"abstract":"<div><div>This paper proposes a novel secure downlink framework that integrates Partial Non-Orthogonal Multiple Access (PNOMA) with short-packet communications (SPC) under keyhole fading channels, tailored for ultra-reliable low-latency (URLLC) services. Unlike prior studies that addressed NOMA, SPC, or keyhole effects in isolation, our work is the first to jointly consider all three aspects in a unified design. Closed-form expressions for the average secure block error rate (SBLER) and block error rate (BLER) are derived under both partial and full transmission information (PTI/FTI) assumptions at the eavesdropper, together with asymptotic analysis capturing the impact of blocklength, power allocation, and keyhole severity. Numerical simulations confirm that the proposed PNOMA-SPC system consistently outperforms conventional NOMA scheme in terms of latency, reliability, and secrecy, even under strong eavesdropping conditions. These contributions provide new theoretical and practical insights into the secure design of multiple access schemes for next-generation 6G URLLC scenarios.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 100999"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145957191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Road safety, congestion, pollution, and data security are critical challenges in the development of smart transportation systems. Vehicular Ad-hoc Networks (VANETs) form the backbone of such systems by enabling real-time communication, accident management, and traffic monitoring. However, the vast data generated in VANETs is increasingly vulnerable in the post-quantum era, where traditional cryptographic methods like RSA, ECC, and DSA fail to withstand quantum attacks. To address this, we propose the integration of the NIST-qualified Falcon algorithm, a lattice-based post-quantum cryptographic scheme, to ensure confidentiality, integrity, and resilience of vehicular communication. The proposed scheme is implemented and evaluated in a Vehicular Network Cloud (VNC) environment on different computational platforms, including Apple Silicon M1 Max and AMD Ryzen systems. Experimental results demonstrate that Falcon achieves practical signing and verification delays (22 ms and 17 ms on M1), while maintaining robust key generation performance even at higher bit lengths. Comparative analysis with RSA and ECC shows Falcon’s superiority in quantum resistance and a balanced trade-off between computational cost and communication efficiency. Although Falcon incurs relatively higher encryption and decryption delays, its security guarantees and scalability make it a strong candidate for deployment in VANETs. This research confirms that Falcon provides a feasible, quantum-resistant solution for securing smart transportation ecosystems while meeting the stringent real-time requirements of vehicular communications.
{"title":"Enhancing quantum-resistant data privacy in vehicular cloud networks using NIST-qualified FALCON algorithm","authors":"Mritunjay Shall Peelam , Brijesh Kumar Chaurasia , Man Mohan Shukla , Vinay Chamola","doi":"10.1016/j.vehcom.2025.100995","DOIUrl":"10.1016/j.vehcom.2025.100995","url":null,"abstract":"<div><div>Road safety, congestion, pollution, and data security are critical challenges in the development of smart transportation systems. Vehicular Ad-hoc Networks (VANETs) form the backbone of such systems by enabling real-time communication, accident management, and traffic monitoring. However, the vast data generated in VANETs is increasingly vulnerable in the post-quantum era, where traditional cryptographic methods like RSA, ECC, and DSA fail to withstand quantum attacks. To address this, we propose the integration of the NIST-qualified Falcon algorithm, a lattice-based post-quantum cryptographic scheme, to ensure confidentiality, integrity, and resilience of vehicular communication. The proposed scheme is implemented and evaluated in a Vehicular Network Cloud (VNC) environment on different computational platforms, including Apple Silicon M1 Max and AMD Ryzen systems. Experimental results demonstrate that Falcon achieves practical signing and verification delays (22 ms and 17 ms on M1), while maintaining robust key generation performance even at higher bit lengths. Comparative analysis with RSA and ECC shows Falcon’s superiority in quantum resistance and a balanced trade-off between computational cost and communication efficiency. Although Falcon incurs relatively higher encryption and decryption delays, its security guarantees and scalability make it a strong candidate for deployment in VANETs. This research confirms that Falcon provides a feasible, quantum-resistant solution for securing smart transportation ecosystems while meeting the stringent real-time requirements of vehicular communications.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 100995"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145894647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2025-12-22DOI: 10.1016/j.vehcom.2025.100996
Vikas Hassija , Tamonash Majumder , Debangshu Roy , Raja Piyush , Vinay Chamola
Large Language Models (LLMs) are transforming Intelligent Transportation Systems (ITS) by shifting operations from static, rule based systems toward adaptive, data-driven decision-making. This paper presents a comprehensive methodological and application-focused survey of LLMs in ITS, grounded in transformer-based architectures like GPT-4, BERT, and LlaMa. We analyze the technical challenge of integrating diverse multimodal data including sensor logs, visual inputs, and textual reports via cross-modal fusion strategies. The survey examines key applications such as traffic signal optimization, predictive maintenance, V2X communication, public transport scheduling, and route personalization. Furthermore, we detail core methodologies (e.g., fine- tuning, Chain-of-Thought prompting, federated learning, RLHF) used to enhance LLM performance under real-time conditions and assess explainability frameworks (SHAP, LIME) to foster trust. We also identify critical challenges, including model hallucination, privacy risks, resource demands, and latency constraints. By synthesizing insights from over 200 primary research contributions, this work offers a foundational reference for designing scalable, intelligent, and ethically aligned ITS architectures.
{"title":"The role of large language models (LLMs) in enhancing intelligent transportation systems: A survey","authors":"Vikas Hassija , Tamonash Majumder , Debangshu Roy , Raja Piyush , Vinay Chamola","doi":"10.1016/j.vehcom.2025.100996","DOIUrl":"10.1016/j.vehcom.2025.100996","url":null,"abstract":"<div><div>Large Language Models (LLMs) are transforming Intelligent Transportation Systems (ITS) by shifting operations from static, rule based systems toward adaptive, data-driven decision-making. This paper presents a comprehensive methodological and application-focused survey of LLMs in ITS, grounded in transformer-based architectures like GPT-4, BERT, and LlaMa. We analyze the technical challenge of integrating diverse multimodal data including sensor logs, visual inputs, and textual reports via cross-modal fusion strategies. The survey examines key applications such as traffic signal optimization, predictive maintenance, V2X communication, public transport scheduling, and route personalization. Furthermore, we detail core methodologies (e.g., fine- tuning, Chain-of-Thought prompting, federated learning, RLHF) used to enhance LLM performance under real-time conditions and assess explainability frameworks (SHAP, LIME) to foster trust. We also identify critical challenges, including model hallucination, privacy risks, resource demands, and latency constraints. By synthesizing insights from over 200 primary research contributions, this work offers a foundational reference for designing scalable, intelligent, and ethically aligned ITS architectures.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 100996"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145813956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2026-01-29DOI: 10.1016/j.vehcom.2026.101008
Lei Ding, Yi Zhi, Lina Zhu, Lu Ren, Lei Liu, Changle Li
In vehicular networks, neighbor discovery is achieved via frequently broadcasting a certain kind of control message, which is called beacon message. Since there are both control messages and various types of service messages which coexist and share wireless channels with limited communication resources, it is essential to balance the resource allocation between control messages and service messages. Specifically, if too much communication resource is allocated to transmit the control message, the communication quality of services may be degraded. Conversely, it may lead to unstable network connections and further impact the communication quality of services in vehicular networks. Thus in this work, we focus on optimizing the broadcast rate of beacon messages in a vehicular network by jointly considering the vehicle mobility, the channel randomness and the multi-traffic network characteristics, for achieving the optimal tradeoff between the accuracy and overhead of neighbor discovery. We first establish a theoretical analysis model for deriving the closed-form relationship between the stable hitting probability and the broadcast rate of beacon messages. Based on that, we then propose an optimal neighbor discovery scheme called Mobility and Multi-Traffic based Adaptive Neighbor Discovery method (MMTAND), which can adjust the broadcast rate of beacon messages according to dynamical network environments and achieve the optimal tradeoff between the accuracy and overhead of neighbor discovery. Extensive simulation results show that the proposed method outperforms the existing methods in terms of performance, which is expected to be applied to neighbor discovery in practical vehicular networks.
{"title":"Traffic aware adaptive neighbor discovery for vehicular networks","authors":"Lei Ding, Yi Zhi, Lina Zhu, Lu Ren, Lei Liu, Changle Li","doi":"10.1016/j.vehcom.2026.101008","DOIUrl":"10.1016/j.vehcom.2026.101008","url":null,"abstract":"<div><div>In vehicular networks, neighbor discovery is achieved via frequently broadcasting a certain kind of control message, which is called beacon message. Since there are both control messages and various types of service messages which coexist and share wireless channels with limited communication resources, it is essential to balance the resource allocation between control messages and service messages. Specifically, if too much communication resource is allocated to transmit the control message, the communication quality of services may be degraded. Conversely, it may lead to unstable network connections and further impact the communication quality of services in vehicular networks. Thus in this work, we focus on optimizing the broadcast rate of beacon messages in a vehicular network by jointly considering the vehicle mobility, the channel randomness and the multi-traffic network characteristics, for achieving the optimal tradeoff between the accuracy and overhead of neighbor discovery. We first establish a theoretical analysis model for deriving the closed-form relationship between the stable hitting probability and the broadcast rate of beacon messages. Based on that, we then propose an optimal neighbor discovery scheme called Mobility and Multi-Traffic based Adaptive Neighbor Discovery method (MMTAND), which can adjust the broadcast rate of beacon messages according to dynamical network environments and achieve the optimal tradeoff between the accuracy and overhead of neighbor discovery. Extensive simulation results show that the proposed method outperforms the existing methods in terms of performance, which is expected to be applied to neighbor discovery in practical vehicular networks.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 101008"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146071828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-04-01Epub Date: 2026-02-04DOI: 10.1016/j.vehcom.2026.101007
Mingfeng Huang , Peng Wang , Athanasios V. Vasilakos , Hai Zhong
Task offloading ensures low-latency responsiveness for computation-intensive Internet of Vehicles applications by dynamically distributing workloads across vehicle, edge, and cloud resources. However, due to the dynamicity of vehicle networking environment, open access characteristics, and complex interactions between vehicles and servers, existing offloading methods face dual challenges of security threats and insufficient optimization efficiency. To address this, a task offloading scheme based on lightweight identity authentication and genetic optimization is proposed in this paper. First, we design an anonymous authentication mechanism based on elliptic curves, combined with pseudo-identity generation, verifiable signatures, and timestamp technology. It ensures the privacy of vehicles while supporting malicious node tracking, thereby guaranteeing the trustworthiness of nodes participating in task offloading. After that, an improved genetic optimization model is proposed, integrating elite retention strategy, multi-point crossover-mutation operations, and resource allocation penalty functions to dynamically adapt to vehicle mobility and server resource states, achieving globally optimal offloading decisions. Finally, extensive experiments demonstrate that the proposed scheme significantly outperforms the baseline methods in terms of secure signature efficiency, authentication speed, and task processing performance. It reduces task latency by 6.29%-34.14%, and reduces energy consumption by 9.54%-35.36%.
{"title":"Task offloading based on lightweight identity authentication and genetic optimization for the internet of vehicles","authors":"Mingfeng Huang , Peng Wang , Athanasios V. Vasilakos , Hai Zhong","doi":"10.1016/j.vehcom.2026.101007","DOIUrl":"10.1016/j.vehcom.2026.101007","url":null,"abstract":"<div><div>Task offloading ensures low-latency responsiveness for computation-intensive Internet of Vehicles applications by dynamically distributing workloads across vehicle, edge, and cloud resources. However, due to the dynamicity of vehicle networking environment, open access characteristics, and complex interactions between vehicles and servers, existing offloading methods face dual challenges of security threats and insufficient optimization efficiency. To address this, a task offloading scheme based on lightweight identity authentication and genetic optimization is proposed in this paper. First, we design an anonymous authentication mechanism based on elliptic curves, combined with pseudo-identity generation, verifiable signatures, and timestamp technology. It ensures the privacy of vehicles while supporting malicious node tracking, thereby guaranteeing the trustworthiness of nodes participating in task offloading. After that, an improved genetic optimization model is proposed, integrating elite retention strategy, multi-point crossover-mutation operations, and resource allocation penalty functions to dynamically adapt to vehicle mobility and server resource states, achieving globally optimal offloading decisions. Finally, extensive experiments demonstrate that the proposed scheme significantly outperforms the baseline methods in terms of secure signature efficiency, authentication speed, and task processing performance. It reduces task latency by 6.29%-34.14%, and reduces energy consumption by 9.54%-35.36%.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 101007"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146135150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-03-23DOI: 10.1016/j.vehcom.2026.101024
Junjie Wu, Benjamin C.M. Fung, Natalia Stakhanova, Faiyaz Khan, Hanbo Yu
{"title":"Securing Automotive Data Flow: A Survey of Telematics Security Across Intra-Vehicle, V2X, and Cloud Layers","authors":"Junjie Wu, Benjamin C.M. Fung, Natalia Stakhanova, Faiyaz Khan, Hanbo Yu","doi":"10.1016/j.vehcom.2026.101024","DOIUrl":"https://doi.org/10.1016/j.vehcom.2026.101024","url":null,"abstract":"","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"33 1","pages":""},"PeriodicalIF":6.7,"publicationDate":"2026-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147501828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-03-21DOI: 10.1016/j.vehcom.2026.101020
Thanh Trung Nguyen, Manh Hoang Tran, Thanh-Lanh Le, Le The Dung
{"title":"Maximizing Secrecy Performance for UAV-Based Two-Way Relay Systems Utilizing Friendly Jamming","authors":"Thanh Trung Nguyen, Manh Hoang Tran, Thanh-Lanh Le, Le The Dung","doi":"10.1016/j.vehcom.2026.101020","DOIUrl":"https://doi.org/10.1016/j.vehcom.2026.101020","url":null,"abstract":"","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"14 1","pages":""},"PeriodicalIF":6.7,"publicationDate":"2026-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147496141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-03-16DOI: 10.1016/j.vehcom.2026.101021
Santosh Kumar, Amol Vasudeva, Manu Sood
Vehicular Ad Hoc Networks (VANETs) are a core component of Intelligent Transportation Systems (ITS), enabling safety-critical communication between vehicles. However, VANETs are vulnerable to Sybil attacks, whereby an attacker will create several fake identities to disrupt network functionality through sending spurious traffic or safety information. The countermeasures that are currently in place mainly depend on fixed roadside infrastructure, which reduces their effectiveness in areas that have little roadside infrastructure or where roadside infrastructure is unstable. In an effort to address this weakness, this paper presents UAVSyDM, a UAV-based Sybil detector that is independent of roadside infrastructure. UAVSyDM uses unmanned aerial vehicles with an array of antennas that estimate the Direction of Arrival (DoA) using the Multiple Signal Classification (MUSIC) algorithm and combine spatial measurement with Received Signal Strength Indicator (RSSI) measurement and machine-learning classification to identify malicious identities. This framework was tested and run in the NS-3.45 simulator with IEEE 802.11p communication, a vehicle density of 100 to 500 nodes, and a Sybil attack ratio of up to 30%. The data set contains 6.02 million observations with 80 multidimensional attributes based on 650 different vehicle identifiers. Experimental findings using approximately 0.80 million testing samples demonstrate that UAVSyDM achieves a classification accuracy in the range of 81.9%–83.7% and a weighted F1-score of 0.8816. The system achieves a Receiver Operating Characteristic Area Under the Curve (ROC-AUC) of 0.7707 and maintains a low False Positive Rate (FPR) of approximately 2.29%, indicating reliable discrimination between legitimate and Sybil vehicle identities. Attack-specific analysis shows that UAVSyDM achieves its highest detection performance under indirect attack scenarios, with an F1-score of approximately 0.90, while maintaining stable detection performance under direct and power-control attacks. Scalability evaluation confirms consistent detection performance across different network densities, with F1-scores improving from 0.434 at 100 nodes to 0.612 at 500 nodes. Runtime analysis indicates an average inference latency of approximately 0.224 ms, demonstrating suitability for real-time vehicular network security applications. Feature ablation experiments further confirm the importance of UAV-based spatial features, with the removal of DoA features reducing the F1-score from 0.4855 to 0.4486, corresponding to a performance decrease of approximately 7.6%. These results collectively demonstrate that UAV-assisted observation provides an effective, scalable, and infrastructure-independent solution for Sybil attack detection in vehicular networks.
{"title":"UAVSyDM: UAV-Assisted Sybil Attack Detection Mechanism in Vehicular Ad Hoc Networks","authors":"Santosh Kumar, Amol Vasudeva, Manu Sood","doi":"10.1016/j.vehcom.2026.101021","DOIUrl":"https://doi.org/10.1016/j.vehcom.2026.101021","url":null,"abstract":"Vehicular Ad Hoc Networks (VANETs) are a core component of Intelligent Transportation Systems (ITS), enabling safety-critical communication between vehicles. However, VANETs are vulnerable to Sybil attacks, whereby an attacker will create several fake identities to disrupt network functionality through sending spurious traffic or safety information. The countermeasures that are currently in place mainly depend on fixed roadside infrastructure, which reduces their effectiveness in areas that have little roadside infrastructure or where roadside infrastructure is unstable. In an effort to address this weakness, this paper presents UAVSyDM, a UAV-based Sybil detector that is independent of roadside infrastructure. UAVSyDM uses unmanned aerial vehicles with an array of antennas that estimate the Direction of Arrival (DoA) using the Multiple Signal Classification (MUSIC) algorithm and combine spatial measurement with Received Signal Strength Indicator (RSSI) measurement and machine-learning classification to identify malicious identities. This framework was tested and run in the NS-3.45 simulator with IEEE 802.11p communication, a vehicle density of 100 to 500 nodes, and a Sybil attack ratio of up to 30%. The data set contains 6.02 million observations with 80 multidimensional attributes based on 650 different vehicle identifiers. Experimental findings using approximately 0.80 million testing samples demonstrate that UAVSyDM achieves a classification accuracy in the range of 81.9%–83.7% and a weighted F1-score of 0.8816. The system achieves a Receiver Operating Characteristic Area Under the Curve (ROC-AUC) of 0.7707 and maintains a low False Positive Rate (FPR) of approximately 2.29%, indicating reliable discrimination between legitimate and Sybil vehicle identities. Attack-specific analysis shows that UAVSyDM achieves its highest detection performance under indirect attack scenarios, with an F1-score of approximately 0.90, while maintaining stable detection performance under direct and power-control attacks. Scalability evaluation confirms consistent detection performance across different network densities, with F1-scores improving from 0.434 at 100 nodes to 0.612 at 500 nodes. Runtime analysis indicates an average inference latency of approximately 0.224 ms, demonstrating suitability for real-time vehicular network security applications. Feature ablation experiments further confirm the importance of UAV-based spatial features, with the removal of DoA features reducing the F1-score from 0.4855 to 0.4486, corresponding to a performance decrease of approximately 7.6%. These results collectively demonstrate that UAV-assisted observation provides an effective, scalable, and infrastructure-independent solution for Sybil attack detection in vehicular networks.","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"17 1","pages":""},"PeriodicalIF":6.7,"publicationDate":"2026-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147464942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In vehicular ad-hoc networks (VANETs), ensuring robust security for vehicle identities and messages while maintaining essential service functionalities presents a significant challenge. This paper proposes a group signature-based anonymous authentication scheme for VANETs (GSAAS). GSAAS supports anonymous vehicle authentication within a certificateless framework, effectively mitigating the complexities associated with certificate management and distribution. To alleviate the high computation overhead on the Trust Authority (TA) and minimize the communication delay associated with pseudonym requests, the base station (BS) is employed as the group manager, enabling efficient group maintenance and pseudonym management, facilitating seamless vehicle authentication while ensuring secure data transmission. Security analysis demonstrates that GSAAS is robust against various attacks. Furthermore, performance analysis highlights the superior efficiency of GSAAS compared to existing schemes, with significant improvements in both computation and communication overheads in VANETs.
{"title":"GSAAS: A group signature-based anonymous authentication scheme for VANETs","authors":"Xinyang Deng , Xiaohong Wu , Qinggele Qi , Cong Zhao","doi":"10.1016/j.vehcom.2025.100988","DOIUrl":"10.1016/j.vehcom.2025.100988","url":null,"abstract":"<div><div>In vehicular ad-hoc networks (VANETs), ensuring robust security for vehicle identities and messages while maintaining essential service functionalities presents a significant challenge. This paper proposes a group signature-based anonymous authentication scheme for VANETs (GSAAS). GSAAS supports anonymous vehicle authentication within a certificateless framework, effectively mitigating the complexities associated with certificate management and distribution. To alleviate the high computation overhead on the Trust Authority (TA) and minimize the communication delay associated with pseudonym requests, the base station (BS) is employed as the group manager, enabling efficient group maintenance and pseudonym management, facilitating seamless vehicle authentication while ensuring secure data transmission. Security analysis demonstrates that GSAAS is robust against various attacks. Furthermore, performance analysis highlights the superior efficiency of GSAAS compared to existing schemes, with significant improvements in both computation and communication overheads in VANETs.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"57 ","pages":"Article 100988"},"PeriodicalIF":6.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145498831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}