2018 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE) 2018
DOI: 10.23919/date.2018.8341985
|View full text |Cite
|
Sign up to set email alerts
|

TimingCamouflage: Improving circuit security against counterfeiting by unconventional timing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 41 publications
(21 citation statements)
references
References 22 publications
0
21
0
Order By: Relevance
“…The adversary already possesses the first two, but must generate/estimate the others. A gate-level netlist can be effortlessly obtained from the victim's layout through extraction [17]- [19], while the timing constraint can be estimated to a certain degree [20]- [22]. Our novel trojan insertion framework is shown in Fig.…”
Section: Threat Model and Attacker Capabilitiesmentioning
confidence: 99%
“…The adversary already possesses the first two, but must generate/estimate the others. A gate-level netlist can be effortlessly obtained from the victim's layout through extraction [17]- [19], while the timing constraint can be estimated to a certain degree [20]- [22]. Our novel trojan insertion framework is shown in Fig.…”
Section: Threat Model and Attacker Capabilitiesmentioning
confidence: 99%
“…An example of relaxed modeling is seen in TimingSAT [15], an attack methodology for TimingCamouflage [31]. TimingCamouflage substitutes flip-flops with combinational logic delays.…”
Section: Relaxed Modelsmentioning
confidence: 99%
“…For example, some techniques try to exponentially increase the number of iterations (DIPs) required to find the correct key [38,39,57]. Some techniques try to lock the timing of the circuit using either custom-designed cell or flip-flop relocation [13,58], which cannot be modeled by the SAT solver. In some other techniques, since the SAT attack is only applicable to DAG, the combinational cycles are added for obfuscation purposes, which might trap the iterative structure of the SAT attack in an infinite loop, or it leads to an incorrect key [4,5,28,47,48].…”
Section: Hard Sat Instances In Logic Obfuscationmentioning
confidence: 99%