2017
DOI: 10.1007/978-3-319-66787-4_10
|View full text |Cite
|
Sign up to set email alerts
|

Novel Bypass Attack and BDD-based Tradeoff Analysis Against All Known Logic Locking Attacks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
62
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 123 publications
(62 citation statements)
references
References 14 publications
0
62
0
Order By: Relevance
“…Comparison with functional obfuscation: Xu et al [22] proposed binary decision diagram (BDD)-based obfuscation which operates at the functional level, in contrast to other approaches working at the netlist level. It was shown that their scheme can be tailored to remain resilient against SATbased attacks as well "removal attacks" [22], [23]. As above, we evaluate two approaches of [22] at layout level, namely random obfuscation and Anti-SAT-inspired obfuscation [59].…”
Section: Table VII Area (A) Power (P) and Delay (D) For Full-chip Cmentioning
confidence: 99%
“…Comparison with functional obfuscation: Xu et al [22] proposed binary decision diagram (BDD)-based obfuscation which operates at the functional level, in contrast to other approaches working at the netlist level. It was shown that their scheme can be tailored to remain resilient against SATbased attacks as well "removal attacks" [22], [23]. As above, we evaluate two approaches of [22] at layout level, namely random obfuscation and Anti-SAT-inspired obfuscation [59].…”
Section: Table VII Area (A) Power (P) and Delay (D) For Full-chip Cmentioning
confidence: 99%
“…These works seek to impose exponential computation complexity for the SAT solver. Still, most of these techniques are vulnerable to some degree when subject to tailored attacks such as [53]- [55]. Besides, we note that prior art on SAT attacks tender exclusively to deterministic computing and circuits.…”
Section: Hardware Securitymentioning
confidence: 99%
“…involves the expression of combinational logic in the form of BDDs and embedding of the locking mechanism at the BDD level [26,45]. BDDs are canonical expressions for Boolean logic, represented in the form of a directed acyclic graph (DAG) with arcs, nodes, and leaves.…”
Section: -Binary Decision Diagram (Bdd): Another Techniquementioning
confidence: 99%
“…Many attacks have been proposed to break combinational obfuscation and retrieve the key [22,38,41,45,48]. Secure obfuscation techniques should ideally force the attacker to brute force the key.…”
Section: Attacksmentioning
confidence: 99%