Research on Garbled Circuits-Based Identity Authentication and Ciphertext Hidden Access Control in Vehicular Networks

Since most communications in vehicular networks rely on wireless transmissions, information broadcast by vehicles is highly susceptible to interception and eavesdropping by third parties, making it vulnerable to various attacks. This can result in communication messages being tampered with and the leakage of vehicle locations and identity privacy. From a security perspective, this paper introduces Yao's garbled circuit mechanism, combining random bytes with the solutions of linear equations as identity information assigned to vehicle nodes. By employing dual authentication, the proposed approach addresses issues such as privacy protection, anonymity, replay attacks, and collusion attacks in vehicular networks, thereby enhancing security. Moreover, considering the post-authentication access control scenario, this paper proposes a novel LSSS matrix transformation algorithm for ciphertext hidden access control strategy. It realizes a partially hidden policy, which makes matrix generation more efficient by supporting both AND and OR gates, thus improving the access control efficiency while ensuring security. Performance analysis indicates that in terms of identity authentication, the scheme reduces computational costs by an average of 96.25%, and in access control, the scheme reduces key generation time by an average of 80%.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1145/3704304.3704313
Primary Topic
Vehicular Ad Hoc Networks (VANETs)
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Garbled Circuits-Based Identity Authentication and Ciphertext Hidden Access Control in Vehicular Networks

Bei Gong, Xiaohui Zhang, Fenhua Bai, Chi Zhang et al.
Vehicular Ad Hoc Networks (VANETs)
article

Research on Garbled Circuits-Based Identity Authentication and Ciphertext Hidden Access Control in Vehicular Networks

Bei Gong, Xiaohui Zhang, Fenhua Bai, Chi Zhang, Z. Jiao
article en

Abstract

Since most communications in vehicular networks rely on wireless transmissions, information broadcast by vehicles is highly susceptible to interception and eavesdropping by third parties, making it vulnerable to various attacks. This can result in communication messages being tampered with and the leakage of vehicle locations and identity privacy. From a security perspective, this paper introduces Yao's garbled circuit mechanism, combining random bytes with the solutions of linear equations as identity information assigned to vehicle nodes. By employing dual authentication, the proposed approach addresses issues such as privacy protection, anonymity, replay attacks, and collusion attacks in vehicular networks, thereby enhancing security. Moreover, considering the post-authentication access control scenario, this paper proposes a novel LSSS matrix transformation algorithm for ciphertext hidden access control strategy. It realizes a partially hidden policy, which makes matrix generation more efficient by supporting both AND and OR gates, thus improving the access control efficiency while ensuring security. Performance analysis indicates that in terms of identity authentication, the scheme reduces computational costs by an average of 96.25%, and in access control, the scheme reduces key generation time by an average of 80%.

Kunming University of Science and Technology (CN), Beijing University of Technology (CN)
Reduced inequalities
Openalex Percentile: Top 76%
Vehicular Ad Hoc Networks (VANETs)
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.