<p>Vehicle Ad-Hoc Networks (VANETs) rely primarily on wireless communication, making vehicular broadcast messages susceptible to eavesdropping and interception by third parties. Most of the existing authentication schemes use bilinear pairing operations or elliptic curve operations, which are effective but computationally expensive. To circumvent these operations, this paper proposes a reusable garbled circuit-based authentication for VANETs (RGCA), which combines garbled circuits with linear equations. This dual-authentication method meets the security requirements while reducing computational costs. The proposed scheme also creates a reusable garbled circuit through two types of inversion. This is done to address the increased communication overhead caused by the growing number of vehicles and garbled circuits. Performance analysis indicates that the proposed scheme reduces the computational cost for single nodes by 80.5<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10586_2025_5403_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">$\%$</EquationSource> <EquationSource Format="MATHML"><math> <mo>%</mo> </math></EquationSource> </InlineEquation> on average and achieves an average reduction of 72.2<InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10586_2025_5403_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">$\%$</EquationSource> <EquationSource Format="MATHML"><math> <mo>%</mo> </math></EquationSource> </InlineEquation> in the communication cost compared to existing solutions. And in high-concurrency scenarios, it reduces CPU computational burden by 58.1<InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10586_2025_5403_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">$\%$</EquationSource> <EquationSource Format="MATHML"><math> <mo>%</mo> </math></EquationSource> </InlineEquation>, while significantly lowering the energy consumption per task to just 2.85 mJ, demonstrating superior scalability and energy efficiency.</p>

RGCA: a reusable garbled circuit-based authentication for VANETs

期刊论文
发表日期：

2025年9月15日

查看全文

Fenhua Bai,
Zhilong Jiao,
Tao Shen,
Kai Zeng,
Chi Zhang,
Xiaohui Zhang,
Bei Gong

摘要

Vehicle Ad-Hoc Networks (VANETs) rely primarily on wireless communication, making vehicular broadcast messages susceptible to eavesdropping and interception by third parties. Most of the existing authentication schemes use bilinear pairing operations or elliptic curve operations, which are effective but computationally expensive. To circumvent these operations, this paper proposes a reusable garbled circuit-based authentication for VANETs (RGCA), which combines garbled circuits with linear equations. This dual-authentication method meets the security requirements while reducing computational costs. The proposed scheme also creates a reusable garbled circuit through two types of inversion. This is done to address the increased communication overhead caused by the growing number of vehicles and garbled circuits. Performance analysis indicates that the proposed scheme reduces the computational cost for single nodes by 80.5 $\%$ $%$ on average and achieves an average reduction of 72.2 $\%$ $%$ in the communication cost compared to existing solutions. And in high-concurrency scenarios, it reduces CPU computational burden by 58.1 $\%$ $%$ , while significantly lowering the energy consumption per task to just 2.85 mJ, demonstrating superior scalability and energy efficiency.