Related Experiment Video
Updated: Jul 16, 2026

Automated Deployment of an Internet Protocol Telephony Service on Unmanned Aerial Vehicles Using Network Functions Virtualization
Published on: November 26, 2019
A Dickson polynomial based group key agreement authentication scheme for ensuring conditional privacy preservation
Y Rajkumar1, S V N Santhosh Kumar2
1School of Computer Science Engineering and Information Systems (SCORE), Vellore Institute of Technology, Vellore, Tamil Nadu, India.
A new authentication method for VANETs uses Dickson polynomials for secure, efficient communication. This approach reduces computational and communication costs, enhancing security and privacy in vehicular networks.
Area of Science:
- Computer Science
- Cybersecurity
- Network Security
Background:
- Vehicular Ad hoc Networks (VANETs) face security and privacy risks due to dynamic environments.
- Traditional Group Key Agreement Authentication (GKAA) is resource-intensive with high verification delays and central tendency.
- Existing methods struggle with computational cost, communication overhead, and conditional privacy.
Purpose of the Study:
- To propose a novel, lightweight authentication scheme for VANETs.
- To enhance security, reduce computational and communication costs, and ensure conditional privacy.
- To overcome the limitations of traditional GKAA, including central tendency and high delays.
Main Methods:
- Utilized Dickson polynomials for enhanced security and authentication.
- Implemented a chaotic mapping algorithm for a one-way hash function.
- Employed the Chinese Remainder Theorem (CRT) for distributed group key computation and dynamic updates, avoiding a Trusted Third Authority (TTA).
- Ensured conditional privacy through pseudonym traceability for illicit activities.
Main Results:
- Achieved a 39% improvement in computation cost.
- Reduced communication cost to 672 bits per message.
- Demonstrated lower verification delay compared to traditional schemes.
- Validated security and efficiency using BAN logic and ROR model.
Conclusions:
- The proposed Dickson polynomial-based GKAA scheme offers significant improvements in efficiency and security for VANETs.
- It effectively addresses the limitations of existing authentication methods, providing a lightweight and robust solution.
- The scheme enhances secure data exchange in VANETs while preserving conditional privacy.
Related Concept Videos
Van der Waals Interactions
Network Covalent Solids
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
Thevinin's Theorem
Norton's Theorem
Pilot and Numeric Relaying
Net Change Theorem
