Sandhya Koteshwara
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sandhya Koteshwara has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Keshab K. Parhi
University of Minnesota
4 shared publications Amitabh Das
2 shared publications- Abdul Alim
Department of Mathematics, Rajshahi University of Engineering & Technology, Rajshahi, Bangladesh
1 shared publication - Abdullah Kayi
IBM Research, Yorktown Heights, NY, USA
1 shared publication - Ali Sydney
IBM Research, Cambridge, MA, USA
1 shared publication - Amitabh Das
Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, USA
1 shared publication
Latest Publications
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1348-1364
Vela: A Virtualized LLM Training System with GPU Direct RoCE
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1348-1364
Open AccessVela: A Virtualized LLM Training System with GPU Direct RoCE
- Open Access
- 2 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 19-27
Position Paper: From Confidential Computing to Zero Trust, Come Along for the (Bumpy?) Ride
- 2 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 19-27
Open AccessPosition Paper: From Confidential Computing to Zero Trust, Come Along for the (Bumpy?) Ride
- 16 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Security Risk Assessment of Server Hardware Architectures Using Graph Analysis
The growing complexity of server architectures, which incorporate several components with state, has necessitated rigorous assessment of the security risk both during design and operation. In this paper, we propose a novel technique to model the security risk of servers by mapping their architectures to graphs. This allows us to leverage tools from computational graph theory, which we combine with probability theory for deriving quantitative metrics for risk assessment. Probability of attack is derived for server components, with prior probabilities assigned based on knowledge of existing vulnerabilities and countermeasures. The resulting analysis is further used to compute measures of impact and exploitability of attack. The proposed methods are demonstrated on two open-source server designs with different architectures.
- 16 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Security Risk Assessment of Server Hardware Architectures Using Graph Analysis
The growing complexity of server architectures, which incorporate several components with state, has necessitated rigorous assessment of the security risk both during design and operation. In this paper, we propose a novel technique to model the security risk of servers by mapping their architectures to graphs. This allows us to leverage tools from computational graph theory, which we combine with probability theory for deriving quantitative metrics for risk assessment. Probability of attack is derived for server components, with prior probabilities assigned based on knowledge of existing vulnerabilities and countermeasures. The resulting analysis is further used to compute measures of impact and exploitability of attack. The proposed methods are demonstrated on two open-source server designs with different architectures.
- 2 November 2020
- Published by Springer Nature in Journal of Hardware and Systems Security
- Vol. 4 (4) , 343-360
Probabilistic Hardware Trojan Attacks on Multiple Layers of Reconfigurable Network Infrastructure
- 2 November 2020
- Published by Springer Nature in Journal of Hardware and Systems Security
- Vol. 4 (4) , 343-360
Probabilistic Hardware Trojan Attacks on Multiple Layers of Reconfigurable Network Infrastructure
- 14 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 8 (4) , 822-835
Incremental-Precision Based Feature Computation and Multi-Level Classification for Low-Energy Internet-of-Things
This paper presents a novel technique to reduce energy consumption of a machine learning classifier based on incremental-precision feature computation and classification. Specifically, the algorithm starts with features computed using the lowest possible precision. Depending on the classification accuracy, the features of the previous level are combined with features of the incremental-precision to compute the features in higher-precision. This process is continued till a desired accuracy is obtained. A certain threshold that allows many samples to be classified using a low-precision classifier can reduce energy consumption, but increases misclassification error. To implement hardware which provides the required updates in precision, an incremental-precision architecture based on data-path decomposition is proposed. One novel aspect of this work lies in the design of appropriate thresholds for multi-level classification using training data such that a family of designs can be obtained that enable trade-offs between classification accuracy and energy consumption. Another novel aspect involves the design of hardware architectures based on data-path decomposition which can incrementally increase precision upon demand. Using a seizure detection example, it is shown that the proposed incremental-precision based multi-level classification approach can reduce energy consumption by 35% while maintaining high sensitivity, or by about 50% at the expense of 15% degradation in sensitivity compared to similar approaches to seizure detection in literature. The reduction in energy is achieved at the expense of small area, timing and memory overheads as multiple classification steps are used instead of a single step.
- 14 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 8 (4) , 822-835
Incremental-Precision Based Feature Computation and Multi-Level Classification for Low-Energy Internet-of-Things
This paper presents a novel technique to reduce energy consumption of a machine learning classifier based on incremental-precision feature computation and classification. Specifically, the algorithm starts with features computed using the lowest possible precision. Depending on the classification accuracy, the features of the previous level are combined with features of the incremental-precision to compute the features in higher-precision. This process is continued till a desired accuracy is obtained. A certain threshold that allows many samples to be classified using a low-precision classifier can reduce energy consumption, but increases misclassification error. To implement hardware which provides the required updates in precision, an incremental-precision architecture based on data-path decomposition is proposed. One novel aspect of this work lies in the design of appropriate thresholds for multi-level classification using training data such that a family of designs can be obtained that enable trade-offs between classification accuracy and energy consumption. Another novel aspect involves the design of hardware architectures based on data-path decomposition which can incrementally increase precision upon demand. Using a seizure detection example, it is shown that the proposed incremental-precision based multi-level classification approach can reduce energy consumption by 35% while maintaining high sensitivity, or by about 50% at the expense of 15% degradation in sensitivity compared to similar approaches to seizure detection in literature. The reduction in energy is achieved at the expense of small area, timing and memory overheads as multiple classification steps are used instead of a single step.
- Open Access
- 10 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 13 (1) , 79-93
Key-Based Dynamic Functional Obfuscation of Integrated Circuits Using Sequentially Triggered Mode-Based Design
This paper proposes a novel technique for hardware obfuscation termed dynamic functional obfuscation. Hardware obfuscation refers to a set of countermeasures used against IC counterfeiting and illegal overproduction. Traditionally, obfuscation encrypts semiconductor circuits using key inputs which must be set to a correct value to operate the circuit correctly. By keeping the key values secret during the manufacturing process, any attempt by unauthorized parties to overproduce chips or pirate designs is thwarted. The proposed dynamic technique differs from existing fixed obfuscation schemes as the obfuscating signals change over time. This results in inconsistent circuit behavior upon input of incorrect key, where the chip operates correctly sometimes and fails sometimes. The advantage of dynamic obfuscation is that it results in stronger obfuscation by increasing the time complexity of deciphering the correct key using brute-force attack, even with shorter keys. Moreover, the dynamic nature of these circuits also makes them resistant to reverse engineering and SAT solver-based attacks. To achieve dynamic obfuscation, ideas from hardware Trojan literature and sequentially triggered counters are utilized. A demonstration of obfuscation on sequential circuits implementing fast Fourier transform (FFT) algorithm and Ethernet IP shows low overall area and power overheads of less than 1%. Security in terms of time to attack for the FFT circuit (for a key size of 30 bits and a system operating at 100 MHz) is increased to 1021,055 years using dynamic obfuscation compared with only 5.36 s using fixed obfuscation schemes. For the Ethernet IP core, time to attack of dynamic obfuscation with a key size of 32 bits is 1046,423,135 years compared with 21.47s with fixed obfuscation. It is also shown that for a key size of K bits, the lower bound for time to attack using brute-force is proportional to K2 K and K2 2K for the proposed design using one and two random number generators, respectively.
- 10 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 13 (1) , 79-93
Open AccessKey-Based Dynamic Functional Obfuscation of Integrated Circuits Using Sequentially Triggered Mode-Based Design
This paper proposes a novel technique for hardware obfuscation termed dynamic functional obfuscation. Hardware obfuscation refers to a set of countermeasures used against IC counterfeiting and illegal overproduction. Traditionally, obfuscation encrypts semiconductor circuits using key inputs which must be set to a correct value to operate the circuit correctly. By keeping the key values secret during the manufacturing process, any attempt by unauthorized parties to overproduce chips or pirate designs is thwarted. The proposed dynamic technique differs from existing fixed obfuscation schemes as the obfuscating signals change over time. This results in inconsistent circuit behavior upon input of incorrect key, where the chip operates correctly sometimes and fails sometimes. The advantage of dynamic obfuscation is that it results in stronger obfuscation by increasing the time complexity of deciphering the correct key using brute-force attack, even with shorter keys. Moreover, the dynamic nature of these circuits also makes them resistant to reverse engineering and SAT solver-based attacks. To achieve dynamic obfuscation, ideas from hardware Trojan literature and sequentially triggered counters are utilized. A demonstration of obfuscation on sequential circuits implementing fast Fourier transform (FFT) algorithm and Ethernet IP shows low overall area and power overheads of less than 1%. Security in terms of time to attack for the FFT circuit (for a key size of 30 bits and a system operating at 100 MHz) is increased to 1021,055 years using dynamic obfuscation compared with only 5.36 s using fixed obfuscation schemes. For the Ethernet IP core, time to attack of dynamic obfuscation with a key size of 32 bits is 1046,423,135 years compared with 21.47s with fixed obfuscation. It is also shown that for a key size of K bits, the lower bound for time to attack using brute-force is proportional to K2 K and K2 2K for the proposed design using one and two random number generators, respectively.
- 14 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test
- Vol. 34 (4) , 26-33
Comparative Study of Authenticated Encryption Targeting Lightweight IoT Applications
This article focuses on detecting attacks to power system with the help of cyber-physical co-modeling. The foundational algorithm used to detect attacks is a new dynamic state estimator that can provide real-tie models of the system improving over legacy state estimators and three-phase linear state estimators. This new system can help operators of the power grid detect when device settings have been tampered, and help identified the context of a command (i.e., under which conditions of the system are specific commands allowed). -Alvaro Cardenas, University of Texas at Dallas.
- 14 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test
- Vol. 34 (4) , 26-33
Comparative Study of Authenticated Encryption Targeting Lightweight IoT Applications
This article focuses on detecting attacks to power system with the help of cyber-physical co-modeling. The foundational algorithm used to detect attacks is a new dynamic state estimator that can provide real-tie models of the system improving over legacy state estimators and three-phase linear state estimators. This new system can help operators of the power grid detect when device settings have been tampered, and help identified the context of a command (i.e., under which conditions of the system are specific commands allowed). -Alvaro Cardenas, University of Texas at Dallas.