Name
Abstract | ||
|---|---|---|
One technique to prevent attacks from an untrusted foundry is split manufacturing, where only a part of the layout is sent to the untrusted high-end foundry, and the rest is manufactured at a trusted low-end foundry. The untrusted foundry has front-end-of-line (FEOL) layout and the original circuit netlist and attempts to identify critical components on the layout for Trojan insertion. Although defense methods for this scenario have been developed, the corresponding attack technique is not well explored. For instance, Boolean satisfiability (SAT) based bijective mapping attack is mentioned without detailed research. Hence, the defense methods are mostly evaluated with the k-security metric without actual attacks. We provide the first systematic study, to the best of our knowledge, on attack techniques in this scenario. Besides of implementing SAT-based bijective mapping attack, we develop a new attack technique based on structural pattern matching. Experimental comparison with bijective mapping attack shows that the new attack technique achieves about the same success rate with much faster speed for cases without the k-security defense, and has a much better success rate at the same runtime for cases with k-security defense. The results offer an alternative and practical interpretation for k-security in split manufacturing.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3287624.3287698 | ASP-DAC |
Keywords | Field | DocType |
hardware security, layout recognition attack, split manufacturing | Netlist,Hardware security module,Bijection,Computer science,Boolean satisfiability problem,Real-time computing,Trojan,Computer engineering,Pattern matching | Conference |
Citations | PageRank | References |
3 | 0.38 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenbin Xu | 1 | 23 | 7.96 |
| Lang Feng | 2 | 3 | 0.38 |
| Jeyavijayan Rajendran | 3 | 1121 | 63.69 |
| Jiang Hu | 4 | 668 | 65.67 |