Girraj Kumar Verma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Girraj Kumar Verma has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Neeraj Kumar
Thapar Institute of Engineering and Technology
13 shared publications Asheesh Tiwari
8 shared publicationsB. B. Singh
Department of Computer Science, Govt. K. R. G. (PG) College, Gwalior, India
5 shared publicationsB.B. Singh
4 shared publicationsHarendra Singh
4 shared publications- Nahida Majeed Wani
Amity University, Madhya Pradesh
4 shared publications
Latest Publications
- 27 May 2026
- Published by Elsevier in Computer Networks
- Vol. 285
Efficient and secure homomorphic data aggregation for smart meter-to-grid communication
- 27 May 2026
- Published by Elsevier in Computer Networks
- Vol. 285
Efficient and secure homomorphic data aggregation for smart meter-to-grid communication
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 3053-3065
Lattice-Based Anonymous Batch Verifiable Authentication for Fog-Assisted VANETs
The integration of advanced communication technologies with modern vehicular systems has driven the evolution of vehicular ad-hoc networks (VANETs). These networks enable a seamless exchange of road safety information between vehicles and traffic management authorities via wireless links. However, the open nature of these communication channels introduces significant risks to the privacy and security of transmitted messages. To address these challenges, Li et al. (IEEE Trans. Inf. Forensics and Security, vol. 19, pp. 9629–9642, 2024) proposed a lattice-based authentication scheme designed for fog-assisted VANETs. This protocol utilizes lattice cryptography to ensure resilience against quantum attacks and employs fog computing to tackle scalability issues. Despite these advancements, a detailed analysis uncovers several vulnerabilities and inefficiencies in their design. This study identifies an anonymity disclosure attack on Li et al.’s scheme, compromising its privacy guarantees. In addition, redundancies in the signature generation process impose excessive computational burdens on resource-constrained vehicular devices. To address these shortcomings, this work introduces a lattice-based anonymous batch-verifiable authentication (LBABVA) scheme. Rigorous security analysis proves the scheme’s security in the random oracle model, while efficiency evaluations reveal significant improvements. The proposed scheme reduces the computational cost of the signing phase to 14.57% and the signature verification phase to 83.99% of the corresponding costs of the previous design, highlighting its superior performance and suitability for practical applications.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 3053-3065
Lattice-Based Anonymous Batch Verifiable Authentication for Fog-Assisted VANETs
The integration of advanced communication technologies with modern vehicular systems has driven the evolution of vehicular ad-hoc networks (VANETs). These networks enable a seamless exchange of road safety information between vehicles and traffic management authorities via wireless links. However, the open nature of these communication channels introduces significant risks to the privacy and security of transmitted messages. To address these challenges, Li et al. (IEEE Trans. Inf. Forensics and Security, vol. 19, pp. 9629–9642, 2024) proposed a lattice-based authentication scheme designed for fog-assisted VANETs. This protocol utilizes lattice cryptography to ensure resilience against quantum attacks and employs fog computing to tackle scalability issues. Despite these advancements, a detailed analysis uncovers several vulnerabilities and inefficiencies in their design. This study identifies an anonymity disclosure attack on Li et al.’s scheme, compromising its privacy guarantees. In addition, redundancies in the signature generation process impose excessive computational burdens on resource-constrained vehicular devices. To address these shortcomings, this work introduces a lattice-based anonymous batch-verifiable authentication (LBABVA) scheme. Rigorous security analysis proves the scheme’s security in the random oracle model, while efficiency evaluations reveal significant improvements. The proposed scheme reduces the computational cost of the signing phase to 14.57% and the signature verification phase to 83.99% of the corresponding costs of the previous design, highlighting its superior performance and suitability for practical applications.
- 28 October 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 95
Quantum-safe and provable secure vehicle to infrastructure authenticated key-agreement for VANETs
- 28 October 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 95
Quantum-safe and provable secure vehicle to infrastructure authenticated key-agreement for VANETs
- 29 August 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 128
PUF enabled and dynamic anonymous certificateless batch-verifiable signcryption for IoMT
- 29 August 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 128
PUF enabled and dynamic anonymous certificateless batch-verifiable signcryption for IoMT
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (1) , 1469-1479
Dynamic Anonymous Online-Offline Signcryption for Edge-Assisted Internet of Vehicles
The Internet of Vehicles (IoV) facilitates wireless communication between vehicles and traffic authoritiesto enhance road safety. However, ensuring authentication, integrity, and confidentiality in open networksremains challenging. Additionally, issues like message delays and congestion are affecting efficiency. To mitigate these limitations, a novel dynamic-anonymous edge-assisted certificate-based signcryption scheme has been proposed. By integrating dynamic anonymity and signcryption, the scheme eliminates multiple pseudonym storage. Besides, its certificate-based framework removes secure channel dependency and mitigates key escrow risks. A formal security proof is provided, based on the hardness of the Elliptic Curve Discrete Logarithm Problem. An informal security analysis confirms the scheme's robustness against various practical attacks. Additionally, detailed efficiency evaluation shows that the offline and online signcryption processes incur only 16.88% and 22.81% of the computational cost of the same phases of a recent design.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (1) , 1469-1479
Dynamic Anonymous Online-Offline Signcryption for Edge-Assisted Internet of Vehicles
The Internet of Vehicles (IoV) facilitates wireless communication between vehicles and traffic authoritiesto enhance road safety. However, ensuring authentication, integrity, and confidentiality in open networksremains challenging. Additionally, issues like message delays and congestion are affecting efficiency. To mitigate these limitations, a novel dynamic-anonymous edge-assisted certificate-based signcryption scheme has been proposed. By integrating dynamic anonymity and signcryption, the scheme eliminates multiple pseudonym storage. Besides, its certificate-based framework removes secure channel dependency and mitigates key escrow risks. A formal security proof is provided, based on the hardness of the Elliptic Curve Discrete Logarithm Problem. An informal security analysis confirms the scheme's robustness against various practical attacks. Additionally, detailed efficiency evaluation shows that the offline and online signcryption processes incur only 16.88% and 22.81% of the computational cost of the same phases of a recent design.
- 24 June 2025
- Published by Springer Nature
- p. 63-74
Cryptanalysis of Continuous Leakage-Resilient Signcryption Scheme in Cloud Computing
- 24 June 2025
- Published by Springer Nature
- p. 63-74
Cryptanalysis of Continuous Leakage-Resilient Signcryption Scheme in Cloud Computing
- 2 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (9) , 14735-14744
Dynamic Anonymous Hierarchical Edge-Assisted Batch Verifiable Authentication for VANETs
The increasing density of vehicles on roads has raised concerns for transportation system safety and convenience. To mitigate accident and congestion risks, integrating advanced vehicular and communication technologies has facilitated the development of vehicular ad-hoc networks (VANETs). These networks enable vehicles to share real-time safety alerts with other vehicles and traffic authorities. However, open wireless links in VANETs are susceptible to security threats, making the authentication and integrity of transmitted safety alerts essential. Yan et al. addressed these needs with a hierarchical authentication scheme (IEEE Trans. on Veh. Tech., vol. 73, no. 1, pp. 1253–1262, 2023). Unfortunately, the devised study identifies vulnerabilities in Yan et al.'s design, specifically concerning forgery and anonymity exposure attacks. In response, an improved, secure hierarchical authentication scheme is proposed. Through both formal and informal security analyses, it is demonstrated to be resilient against various practical attacks. A thorough performance evaluation further supports the design's practical suitability for deployment within VANET infrastructure, offering enhanced security for safer transportation networks
- 2 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (9) , 14735-14744
Dynamic Anonymous Hierarchical Edge-Assisted Batch Verifiable Authentication for VANETs
The increasing density of vehicles on roads has raised concerns for transportation system safety and convenience. To mitigate accident and congestion risks, integrating advanced vehicular and communication technologies has facilitated the development of vehicular ad-hoc networks (VANETs). These networks enable vehicles to share real-time safety alerts with other vehicles and traffic authorities. However, open wireless links in VANETs are susceptible to security threats, making the authentication and integrity of transmitted safety alerts essential. Yan et al. addressed these needs with a hierarchical authentication scheme (IEEE Trans. on Veh. Tech., vol. 73, no. 1, pp. 1253–1262, 2023). Unfortunately, the devised study identifies vulnerabilities in Yan et al.'s design, specifically concerning forgery and anonymity exposure attacks. In response, an improved, secure hierarchical authentication scheme is proposed. Through both formal and informal security analyses, it is demonstrated to be resilient against various practical attacks. A thorough performance evaluation further supports the design's practical suitability for deployment within VANET infrastructure, offering enhanced security for safer transportation networks
- 23 September 2024
- Published by Elsevier in Ad Hoc Networks
- Vol. 166
Escrow-free and efficient dynamic anonymous privacy-preserving batch verifiable authentication scheme for VANETs
- 23 September 2024
- Published by Elsevier in Ad Hoc Networks
- Vol. 166
Escrow-free and efficient dynamic anonymous privacy-preserving batch verifiable authentication scheme for VANETs
- 3 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (4) , 7112-7120
Dynamic Anonymous Quantum-Secure Batch-Verifiable Authentication Scheme for VANET
Integrating cutting-edge communication technology with vehicular advancement has led to Vehicular Ad-Hoc Networks (VANETs). VANET architecture facilitates the exchange of vital safety-related messages among vehicles. However, ensuring the authentication and integrity of shared messages over wireless links poses challenges. To resolve the issues, various batch-verifiable authentication schemes have been devised previously. However, existing VANET batch-verifiable authentication schemes utilize number theory-based cryptography, and therefore are vulnerable to quantum computing attacks. Additionally, storing multiple pseudonyms for anonymity incurs storage overhead on vehicles. To address these issues, this paper presents a novel lattice-based dynamic anonymous batch-verifiable authentication scheme. Being a lattice-based design, it is robust against post-quantum threats. To achieve dynamic anonymity, a fuzzy extractor design has been utilized, which removes the storage of multiple pseudonyms. The provable security has been achieved via formal analysis in the random oracle model, and an extensive performance evaluation confirms its efficiency and suitability for VANETs.
- 3 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (4) , 7112-7120
Dynamic Anonymous Quantum-Secure Batch-Verifiable Authentication Scheme for VANET
Integrating cutting-edge communication technology with vehicular advancement has led to Vehicular Ad-Hoc Networks (VANETs). VANET architecture facilitates the exchange of vital safety-related messages among vehicles. However, ensuring the authentication and integrity of shared messages over wireless links poses challenges. To resolve the issues, various batch-verifiable authentication schemes have been devised previously. However, existing VANET batch-verifiable authentication schemes utilize number theory-based cryptography, and therefore are vulnerable to quantum computing attacks. Additionally, storing multiple pseudonyms for anonymity incurs storage overhead on vehicles. To address these issues, this paper presents a novel lattice-based dynamic anonymous batch-verifiable authentication scheme. Being a lattice-based design, it is robust against post-quantum threats. To achieve dynamic anonymity, a fuzzy extractor design has been utilized, which removes the storage of multiple pseudonyms. The provable security has been achieved via formal analysis in the random oracle model, and an extensive performance evaluation confirms its efficiency and suitability for VANETs.