Randomization Based Probabilistic Approach to Detect Trojan Circuits

被引:70
作者
Jha, Susmit [1 ]
Jha, Sumit Kumar [2 ]
机构
[1] Univ Calif Berkeley, EECS, Berkeley, CA 94720 USA
[2] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA USA
来源
11TH IEEE HIGH ASSURANCE SYSTEMS ENGINEERING SYMPOSIUM, PROCEEDINGS | 2008年
关键词
D O I
10.1109/HASE.2008.37
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a randomization based technique to verify whether a manufactured chip conforms to its design or is infected by any trojan circuit. A trojan circuit can be inserted into the design or fabrication mask by a malicious manufacturer such that it monitors for a specific rare trigger condition, and then it produces a payload error in the circuit which alters the functionality of the circuit often causing a catastrophic crash of the system where the chip was being used. Since trojans are activated by rare input patterns, they are stealthy by nature and are difficult to detect through conventional techniques of functional testing. In this paper, we propose a novel randomized approach to probabilistically compare the functionality of the implemented circuit with the design of the circuit. Using hypothesis testing, we provide quantitative guarantees when our algorithm reports that there is no trojan in the implemented circuit. This allows us to trade runtime for accuracy. The technique is sound, that is, it reports presence of a trojan only if the implemented circuit is actually infected. If our algorithm finds that the implemented circuit is infected with a trojan, it also reports a fingerprint input pattern to distinguish the implemented circuit from the design. We illustrate the effectiveness of our technique on a set of infected and benign combinational circuits.
引用
收藏
页码:117 / +
页数:2
相关论文
共 15 条
  • [1] The hunt for the kill switch
    Adee, Sally
    [J]. IEEE SPECTRUM, 2008, 45 (05) : 34 - 39
  • [2] Trojan detection using IC fingerprinting
    Agrawal, Dakshi
    Baktir, Selcuk
    Karakoyunlu, Deniz
    Rohatgi, Pankaj
    Sunar, Berk
    [J]. 2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2007, : 296 - +
  • [3] AGRAWAL VD, 1996, VLSID 96, P341
  • [4] ASHAR P, 1991, COMP DES VLSI COMP P, P259
  • [5] BANGA M, 2008, ACM GREAT LAK S VLSI, P363
  • [6] EQUIVALENCE OF FREE BOOLEAN GRAPHS CAN BE DECIDED PROBABILISTICALLY IN POLYNOMIAL-TIME
    BLUM, M
    CHANDRA, AK
    WEGMAN, MN
    [J]. INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 80 - 82
  • [7] Cheng WK, 2006, TEST C 2006 ITC 06 I, P1
  • [8] Bounded model checking using satisfiability solving
    Clarke, E
    Biere, A
    Raimi, R
    Zhu, Y
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 2001, 19 (01) : 7 - 34
  • [9] FAGOT C, 1999, TEST WORKSH 1999 P E, P7
  • [10] Using SAT for combinational equivalence checking
    Goldberg, EI
    Prasad, MR
    Brayton, RK
    [J]. DESIGN, AUTOMATION AND TEST IN EUROPE, CONFERENCE AND EXHIBITION 2001, PROCEEDINGS, 2001, : 114 - 121