Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Girraj Kumar Verma

dblp:21/7513 · DBLP profile ↗
← Back
14ranked-venue papers
12as first author
8since 2021 · last 2026
0000-0001-8939-9203ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 6 first-author · 4 since 2021Security and privacy · 5 · 4 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Privacy and data protection · 35% Authentication and access control · 28% Cryptographic primitives and cryptanalysis · 22%
Computer networks
1 paper
Vehicular, aerial and satellite networks · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Authentication and access control › authentication
authentication protocols
1.012026
Lattice-Based Anonymous Batch Verifiable Authentication for Fog-Assisted VANETs · IEEE Trans. Inf. Forensics Secur. 2026
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
batch verification
1.012026
Lattice-Based Anonymous Batch Verifiable Authentication for Fog-Assisted VANETs · IEEE Trans. Inf. Forensics Secur. 2026
Privacy and data protection
data aggregation
0.712023
CB-DA: Lightweight and Escrow-Free Certificate-Based Data Aggregation for Smart Grid · IEEE Trans. Dependable Secur. Comput. 2023
Privacy and data protection
smart grid privacy
0.712023
CB-DA: Lightweight and Escrow-Free Certificate-Based Data Aggregation for Smart Grid · IEEE Trans. Dependable Secur. Comput. 2023
Vehicular, aerial and satellite networks
vehicular ad hoc networks
0.312026
Lattice-Based Anonymous Batch Verifiable Authentication for Fog-Assisted VANETs · IEEE Trans. Inf. Forensics Secur. 2026
Privacy and data protection
anonymity
0.312026
Lattice-Based Anonymous Batch Verifiable Authentication for Fog-Assisted VANETs · IEEE Trans. Inf. Forensics Secur. 2026
Authentication and access control
anonymous authentication
0.312026
Lattice-Based Anonymous Batch Verifiable Authentication for Fog-Assisted VANETs · IEEE Trans. Inf. Forensics Secur. 2026
Energy systems and smart grids
smart metering
0.212023
CB-DA: Lightweight and Escrow-Free Certificate-Based Data Aggregation for Smart Grid · IEEE Trans. Dependable Secur. Comput. 2023

Methods — techniques the papers use, named apart from their topics

random oracle model · 2.0lattice cryptography · 2.0data aggregation · 1.3certificate-based cryptography · 1.3
YearPublicationVenuePosition
2026 Efficient and secure homomorphic data aggregation for smart meter-to-grid communication
Girraj Kumar Verma, Asheesh Tiwari, Manoj Wadhwa, Neeraj Kumar 0001
Comput. Networks1
2026 Lattice-Based Anonymous Batch Verifiable Authentication for Fog-Assisted VANETs
abstract
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, Liet 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 Liet 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.
Girraj Kumar Verma, Asheesh Tiwari, Neeraj Kumar 0001, Saurabh Rana, Manoj Wadhwa
IEEE Trans. Inf. Forensics Secur.1
2025 Escrow-free and efficient dynamic anonymous privacy-preserving batch verifiable authentication scheme for VANETs
Girraj Kumar Verma, Vinay Chamola, Asheesh Tiwari, Neeraj Kumar 0001, Dheerendra Mishra, Saurabh Rana, Ahmed Barnawi
Ad Hoc Networks1
2025 Quantum-safe and provable secure vehicle to infrastructure authenticated key-agreement for VANETs
Nahida Majeed Wani, Girraj Kumar Verma, Neeraj Kumar 0001
J. Inf. Secur. Appl.2
2024 Efficient and secure signcryption-based data aggregation for Internet of Drone-based drone-to-ground station communication
Girraj Kumar Verma, Vinay Chamola, Neeraj Kumar 0001, Ashok Kumar Das, Dheerendra Mishra
Ad Hoc Networks1
2024 Dynamic-anonymous privacy-preserving authenticated aggregation for safety-warning system for the Internet of Vehicles
Girraj Kumar Verma, Nahida Majeed Wani, Saurabh Rana, Neeraj Kumar 0001, Asheesh Tiwari
J. Inf. Secur. Appl.1
2023 CB-DA: Lightweight and Escrow-Free Certificate-Based Data Aggregation for Smart Grid
abstract
Recent development of smart cities includes advanced and necessary use of modern smart grid (SG), than the traditional power grid. The paradigm of SG has also transformed houses into a home area networks (HAN). In HAN, several smart devices and appliances are connected to the electricity control centers (ECC). Appliances share their load and consumption related information to ECC through smart meters. The consumption data may be used for supply-demand management, for example, by ramping production up or down as needed. However, security and privacy of the consumers data are greatly important, since fine-grained smart meter data may reveal an users presence/absence in his/her house. To address this issue, several public-key-based or identity-based data aggregation schemes have been proposed in the literature. However, most of such schemes either suffer from the complexity of certificate management or key escrow problem. To eliminate these issues, in this paper we propose an efficient certificate-based data aggregation (CB-DA) scheme. In the proposed CB-DA scheme, the owner selects a secret key and then use the secret key along with certificates as decryption/signing keys.
Girraj Kumar Verma, Prosanta Gope, Neetesh Saxena, Neeraj Kumar 0001
IEEE Trans. Dependable Secur. Comput.1
2021 SCBS: A Short Certificate-Based Signature Scheme With Efficient Aggregation for Industrial-Internet-of-Things Environment
abstract
The advent of the Internet of Things (IoT) has escalated the sharing of information among various smart devices many fold, irrespective of their geographical location. Recently, applications, such as e-healthcare, farm monitoring, border security, smart transportation, etc. have attracted wide attention from the research community. However, as devices in the Industrial-IoT (IIoT) environment share their information using the Internet, security issues, such as authentication, integrity, and confidentiality of data pose various challenges to the research community for the successful implementation of any solution. To handle these issues, several digital signature-based schemes have been designed in the past. However, because of the usage of the identity-based public-key cryptography (IDPKC) or certificate-less-based public-key cryptography (CLPKC), these schemes suffer from key escrow or secret key distribution problems. To eliminate these flaws, this article presents a short digital signature scheme without pairing in certificate-based setting with aggregation in IIoT environment. Besides, in IIoT environment, communication and computational costs are also considered as imperative challenges. In this regard, the pairing free construction, short length signature and aggregation make it a communication and computational efficient signature scheme. The performance comparison of the proposed scheme shows that our scheme causes less computational overhead and takes significantly less execution time as compared to the existing schemes, which is imperative for the resource limited IIoT devices. We also demonstrate that signature aggregation and verification cost is 6.67(n+2) ms which is much less in comparison to the verification cost ( 20.01n ms) of n short signatures.
Girraj Kumar Verma, Neeraj Kumar 0001, Prosanta Gope, B. B. Singh, Harendra Singh
IEEE Internet Things J.1
2020 CB-CAS: Certificate-Based Efficient Signature Scheme With Compact Aggregation for Industrial Internet of Things Environment
abstract
The notion of aggregation of data in Industrial Internet of Things (IIoT) environment is a common practice. It shortens the data and associated signatures to reduce the bandwidth requirement. The compact aggregate signature (CAS) scheme creates a constant length aggregate signature (AS). Thus, the length of the CAS is independent of the number of messages or signatures to be aggregated. This article presents the first pairing-free CAS scheme in certificate-based settings. Due to the certificate-based approach, the proposed scheme is free from key escrow and key distribution problems inherited in identity-based cryptography (IDC) and certificate-less cryptography (CLC), respectively. Being compact and pairing free, it is the least bandwidth-consuming and the most efficient provably secure aggregation method. The length and computational cost analysis show that the scheme is the most appealing to use in the IIoT environment.
Girraj Kumar Verma, B. B. Singh, Neeraj Kumar 0001, Vinay Chamola
IEEE Internet Things J.1
2020 An efficient and provable certificate-based proxy signature scheme for IIoT environment
Girraj Kumar Verma, B. B. Singh, Neeraj Kumar 0001, Mohammad S. Obaidat, Debiao He, Harendra Singh
Inf. Sci.1
2018 Bandwidth efficient designated verifier proxy signature scheme for healthcare wireless sensor networks
Girraj Kumar Verma, B. B. Singh, Harendra Singh
Ad Hoc Networks1
2018 Efficient identity-based blind message recovery signature scheme from pairings
abstract
Blind signature (BS) schemes are a vital tool to design electronic cash (e‐cash), online transaction, electronic voting (e‐voting), digital right management (DRM) systems etc. The communication systems designed for such applications need small size and more confidential signature schemes. This article presents the first provably secure and efficient identity‐based message recovery BS scheme from pairing. Since, in this scheme, the message is not transmitted with signature and recovered during verification phase, the total message–signature length is the lowest. Due to the blindness, the scheme provides authentication along with anonymity. The performance comparison shows that the authors' scheme consumes the lowest computation cost. Thus, it inspires the energy efficient (green) technology as well as is the most appealing BS scheme towards applications such as e‐cash, e‐voting, DRM systems etc. using low bandwidth and high security.
Girraj Kumar Verma, B. B. Singh
IET Inf. Secur.1
2018 Provably secure certificate-based proxy blind signature scheme from pairings
Girraj Kumar Verma, B. B. Singh, Harendra Singh
Inf. Sci.1
2012 ID-based proxy signature scheme with message recovery
Harendra Singh, Girraj Kumar Verma
J. Syst. Softw.2