Seetal Potluri

Seetal Potluri

Auto-generated profile, based on publicly available information

Seetal Potluri

Electrical and Computer Engineering Department, North Carolina State University, Raleigh, NC, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
17 November 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
PKPriyank Kashyap
Priyank Kashyap
FAFurkan Aydin
Furkan Aydin
SPSeetal Potluri
Seetal Potluri
PFPaul D. Franzon
Paul D. Franzon
AAAydin Aysu
Aydin Aysu
Advancements in quantum computing present a security threat to classical cryptography algorithms. Lattice-based key exchange protocols show strong promise due to their resistance to theoretical quantum-cryptanalysis and low implementation overhead. By contrast, their physical implementations have shown vulnerability against side-channel attacks (SCAs) even with a single power measurement. The state-of-the-art SCAs are, however, limited to simple, sequentialized executions of post-quantum key-exchange (PQKE) protocols, leaving the vulnerability of complex, parallelized architectures unknown. This article proposes 2Deep-a deep-learning (DL)-based SCA-targeting parallelized implementations of PQKE protocols, namely, Frodo and NewHope with data augmentation techniques. Specifically, we explore approaches that convert 1-D time-series power measurement data into 2-D images to formulate SCA an image recognition task. The results show our attack's superiority over conventional techniques including horizontal differential power analysis (DPA), template attacks (TAs), and straightforward DL approaches. We demonstrate improvements up to 1.5× to recover a 100% success rate compared to DL with 1-D input data while using fewer data. We furthermore show that machine learning improves the results up to 1.25× compared to TAs. Furthermore, we perform cross-device attacks that obtain profiles from a single device, which has never been explored. Our 2-D approach is especially favored in this setting, improving the success rate of attacking Frodo from 20% to 99% compared to the 1-D approach. Our work thus urges countermeasures even on parallel architectures and single-trace attacks.

1 November 2021
Verified
Conference Paper
Closed access
SPSeetal Potluri
Seetal Potluri
Aydin AysuAydin Aysu
Aydin Aysu
Stealing trained machine learning (ML) models is a new and growing concern due to the model's development cost. Existing work on ML model extraction either applies a mathematical attack or exploits hardware vulnerabilities such as side-channel leakage. This paper shows a new style of attack, for the first time, on ML models running on embedded devices by abusing the scan-chain infrastructure. We illustrate that having course-grained scan-chain access to non-linear layer outputs is sufficient to steal ML models. To that end, we propose a novel small-signal analysis inspired attack that applies small perturbations into the input signals, identifies the quiescent operating points and, selectively activates certain neurons. We then couple this with a Linear Constraint Satisfaction based approach to efficiently extract model parameters such as weights and biases. We conduct our attack on neural network inference topologies defined in earlier works, and we automate our attack. The results show that our attack outperforms mathematical model extraction proposed in CRYPTO 2020, USENIX 2020, and ICML 2020 by an increase in accuracy of $2^{20.7}\times, 2^{50.7}\times$ , and $2^{33.9}\times$ , respectively, and a reduction in queries by $2^{6.5}\times, 2^{4.6}\times$ , and $2^{14.2}\times$ , respectively.

1 June 2020
Verified
Conference Paper
Closed access
HCHuili Chen
Huili Chen
SPSeetal Potluri
Seetal Potluri
FKFarinaz Koushanfar
Farinaz Koushanfar
We propose FlowTrojan, the first systematic framework for insertion and detection of Hardware Trojans (HTs) on Flow-based Microfluidic Biochips (FMFBs). The FMFB is an emerging platform with critical usages in the medical field due to the handling of sensitive information. We discuss the attack model where the malicious foundry aims to compromise the on-chip control circuitry. FlowTrojan is designed to automatically extract the netlist for the control circuitry from the layout and explore the internal independence between regions on FMFBs for partitioning. We demonstrate that HT triggers can feature a low activation probability while placed on the non-critical timing path to stay clandestine during functional and parametric testing. To avoid such attacks, FlowTrojan provides a parallel regime of control-value (CV) based HT detection as the countermeasure. Experimental results corroborate the effectiveness and scalability of the proposed attack and detection schemes.

16 August 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
SPSeetal Potluri
Seetal Potluri
SKShamik Kundu
Shamik Kundu
Akash KumarAkash Kumar
Akash Kumar
KBKanad Basu
Kanad Basu
Aydin AysuAydin Aysu
Aydin Aysu
Scan-obfuscation is a powerful methodology to protect Silicon-based intellectual property from theft. Prior work on scan-obfuscation in the context of logic-locking have unique limitations, which are addressed by our previous work, SeqL, which looks at functional output corruption to obfuscate scan-chains, but is unable to resist removal attacks on circuits with inadequate number of flip-flops without feedback. To address this issue, we propose to scramble flip-flops with feedback to increase key-length without introducing further vulnerabilities. This study reveals the first formulation and complexity analysis of Boolean Satisfiability (SAT)-based attack on scan-scrambling. We formulate the attack as a conjunctive normal form (CNF) using a worst-case O(n3) reduction in terms of scramble-graph size n. In order to defeat SAT-based attack, we propose an iterative swapping-based scan-cell scrambling algorithm that has O(n) implementation time-complexity and O(2α.n+13) SAT-decryption time-complexity in terms of a user-configurable cost constraint α (0<α≤1).