Kalyan Nakka

Mr. Kalyan Nakka


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 December 2024 in IEEE Access
Verified
Journal Article
Open access
Seerin AhmadSeerin Ahmad
Seerin Ahmad
KNKalyan Nakka
Kalyan Nakka
Taesic KimTaesic Kim
Taesic Kim
DHDongjn Han
Dongjn Han
Dongjun WonDongjun Won
Dongjun Won
BABoHyun Ahn
BoHyun Ahn
Grid resilience has become a paramount concern in today’s dynamic energy landscape, wherein the mass integration of distributed energy resources (DERs) plays a crucial role in achieving flexible and resilient power grids. A DER management system (DERMS) is a remote monitoring and control system managing DERs in a distribution system, which is becoming increasingly important for a DER-rich power grid. However, an outstanding issue is a single point of failure of the centralized DERMS by cyberattacks, which threatens grid stability and results in regional power outages in the worst case. This paper proposes a novel approach to address the resilience challenges faced in the centralized DERMS through the development of a blockchain (BC)-assisted resilient control mechanism. The main idea is to create a virtual DERMS monitoring and control using BC smart contract and network that takes over seamlessly in the event of a failure of the DERMS. This BC system enables securely sharing DER and grid data among BC clients and provides control commands to DERs when the DERMS is a denial-of-service condition. To demonstrate the effectiveness of the proposed BC-assisted DERMS, voltage and frequency control recovery cases are tested in a real-time hardware-in-the-loop DER system testbed.

22 August 2023 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
KNKalyan Nakka
Kalyan Nakka
HAHabib M. Ammari
Habib M. Ammari

22 March 2025 in ACM Transactions on Sensor Networks
Verified
Journal Article
Open access
KNKalyan Nakka
Kalyan Nakka
HAHabib M. Ammari
Habib M. Ammari
Coverage and connectivity are the major performance metrics that reflect the quality of service provided by heterogeneous planar wireless sensor networks (PWSNs) monitoring a planar field of interest (PFoI), where the deployed sensors may not necessarily have the same capabilities in terms of their sensing range, communication range, and maximum battery-power capacity. Precisely, coverage is considered as the main functionality of PWSNs, which is meaningful only when connectivity is guaranteed. Therefore, it is important that both coverage and connectivity be jointly considered in the deployment of heterogeneous PWSNs. In order to account for joint coverage and connectivity, we propose to solve the problem of connected k -coverage in heterogeneous PWSNs, where every point in a PFoI is covered by at least k sensors simultaneously, while all the deployed sensors are mutually connected, either directly or indirectly, with k > 1. While most existing studies of this problem focus on homogeneous sensors, which have the same above-mentioned capabilities (i.e., initial energy, sensing range, and communication range), our study in this article considers heterogeneous ones. More specifically, we propose a hierarchical (or multitier) deployment of heterogeneous sensors in a square FoI, which is divided into concentric square bands with the same width difference to achieve k -coverage of this PFoI. Based on this multitier sensor deployment and the slicing of a square FoI into square bands for k -coverage, we establish the necessary relationship for connectivity among the sensors located in adjacent bands. Finally, we propose our heterogeneous k -coverage protocol and validate our theoretical analysis using simulation results. We find that the deployment of heterogeneous sensors helps achieve much better results compared to those obtained using homogeneous sensors. Furthermore, our proposed protocol outperforms an existing connected k -coverage protocol for heterogeneous PWSNs with respect to various performance metrics.

10 February 2026 in Cryptography
Verified
Journal Article
Open access
PDF file
JDJimmy Dani
Jimmy Dani
KNKalyan Nakka
Kalyan Nakka
NSNitesh Saxena
Nitesh Saxena
Indistinguishability is a fundamental principle of cryptographic security, crucial for securing data transmitted between Internet of Things (IoT) devices. This principle ensures that an attacker cannot distinguish between the encrypted data, also known as ciphertext, and random data or the ciphertexts of two messages encrypted with the same key. This research investigates the ability of machine learning (ML) to assess the indistinguishability property in encryption systems, with a focus on lightweight ciphers. As our first case study, we consider the SPECK32/64 and SIMON32/64 lightweight block ciphers, designed for IoT devices operating under significant energy constraints. In this research, we introduce MIND-Crypt (a Machine-learning-based framework for assessing the INDistinguishability of Cryptographic algorithms), a novel ML-based framework designed to assess the cryptographic indistinguishability of lightweight block ciphers, specifically the SPECK32/64 and SIMON32/64 encryption algorithms in CBC, CFB, OFB, and CTR modes, under Known Plaintext Attacks (KPAs). Our approach involves training ML models using ciphertexts from two plaintext messages encrypted with the same key to determine whether ML algorithms can identify meaningful cryptographic patterns or leakage. Our experiments show that modern ML techniques consistently achieve accuracy equivalent to random guessing, indicating that no statistically exploitable patterns exist in the ciphertexts generated by the considered lightweight block ciphers. Although some models exhibit mode-dependent bias (e.g., collapsing to a single-class prediction in CBC and CFB), their overall accuracy remains at random guessing levels, reinforcing that no meaningful distinguishing patterns are learned. Furthermore, we demonstrate that, when ML algorithms are trained on all possible combinations of ciphertexts for given plaintext messages, their behavior reflects memorization rather than generalization to unseen ciphertexts. Collectively, these findings suggest that existing block ciphers have secure cryptographic designs against ML-based indistinguishability assessments, reinforcing their security even under round-reduced conditions.