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

Arun Kumar Jindal

dblp:230/2142 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0002-8064-0854ORCID · corroborated

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

Computer networks · 1Security and privacy · 1 · 1 first-author

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
1 paper
Cyber-physical and IoT security · 50% Systems and software security · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%
Computer networks
1 paper
Network management and operations · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security › vulnerability management
patch prioritization
0.412020
SmartPatch: a patch prioritization framework for SCADA chain in smart grid · MobiCom 2020
Cyber-physical and IoT security › industrial control system security
SCADA system security
0.412020
SmartPatch: a patch prioritization framework for SCADA chain in smart grid · MobiCom 2020
Energy systems and smart grids › power grid security
smart grid security
0.112020
SmartPatch: a patch prioritization framework for SCADA chain in smart grid · MobiCom 2020
Network management and operations › network security management
vulnerability management
0.112020
SmartPatch: a patch prioritization framework for SCADA chain in smart grid · MobiCom 2020

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

risk assessment · 1.3
YearPublicationVenuePosition
2020 SmartPatch: a patch prioritization framework for SCADA chain in smart grid
abstract
Supervisory Control and Data Acquisition (SCADA) systems are the industrial control systems and operational infrastructure that can monitor and control the electricity grid. Electricity grids are increasingly transforming from the one-directional way of generating, transmitting, and distributing electricity to smart grids that are multi-directional in the way they monitor, automate, and remotely operate the power sector. SCADA systems are increasingly under cyber attacks illustrating growing vulnerabilities to the smart grids. The U.S. power industry notes the importance of SCADA chain cyber risks and the need to take proactive measures (timely patching of vulnerabilities) to mitigate the risks. However, not all vulnerabilities are always exploited by attackers; and not all vulnerabilities can be patched in resource-constrained scenarios. Therefore, the patch sequence needs to be strategic and efficient.
Geeta Yadav, Praveen Gauravaram, Arun Kumar Jindal
MobiCom3
2020 Secure and Privacy Preserving Method for Biometric Template Protection using Fully Homomorphic Encryption
abstract
The rapid proliferation of biometrics has led to growing concerns about the security and privacy of the biometric data (template). A biometric uniquely identifies an individual and unlike passwords, it cannot be revoked or replaced since it is unique and fixed for every individual. To address this problem, many biometric template protection methods using fully homomorphic encryption have been proposed. But, most of them (i) are computationally expensive and practically infeasible (ii) do not support operations over real valued biometric feature vectors without quantization (iii) do not support packing of real valued feature vectors into a ciphertext (iv) require multishot enrollment of users for improved matching performance. To address these limitations, we propose a secure and privacy preserving method for biometric template protection using fully homomorphic encryption. The proposed method is computationally efficient and practically feasible, supports operations over real valued feature vectors without quantization and supports packing of real valued feature vectors into a single ciphertext. In addition, the proposed method enrolls the users using one-shot enrollment. To evaluate the proposed method, we use three face datasets namely LFW, FEI and Georgia tech face dataset. The encrypted face template (for 128 dimensional feature vector) requires 32.8 KB of memory space and it takes 2.83 milliseconds to match a pair of encrypted templates. The proposed method improves the matching performance by ~ 3% when compared to state-of-the-art, while providing high template security.
Arun Kumar Jindal, Imtiyazuddin Shaik, Vasudha, Srinivasa Rao Chalamala, M. A. Rajan, Sachin Lodha
TrustCom1