A Neural Network-based SAT-Resilient Obfuscation Towards Enhanced Logic Locking
Rakibul Hassan, Gaurav Kolhe, Setareh Rafatirad, Houman Homayoun, Sai, Manoj Pudukotai Dinakarrao

TL;DR
This paper introduces SATConda, a neural network-based method for logic obfuscation that effectively defends against SAT attacks with minimal overhead, enhancing hardware security without compromising performance.
Contribution
The paper presents SATConda, a novel neural network-driven unSAT clause translator that improves logic obfuscation security with low overhead and effective resistance to SAT-based attacks.
Findings
Successfully defends against multiple state-of-the-art SAT attacks
Achieves minimal area and power overhead compared to existing methods
Performs well on ISCAS benchmark circuits
Abstract
Logic obfuscation is introduced as a pivotal defense against multiple hardware threats on Integrated Circuits (ICs), including reverse engineering (RE) and intellectual property (IP) theft. The effectiveness of logic obfuscation is challenged by the recently introduced Boolean satisfiability (SAT) attack and its variants. A plethora of countermeasures has also been proposed to thwart the SAT attack. Irrespective of the implemented defense against SAT attacks, large power, performance, and area overheads are indispensable. In contrast, we propose a cognitive solution: a neural network-based unSAT clause translator, SATConda, that incurs a minimal area and power overhead while preserving the original functionality with impenetrable security. SATConda is incubated with an unSAT clause generator that translates the existing conjunctive normal form (CNF) through minimal perturbations such as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsBalanced Selection
