Chebyshev Polynomial Based Emergency Conditions With Authentication Scheme for 5G-Assisted Vehicular Fog Computing

Supporting vehicular emergency applications requires fast access to infrastructure so vehicles can call for help. Because of their environment's poor wireless qualities, vehicle infrastructure communication paths lack security. Modern authentication systems used to close security vulnerabilities require a lot of computing and storage power from the vehicle's OBU. Thus, a <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">novel</b> 5G automobile network emergency situations <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">based on</b> Chebyshev polynomial using fog computing and authentication is proposed. <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">This is the first study to use</b> Chebyshev chaotic mapping algorithm <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">that</b> uses a chaotic map, rotation, and XOR to generate a one-way hash and eliminate modular multiplication index or scalar multiplication on the elliptic curve. The proposed scheme has <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">five</b> stages: installation system, initialization, enrollment, mutual authentication, and emergency request. Critical to emergency services, the suggested protocol works better in resource-limited settings like car systems. The <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">formal</b> security analysis reveals that the suggested approach guarantees message authenticity and integrity, non-repudiation, traceability, unlinkability, identity privacy, certificate independence, and emergency response. <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">The evaluation showed that</b> the proposed method cannot execute forgery, impersonation, or replay attacks. <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">The</b> proposed method has lower computational, communication, and storage overhead than earlier efforts.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Dependable and Secure Computing
Published
2025-03-24
DOI
https://doi.org/10.1109/tdsc.2025.3553868
Citations
24
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
77.91
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Chebyshev Polynomial Based Emergency Conditions With Authentication Scheme for 5G-Assisted Vehicular Fog Computing

Monagi H. Alkinani, Alaa Atallah Almazroey, Tarek Gaber, Mohammed A. Alqarni et al.
24 citations
IEEE Transactions on Dependable and Secure Computing
Blockchain Technology Applications and Security
77.91
article

Chebyshev Polynomial Based Emergency Conditions With Authentication Scheme for 5G-Assisted Vehicular Fog Computing

Monagi H. Alkinani, Alaa Atallah Almazroey, Tarek Gaber, Mohammed A. Alqarni, Abdulwahab Ali Almazroi, ‪Mahmood A. Al-Shareeda‬‏
article en
24 citations

Abstract

Supporting vehicular emergency applications requires fast access to infrastructure so vehicles can call for help. Because of their environment's poor wireless qualities, vehicle infrastructure communication paths lack security. Modern authentication systems used to close security vulnerabilities require a lot of computing and storage power from the vehicle's OBU. Thus, a <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">novel</b> 5G automobile network emergency situations <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">based on</b> Chebyshev polynomial using fog computing and authentication is proposed. <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">This is the first study to use</b> Chebyshev chaotic mapping algorithm <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">that</b> uses a chaotic map, rotation, and XOR to generate a one-way hash and eliminate modular multiplication index or scalar multiplication on the elliptic curve. The proposed scheme has <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">five</b> stages: installation system, initialization, enrollment, mutual authentication, and emergency request. Critical to emergency services, the suggested protocol works better in resource-limited settings like car systems. The <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">formal</b> security analysis reveals that the suggested approach guarantees message authenticity and integrity, non-repudiation, traceability, unlinkability, identity privacy, certificate independence, and emergency response. <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">The evaluation showed that</b> the proposed method cannot execute forgery, impersonation, or replay attacks. <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">The</b> proposed method has lower computational, communication, and storage overhead than earlier efforts.

IEEE Transactions on Dependable and Secure ComputingVol. 22(5)
Aljazeera Hospital (SA), University of Jeddah (SA), Southern Technical University (IQ), University of Salford (GB)
Climate action
Openalex Percentile: Top 0%
Blockchain Technology Applications and Security
77.91
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.