乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:44:57Z","timestamp":1730321097862,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T00:00:00Z","timestamp":1559433600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,2]]},"DOI":"10.1145\/3316781.3317831","type":"proceedings-article","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:07:13Z","timestamp":1558634833000},"page":"1-6","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["Full-Lock"],"prefix":"10.1145","author":[{"given":"Hadi Mardani","family":"Kamali","sequence":"first","affiliation":[{"name":"George Mason University, Farifax, VA, USA"}]},{"given":"Kimia Zamiri","family":"Azar","sequence":"additional","affiliation":[{"name":"George Mason University, Farifax, VA, USA"}]},{"given":"Houman","family":"Homayoun","sequence":"additional","affiliation":[{"name":"George Mason University, Farifax, VA, USA"}]},{"given":"Avesta","family":"Sasan","sequence":"additional","affiliation":[{"name":"George Mason University, Farifax, VA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"331","article-title":"Where the really hard problems are","volume":"91","author":"Cheeseman P. C.","year":"1991","unstructured":"P. C. Cheeseman , B. Kanefsky , and W. M. Taylor . 1991 . Where the really hard problems are .. In IJCAI , Vol. 91. 331 -- 340 . P. C. Cheeseman, B. Kanefsky, and W. M. Taylor. 1991. Where the really hard problems are.. In IJCAI, Vol. 91. 331--340.","journal-title":"IJCAI"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/513918.514102"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1"},{"volume-title":"LUT-Lock: A Novel LUT-Based Logic Obfuscation for FPGA-Bitstream and ASIC-Hardware Protection. In 2018 IEEE Computer Society Annual Symp. on VLSI (ISVLSI). 405--410","year":"2018","author":"Kamali H. M.","key":"e_1_3_2_1_4_1","unstructured":"H. M. Kamali 2018 . LUT-Lock: A Novel LUT-Based Logic Obfuscation for FPGA-Bitstream and ASIC-Hardware Protection. In 2018 IEEE Computer Society Annual Symp. on VLSI (ISVLSI). 405--410 . H. M. Kamali et al. 2018. LUT-Lock: A Novel LUT-Based Logic Obfuscation for FPGA-Bitstream and ASIC-Hardware Protection. In 2018 IEEE Computer Society Annual Symp. on VLSI (ISVLSI). 405--410."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3199700.3199707"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"K. Shamsi etal 2017. AppSAT: Approximately deobfuscating integrated circuits. In Hardware Oriented Security and Trust (HOST) IEEE Int'l Symp. on. 95--100. K. Shamsi et al. 2017. AppSAT: Approximately deobfuscating integrated circuits. In Hardware Oriented Security and Trust (HOST) IEEE Int'l Symp. on. 95--100.","DOI":"10.1109\/HST.2017.7951805"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3194554.3194580"},{"key":"e_1_3_2_1_8_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. IACR Trans. on Cryptographic Hardware and Embedded Sys.s (TCHES) 2019 1 (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. IACR Trans. on Cryptographic Hardware and Embedded Sys.s (TCHES) 2019 1 (2019) 97--122.","DOI":"10.46586\/tches.v2019.i1.97-122"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299874.3319495"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_24"},{"volume-title":"Sarlock: Sat attack resistant logic locking. In Hardware Oriented Security and Trust (HOST)","year":"2016","author":"Yasin M.","key":"e_1_3_2_1_11_1","unstructured":"M. Yasin 2016 . Sarlock: Sat attack resistant logic locking. In Hardware Oriented Security and Trust (HOST) , IEEE Int'l Symp . on. 236--241. M. Yasin et al. 2016. Sarlock: Sat attack resistant logic locking. In Hardware Oriented Security and Trust (HOST), IEEE Int'l Symp. on. 236--241."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2017.2740364"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2017.7858346"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"P. Subramanyan etal 2015. Evaluating the security of logic encryption algorithms. In IEEE Int'l Symp. on Hardware Oriented Security and Trust (HOST). IEEE 137--143. P. Subramanyan et al. 2015. Evaluating the security of logic encryption algorithms. In IEEE Int'l Symp. on Hardware Oriented Security and Trust (HOST). IEEE 137--143.","DOI":"10.1109\/HST.2015.7140252"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"S. Roshanisefat etal 2018. Benchmarking the capabilities and limitations of SAT solvers in defeating obfuscation schemes. In IEEE Int'l Symp. on On-Line Testing And Robust System Design (IOLTS). 275--280. S. Roshanisefat et al. 2018. Benchmarking the capabilities and limitations of SAT solvers in defeating obfuscation schemes. In IEEE Int'l Symp. on On-Line Testing And Robust System Design (IOLTS). 275--280.","DOI":"10.1109\/IOLTS.2018.8474189"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3194554.3194596"},{"key":"e_1_3_2_1_17_1","first-page":"459","article-title":"Hard and easy distributions of SAT problems","volume":"92","author":"Mitchell D.","year":"1992","unstructured":"D. Mitchell , B. Selman , and H. Levesque . 1992 . Hard and easy distributions of SAT problems . In AAAI , Vol. 92. 459 -- 465 . D. Mitchell, B. Selman, and H. Levesque. 1992. Hard and easy distributions of SAT problems. In AAAI, Vol. 92. 459--465.","journal-title":"AAAI"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228377"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.193"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2335155"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.284"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060469"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.103045"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"},{"volume-title":"On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic","year":"1968","author":"Tseitin G.","key":"e_1_3_2_1_25_1","unstructured":"G. Tseitin . 1968. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic ( 1968 ), 115--125. G. Tseitin. 1968. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic (1968), 115--125."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11894063_29"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Y. Xie and A. Srivastava. 2016. Mitigating sat attack on logic locking. In Int'l Conf. on Cryptographic Hardware and Embedded Sys.s (CHES). 127--146. Y. Xie and A. Srivastava. 2016. Mitigating sat attack on logic locking. In Int'l Conf. on Cryptographic Hardware and Embedded Sys.s (CHES). 127--146.","DOI":"10.1007\/978-3-662-53140-2_7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062226"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"X. Xu B. Shakya M. M. Tehranipoor and D. Forte. 2017. Novel bypass attack and BDD-based tradeoff analysis against all known logic locking attacks. In Int'l Conf. on Cryptographic Hardware and Embedded Sys.s (CHES). 189--210. X. Xu B. Shakya M. M. Tehranipoor and D. Forte. 2017. Novel bypass attack and BDD-based tradeoff analysis against all known logic locking attacks. In Int'l Conf. on Cryptographic Hardware and Embedded Sys.s (CHES). 189--210.","DOI":"10.1007\/978-3-319-66787-4_10"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133985"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060492"},{"volume-title":"Trends in the global IC design service market. DIGITIMES research","year":"2012","author":"Yeh A.","key":"e_1_3_2_1_32_1","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)."}],"event":{"name":"DAC '19: The 56th Annual Design Automation Conference 2019","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Las Vegas NV USA","acronym":"DAC '19"},"container-title":["Proceedings of the 56th Annual Design Automation Conference 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3316781.3317831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T03:37:55Z","timestamp":1672976275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3316781.3317831"}},"subtitle":["Hard Distributions of SAT instances for Obfuscating Circuits using Fully Configurable Logic and Routing Blocks"],"short-title":[],"issued":{"date-parts":[[2019,6,2]]},"references-count":32,"alternative-id":["10.1145\/3316781.3317831","10.1145\/3316781"],"URL":"https:\/\/doi.org\/10.1145\/3316781.3317831","relation":{},"subject":[],"published":{"date-parts":[[2019,6,2]]},"assertion":[{"value":"2019-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}