{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T03:41:38Z","timestamp":1767843698784,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T00:00:00Z","timestamp":1604275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,2]]},"DOI":"10.1145\/3400302.3415667","type":"proceedings-article","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T01:19:19Z","timestamp":1608254359000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["InterLock"],"prefix":"10.1145","author":[{"given":"Hadi Mardani","family":"Kamali","sequence":"first","affiliation":[{"name":"George Mason University"}]},{"given":"Kimia Zamiri","family":"Azar","sequence":"additional","affiliation":[{"name":"George Mason University"}]},{"given":"Houman","family":"Homayoun","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Avesta","family":"Sasan","sequence":"additional","affiliation":[{"name":"George Mason University"}]}],"member":"320","published-online":{"date-parts":[[2020,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"A. Biere. 2004. Resolve and Expand. In Int'l Conference on Theory and Applications of Satisfiability Testing. 59--70.  A. Biere. 2004. Resolve and Expand. In Int'l Conference on Theory and Applications of Satisfiability Testing. 59--70.","DOI":"10.1007\/11527695_5"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_22"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"A. Chakraborty etal 2018. TimingSAT: timing profile embedded SAT attack. In ICCAD. 1--6.  A. Chakraborty et al. 2018. TimingSAT: timing profile embedded SAT attack. In ICCAD. 1--6.","DOI":"10.1145\/3240765.3240857"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"A. Rezaei etal 2018. Cyclic Locking and Memristor-based Obfuscation against CycSAT and Foundry Attacks. In DATE. 85--90.  A. Rezaei et al. 2018. Cyclic Locking and Memristor-based Obfuscation against CycSAT and Foundry Attacks. In DATE. 85--90.","DOI":"10.23919\/DATE.2018.8341984"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"A. Rezaei etal 2019. CycSAT-unresolvable cyclic logic encryption using unreachable states. In ASP-DAC. 358--363.  A. Rezaei et al. 2019. CycSAT-unresolvable cyclic logic encryption using unreachable states. In ASP-DAC. 358--363.","DOI":"10.1145\/3287624.3287691"},{"key":"e_1_3_2_1_6_1","volume-title":"Trends in the Global IC Design Service Market. DIGITIMES research","author":"Yeh A.","year":"2012","unstructured":"A. Yeh . 2012. Trends in the Global IC Design Service Market. DIGITIMES research ( 2012 ). A. Yeh. 2012. Trends in the Global IC Design Service Market. DIGITIMES research (2012)."},{"key":"e_1_3_2_1_7_1","unstructured":"Actel Corporation. 2002. Design Security in Nonvolatile Flash and Antifuse FPGAs. 16 pages. http:\/\/www.actel.com\/documents\/DesignSecurity_WP.pdf  Actel Corporation. 2002. Design Security in Nonvolatile Flash and Antifuse FPGAs. 16 pages. http:\/\/www.actel.com\/documents\/DesignSecurity_WP.pdf"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.842808"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190075"},{"key":"e_1_3_2_1_10_1","first-page":"459","article-title":"Hard and Easy Distributions of SAT Problems","volume":"92","author":"Mitchell D.","year":"1992","unstructured":"D. Mitchell 1992 . Hard and Easy Distributions of SAT Problems . In AAAI , Vol. 92. 459 -- 465 . D. Mitchell et al. 1992. Hard and Easy Distributions of SAT Problems. In AAAI, Vol. 92. 459--465.","journal-title":"AAAI"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"D. Sirone and P. Subramanayan. 2020. Functional analysis attacks on logic locking. IEEE TIFS (2020).  D. Sirone and P. Subramanayan. 2020. Functional analysis attacks on logic locking. IEEE TIFS (2020).","DOI":"10.23919\/DATE.2019.8715163"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/NANOARCH.2017.8053723"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-007-0141-y"},{"key":"e_1_3_2_1_14_1","volume-title":"Solving Difficult SAT Instances in the Presence of Symmetry. In Design Automation Conference (DAC). 731--736","author":"Aloul F.","year":"2002","unstructured":"F. Aloul 2002 . Solving Difficult SAT Instances in the Presence of Symmetry. In Design Automation Conference (DAC). 731--736 . F. Aloul et al. 2002. Solving Difficult SAT Instances in the Presence of Symmetry. In Design Automation Conference (DAC). 731--736."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8341985"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"H. M. Kamali etal 2019. Full-Lock: Hard Distributions of SAT Instances for Obfuscating Circuits using Fully Configurable Logic and Routing Blocks. In DAC.  H. M. Kamali et al. 2019. Full-Lock: Hard Distributions of SAT Instances for Obfuscating Circuits using Fully Configurable Logic and Routing Blocks. In DAC.","DOI":"10.1145\/3316781.3317831"},{"key":"e_1_3_2_1_18_1","volume-title":"On Designing Secure and Robust Scan Chain for Protecting Obfuscated Logic. In Great Lakes Symposium on VLSI (GLSVLSI). 1--6.","author":"Kamali H. M.","unstructured":"H. M. Kamali , K. Z. Azar , H. Homayoun , and A. Sasan . 2020 . On Designing Secure and Robust Scan Chain for Protecting Obfuscated Logic. In Great Lakes Symposium on VLSI (GLSVLSI). 1--6. H. M. Kamali, K. Z. Azar, H. Homayoun, and A. Sasan. 2020. On Designing Secure and Robust Scan Chain for Protecting Obfuscated Logic. In Great Lakes Symposium on VLSI (GLSVLSI). 1--6."},{"key":"e_1_3_2_1_19_1","volume-title":"Connectivity and Routing Augmentation Model for Building Logic Encryption. In IEEE Computer Society Annual Symposium on VLSI (ISVLSI). 153--159","author":"Kamali H. M.","unstructured":"H. M. Kamali , K. Z. Azar , H. Homayoun , and A. Sasan . 2020. SCRAMBLE: The State , Connectivity and Routing Augmentation Model for Building Logic Encryption. In IEEE Computer Society Annual Symposium on VLSI (ISVLSI). 153--159 . H. M. Kamali, K. Z. Azar, H. Homayoun, and A. Sasan. 2020. SCRAMBLE: The State, Connectivity and Routing Augmentation Model for Building Logic Encryption. In IEEE Computer Society Annual Symposium on VLSI (ISVLSI). 153--159."},{"key":"e_1_3_2_1_20_1","volume-title":"LUT-lock: A Novel LUT-based Logic Obfuscation for FPGA-bitstream and ASIC-hardware Protection. In IEEE Computer Society Annual Symposium on VLSI (ISVLSI). 405--410","author":"Kamali H. M.","unstructured":"H. M. Kamali , K. Z. Azar , K. Gaj , H. Homayoun , and A. Sasan . 2018 . LUT-lock: A Novel LUT-based Logic Obfuscation for FPGA-bitstream and ASIC-hardware Protection. In IEEE Computer Society Annual Symposium on VLSI (ISVLSI). 405--410 . H. M. Kamali, K. Z. Azar, K. Gaj, H. Homayoun, and A. Sasan. 2018. LUT-lock: A Novel LUT-based Logic Obfuscation for FPGA-bitstream and ASIC-hardware Protection. In IEEE Computer Society Annual Symposium on VLSI (ISVLSI). 405--410."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"H. Zhou etal 2017. CycSAT: SAT-based Attack on Cyclic Logic Encryptions. In ICCAD. 49--56.  H. Zhou et al. 2017. CycSAT: SAT-based Attack on Cyclic Logic Encryptions. In ICCAD. 49--56.","DOI":"10.1109\/ICCAD.2017.8203759"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2617593"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Principles and Practice of Constraint Programming. 483--497","author":"J.","unstructured":"J. Marques-Silva et al. 2007. Towards robust CNF encodings of cardinality constraints . In International Conference on Principles and Practice of Constraint Programming. 483--497 . J. Marques-Silva et al. 2007. Towards robust CNF encodings of cardinality constraints. In International Conference on Principles and Practice of Constraint Programming. 483--497."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228377"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.193"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.284"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2014.2333675"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"K. Shamsi etal 2017. AppSAT: Approximately Deobfuscating Integrated Circuits. In HOST. 95--100.  K. Shamsi et al. 2017. AppSAT: Approximately Deobfuscating Integrated Circuits. In HOST. 95--100.","DOI":"10.1109\/HST.2017.7951805"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"K. Shamsi etal 2017. Cyclic Obfuscation for Creating SAT-Unresolvable Circuits. In GLSVLSI. 173--178.  K. Shamsi et al. 2017. Cyclic Obfuscation for Creating SAT-Unresolvable Circuits. In GLSVLSI. 173--178.","DOI":"10.1145\/3060403.3060458"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"K. Shamsi etal 2019. IcySAT: Improved SAT-based Attacks on Cyclic Locked Circuits. In ICCAD. 1--7.  K. Shamsi et al. 2019. IcySAT: Improved SAT-based Attacks on Cyclic Locked Circuits. In ICCAD. 1--7.","DOI":"10.1109\/ICCAD45719.2019.8942049"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"K. Shamsi etal 2019. KC2: Key-condition Crunching for Fast Sequential Circuit Deobfuscation. In DATE. 534--539.  K. Shamsi et al. 2019. KC2: Key-condition Crunching for Fast Sequential Circuit Deobfuscation. In DATE. 534--539.","DOI":"10.23919\/DATE.2019.8715053"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3194554.3194580"},{"key":"e_1_3_2_1_33_1","volume-title":"COMA: Communication and Obfuscation Management Architecture. In International Symposium on Research in Attacks, Intrusions and Defenses (RAID). 181--195","author":"Azar K. Z.","year":"2019","unstructured":"K. Z. Azar 2019 . COMA: Communication and Obfuscation Management Architecture. In International Symposium on Research in Attacks, Intrusions and Defenses (RAID). 181--195 . K. Z. Azar et al. 2019. COMA: Communication and Obfuscation Management Architecture. In International Symposium on Research in Attacks, Intrusions and Defenses (RAID). 181--195."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"K. Z. Azar etal 2019. SMT Attack: Next Generation Attack on Obfuscated Circuits with Capabilities and Performance Beyond the SAT Attacks. CHES (2019) 97--122.  K. Z. Azar et al. 2019. SMT Attack: Next Generation Attack on Obfuscated Circuits with Capabilities and Performance Beyond the SAT Attacks. CHES (2019) 97--122.","DOI":"10.46586\/tches.v2019.i1.97-122"},{"key":"e_1_3_2_1_35_1","volume-title":"IEEE\/ACM International Conference on Computer-Aided Design (ICCAD). 1--9.","author":"Azar K. Z.","year":"2020","unstructured":"K. Z. Azar , H. M. Kamali , H. Homayoun , A. Sasan . 2020 . NNgSAT: Neural Network guided SAT Attackon Logic Locked Complex Structures . In IEEE\/ACM International Conference on Computer-Aided Design (ICCAD). 1--9. K. Z. Azar, H. M. Kamali, H. Homayoun, A. Sasan. 2020. NNgSAT: Neural Network guided SAT Attackon Logic Locked Complex Structures. In IEEE\/ACM International Conference on Computer-Aided Design (ICCAD). 1--9."},{"key":"e_1_3_2_1_36_1","volume-title":"Great Lakes Symposium on VLSI (GLSVLSI). 471--476","author":"Azar K. Z.","unstructured":"K. Z. Azar , H. M. Kamali , H. Homayoun , and A. Sasan . 2019. Threats on logic locking: A decade later . In Great Lakes Symposium on VLSI (GLSVLSI). 471--476 . K. Z. Azar, H. M. Kamali, H. Homayoun, and A. Sasan. 2019. Threats on logic locking: A decade later. In Great Lakes Symposium on VLSI (GLSVLSI). 471--476."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"L. Alrahis etal 2019. ScanSAT: Unlocking Obfuscated Scan Chains. In ASP-DAC. 352--357.  L. Alrahis et al. 2019. ScanSAT: Unlocking Obfuscated Scan Chains. In ASP-DAC. 352--357.","DOI":"10.1145\/3287624.3287693"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299874.3318001"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"e_1_3_2_1_40_1","volume-title":"IC Decamouflaging: Reverse Engineering Camouflaged ICs within Minutes. In Network and Distributed System Security Symposium (NDSS). 1--14","author":"El M.","unstructured":"M. El Massad et al. 2015 . IC Decamouflaging: Reverse Engineering Camouflaged ICs within Minutes. In Network and Distributed System Security Symposium (NDSS). 1--14 . M. El Massad et al. 2015. IC Decamouflaging: Reverse Engineering Camouflaged ICs within Minutes. In Network and Distributed System Security Symposium (NDSS). 1--14."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"M. El Massad etal 2017. Reverse Engineering Camouflaged Sequential Circuits without Scan Access. In ICCAD. 33--40.  M. El Massad et al. 2017. Reverse Engineering Camouflaged Sequential Circuits without Scan Access. In ICCAD. 33--40.","DOI":"10.1109\/ICCAD.2017.8203757"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_50"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190091"},{"key":"e_1_3_2_1_44_1","first-page":"1283","article-title":"A Primer on Hardware Security","volume":"102","author":"Rostami M.","year":"2014","unstructured":"M. Rostami , F. Koushanfar , and R. Karri . 2014 . A Primer on Hardware Security : Models, Methods, and Metrics. Proc. IEEE 102 , 8 (2014), 1283 -- 1295 . M. Rostami, F. Koushanfar, and R. Karri. 2014. A Primer on Hardware Security: Models, Methods, and Metrics. Proc. IEEE 102, 8 (2014), 1283--1295.","journal-title":"Models, Methods, and Metrics. Proc. IEEE"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"M. Velev etal 2008. Comparison of Boolean Satisfiability Encodings on FPGA detailed Routing Problems. In Design Automation and Test in Europe. 1268--1273.  M. Velev et al. 2008. Comparison of Boolean Satisfiability Encodings on FPGA detailed Routing Problems. In Design Automation and Test in Europe. 1268--1273.","DOI":"10.1109\/DATE.2008.4484853"},{"key":"e_1_3_2_1_46_1","volume-title":"Eighth Symposium on Abstraction, Reformulation, and Approximation.","author":"Velev M.","year":"2009","unstructured":"M. Velev 2009 . Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles . In Eighth Symposium on Abstraction, Reformulation, and Approximation. M. Velev et al. 2009. Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles. In Eighth Symposium on Abstraction, Reformulation, and Approximation."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"M. Yasin etal 2016. SARLock: SAT Attack Resistant Logic Locking. In HOST. 236--241.  M. Yasin et al. 2016. SARLock: SAT Attack Resistant Logic Locking. In HOST. 236--241.","DOI":"10.1109\/HST.2016.7495588"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"M. Yasin etal 2017. Provably-Secure Logic Locking: From Theory to Practice. In ACM CCS. 1601--1618.  M. Yasin et al. 2017. Provably-Secure Logic Locking: From Theory to Practice. In ACM CCS. 1601--1618.","DOI":"10.1145\/3133956.3133985"},{"key":"e_1_3_2_1_49_1","unstructured":"M. Yasin etal 2017. Removal Attacks on Logic Locking and Camouflaging Techniques. IEEE TETC (2017).  M. Yasin et al. 2017. Removal Attacks on Logic Locking and Camouflaging Techniques. IEEE TETC (2017)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"M. Yasin etal 2017. Security Analysis of Anti-SAT. In ASP-DAC. 342--347.  M. Yasin et al. 2017. Security Analysis of Anti-SAT. In ASP-DAC. 342--347.","DOI":"10.1109\/ASPDAC.2017.7858346"},{"key":"e_1_3_2_1_51_1","volume-title":"International conference on theory and applications of satisfiability testing. 502--518","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n 2003 . An extensible SAT-solver . In International conference on theory and applications of satisfiability testing. 502--518 . N. E\u00e9n et al. 2003. An extensible SAT-solver. In International conference on theory and applications of satisfiability testing. 502--518."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"N. E\u00e9n etal 2005. Effective preprocessing in SAT through variable and clause elimination. In Int'l conference on theory and applications of satisfiability testing. 61--75.  N. E\u00e9n et al. 2005. Effective preprocessing in SAT through variable and clause elimination. In Int'l conference on theory and applications of satisfiability testing. 61--75.","DOI":"10.1007\/11499107_5"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"N. Limaye etal 2019. Is Robust Design-for-Security Robust Enough? Attack on Locked Circuits with Restricted Scan. In ICCAD. 1--8.  N. Limaye et al. 2019. Is Robust Design-for-Security Robust Enough? Attack on Locked Circuits with Restricted Scan. In ICCAD. 1--8.","DOI":"10.1109\/ICCAD45719.2019.8942047"},{"key":"e_1_3_2_1_54_1","volume-title":"Automated Reencoding of Boolean Formulas. In Haifa Verification Conference. 102--117","author":"Manthey N.","year":"2012","unstructured":"N. Manthey 2012 . Automated Reencoding of Boolean Formulas. In Haifa Verification Conference. 102--117 . N. Manthey et al. 2012. Automated Reencoding of Boolean Formulas. In Haifa Verification Conference. 102--117."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45193-8_8"},{"key":"e_1_3_2_1_56_1","volume-title":"Evaluating the Security of Logic Encryption Algorithms. In International Symposium on Hardware Oriented Security and Trust (HOST). 137--143","author":"Subramanyan P.","year":"2015","unstructured":"P. Subramanyan 2015 . Evaluating the Security of Logic Encryption Algorithms. In International Symposium on Hardware Oriented Security and Trust (HOST). 137--143 . P. Subramanyan et al. 2015. Evaluating the Security of Logic Encryption Algorithms. In International Symposium on Hardware Oriented Security and Trust (HOST). 137--143."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"P. Tuyls etal 2006. Read-Proof Hardware from Protective Coatings. In Int'l Workshop on Cryptographic Hardware and Embedded Systems (CHES). 369--383.  P. Tuyls et al. 2006. Read-Proof Hardware from Protective Coatings. In Int'l Workshop on Cryptographic Hardware and Embedded Systems (CHES). 369--383.","DOI":"10.1007\/11894063_29"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-010-9105-0"},{"key":"e_1_3_2_1_59_1","unstructured":"R. Karmakar etal 2018. Encrypt flip-flop: A novel logic encryption technique for sequential circuits. arXiv 1801.04961 (2018).  R. Karmakar et al. 2018. Encrypt flip-flop: A novel logic encryption technique for sequential circuits. arXiv 1801.04961 (2018)."},{"key":"e_1_3_2_1_60_1","volume-title":"Interconnects: Low-cost and Resilient Full-chip Layout Camouflaging","author":"Patnaik S.","year":"2020","unstructured":"S. Patnaik 2020 . Obfuscating the Interconnects: Low-cost and Resilient Full-chip Layout Camouflaging . IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ( 2020). S. Patnaik et al. 2020. Obfuscating the Interconnects: Low-cost and Resilient Full-chip Layout Camouflaging. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2020)."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3194554.3194596"},{"key":"e_1_3_2_1_62_1","unstructured":"S. Roshanisefat etal 2020. SAT-Hard Cyclic Logic Obfuscation for Protecting the IP in the Manufacturing Supply Chain. IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2020) 1--14.  S. Roshanisefat et al. 2020. SAT-Hard Cyclic Logic Obfuscation for Protecting the IP in the Manufacturing Supply Chain. IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2020) 1--14."},{"key":"e_1_3_2_1_63_1","volume-title":"VLSI Test Symposium (VTS). 1--6.","author":"Roshanisefat S.","unstructured":"S. Roshanisefat , H. M. Kamali , K. Z. Azar , S. M. P. Dinakarrao , N. Karimi , H. Homayoun , and A. Sasan . 2020. DFSSD: Deep Faults and Shallow State Duality, A Provably Strong Obfuscation Solution for Circuits with Restricted Access to Scan Chain . In VLSI Test Symposium (VTS). 1--6. S. Roshanisefat, H. M. Kamali, K. Z. Azar, S. M. P. Dinakarrao, N. Karimi, H. Homayoun, and A. Sasan. 2020. DFSSD: Deep Faults and Shallow State Duality, A Provably Strong Obfuscation Solution for Circuits with Restricted Access to Scan Chain. In VLSI Test Symposium (VTS). 1--6."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564751_73"},{"key":"e_1_3_2_1_65_1","first-page":"1867","article-title":"Secure Scan and Test using Obfuscation throughout Supply Chain","volume":"37","author":"Wang X.","year":"2017","unstructured":"X. Wang 2017 . Secure Scan and Test using Obfuscation throughout Supply Chain . IEEE TCAD 37 , 9 (2017), 1867 -- 1880 . X. Wang et al. 2017. Secure Scan and Test using Obfuscation throughout Supply Chain. IEEE TCAD 37, 9 (2017), 1867--1880.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"crossref","unstructured":"X. Xu etal 2017. Novel Bypass Attack and BDD-based Trade-off against all Known Logic Locking Attacks. In CHES. 189--210.  X. Xu et al. 2017. Novel Bypass Attack and BDD-based Trade-off against all Known Logic Locking Attacks. In CHES. 189--210.","DOI":"10.1007\/978-3-319-66787-4_10"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060469"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Y. Shen etal 2019. BeSAT: behavioral SAT-based attack on cyclic logic encryption. In ASP-DAC. 657--662.  Y. Shen et al. 2019. BeSAT: behavioral SAT-based attack on cyclic logic encryption. In ASP-DAC. 657--662.","DOI":"10.1145\/3287624.3287670"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Y. Xie and A. Srivastava. 2016. Mitigating SAT Attack on Logic Locking. In CHES. 127--146.  Y. Xie and A. Srivastava. 2016. Mitigating SAT Attack on Logic Locking. In CHES. 127--146.","DOI":"10.1007\/978-3-662-53140-2_7"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062226"}],"event":{"name":"ICCAD '20: IEEE\/ACM International Conference on Computer-Aided Design","location":"Virtual Event USA","acronym":"ICCAD '20","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA","IEEE CS"]},"container-title":["Proceedings of the 39th International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400302.3415667","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3400302.3415667","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:52Z","timestamp":1750197772000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400302.3415667"}},"subtitle":["an intercorrelated logic and routing locking"],"short-title":[],"issued":{"date-parts":[[2020,11,2]]},"references-count":70,"alternative-id":["10.1145\/3400302.3415667","10.1145\/3400302"],"URL":"https:\/\/doi.org\/10.1145\/3400302.3415667","relation":{},"subject":[],"published":{"date-parts":[[2020,11,2]]},"assertion":[{"value":"2020-12-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}