Sasan Receives Funding For Project Studying Highly Corruptive & Hard To Break Obfuscation
Avesta Sasan, Associate Professor, Electrical and Computer Engineering, received funding from the U.S. Department of Defense for a project in which he is exploring the design space of SAT-hard obfuscation solutions and building solutions that could be proven to be SAT-hard.
A Boolean satisfiability (SAT) attack is an oracle-guided attack that utilizes a SAT solver to compute attack?patterns that refine the key search space iteratively.
Sasan said this research has the potential to: (1) open a new direction for the design of SAT-hard obfuscation solutions; (2) provide provable methods, scripts and techniques to tradeoff power, performance, and area versus security, and (3) introduce new metrics and measures for evaluating the effectiveness of obfuscation solutions.
Funding for this project began in April 2020 and will end in October 2022.