{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:40:48Z","timestamp":1752460848022,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T00:00:00Z","timestamp":1570579200000},"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":[[2019,10,9]]},"DOI":"10.1145\/3359986.3361207","type":"proceedings-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T12:21:06Z","timestamp":1570450866000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Security-driven metrics and models for efficient evaluation of logic encryption schemes"],"prefix":"10.1145","author":[{"given":"Yinghua","family":"Hu","sequence":"first","affiliation":[{"name":"University of Southern California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek V.","family":"Menon","sequence":"additional","affiliation":[{"name":"University of Southern California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Schmidt","sequence":"additional","affiliation":[{"name":"University of Southern California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Monson","sequence":"additional","affiliation":[{"name":"University of Southern California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"French","sequence":"additional","affiliation":[{"name":"University of Southern California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierluigi","family":"Nuzzo","sequence":"additional","affiliation":[{"name":"University of Southern California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,10,9]]},"reference":[{"volume-title":"International Cryptology Conference. Springer, 1--18","author":"Barak B.","key":"e_1_3_2_1_1_1","unstructured":"B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. 2001. On the (Im) possibility of Obfuscating Programs. In International Cryptology Conference. Springer, 1--18."},{"volume-title":"SAIL: Machine Learning Guided Structural Analysis Attack on Hardware Obfuscation. In Asian Hardware Oriented Security and Trust Symposium (AsianHOST). IEEE, 56--61","author":"Chakraborty P.","key":"e_1_3_2_1_2_1","unstructured":"P. Chakraborty, J. Cruz, and S. Bhunia. 2018. SAIL: Machine Learning Guided Structural Analysis Attack on Hardware Obfuscation. In Asian Hardware Oriented Security and Trust Symposium (AsianHOST). IEEE, 56--61."},{"volume-title":"On Best-Possible Obfuscation. In Theory of Cryptography Conference. Springer, 194--213","author":"Goldwasser S.","key":"e_1_3_2_1_3_1","unstructured":"S. Goldwasser and G. N. Rothblum. 2007. On Best-Possible Obfuscation. In Theory of Cryptography Conference. Springer, 194--213."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Y. Hu V. V. Menon A. Schmidt J. Monson M. French and P. Nuzzo. 2019. Toward Efficient Evaluation of Logic Encryption Schemes: Models and Metrics. (2019). https:\/\/descyphy.usc.edu\/technical-reports\/ Accessed: 2019-09-15.","DOI":"10.1145\/3359986.3361207"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"B. Korte and J. Vygen. 2012. Combinatorial Optimization. Vol. 2. Springer.","DOI":"10.1007\/978-3-642-24488-9"},{"volume-title":"System-Level Framework for Logic Obfuscation with Quantified Metrics for Evaluation. In Secure Development Conference (SecDev). IEEE.","author":"Menon V. V.","key":"e_1_3_2_1_6_1","unstructured":"V. V. Menon, G. Kolhe, A. Schmidt, J. Monson, M. French, Y. Hu, P. A. Beerel, and P. Nuzzo. 2019. System-Level Framework for Logic Obfuscation with Quantified Metrics for Evaluation. In Secure Development Conference (SecDev). IEEE."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.193"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.284"},{"volume-title":"International Symposium on Hardware Oriented Security and Trust (HOST). IEEE, 95--100","author":"Shamsi K.","key":"e_1_3_2_1_9_1","unstructured":"K. Shamsi, M. Li, T. Meade, Z. Zhao, D. Z. Pan, and Y. Jin. 2017. AppSAT: Approximately deobfuscating integrated circuits. In International Symposium on Hardware Oriented Security and Trust (HOST). IEEE, 95--100."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2850319"},{"volume-title":"On the Impossibility of Approximation-Resilient Circuit Locking. In Int. Symp. Hardware Oriented Security and Trust (HOST). IEEE, 161--170","author":"Shamsi K.","key":"e_1_3_2_1_11_1","unstructured":"K. Shamsi, D. Z. Pan, and Y. Jin. 2019. On the Impossibility of Approximation-Resilient Circuit Locking. In Int. Symp. Hardware Oriented Security and Trust (HOST). IEEE, 161--170."},{"volume-title":"Double DIP: Re-Evaluating Security of Logic Encryption Algorithms. In ACM Proc. Great Lakes Symp. VLSI. 179--184","author":"Shen Y.","key":"e_1_3_2_1_12_1","unstructured":"Y. Shen and H. Zhou. 2017. Double DIP: Re-Evaluating Security of Logic Encryption Algorithms. In ACM Proc. Great Lakes Symp. VLSI. 179--184."},{"volume-title":"Evaluating the Security of Logic Encryption Algorithms. In Int. Symp. Hardware Oriented Security and Trust (HOST). 137--143","author":"Subramanyan P.","key":"e_1_3_2_1_13_1","unstructured":"P. Subramanyan, S. Ray, and S. Malik. 2015. Evaluating the Security of Logic Encryption Algorithms. In Int. Symp. Hardware Oriented Security and Trust (HOST). 137--143."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2010.7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808710"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2801220"},{"volume-title":"SARLock: SAT Attack Resistant Logic Locking. In IEEE Int. Symp. Hardware Oriented Security and Trust (HOST). 236--241","author":"Yasin M.","key":"e_1_3_2_1_17_1","unstructured":"M. Yasin, B. Mazumdar, J. Rajendran, and O. Sinanoglu. 2016. SARLock: SAT Attack Resistant Logic Locking. In IEEE Int. Symp. Hardware Oriented Security and Trust (HOST). 236--241."},{"volume-title":"TTLock: Tenacious and Traceless Logic Locking. In IEEE Int. Symp. Hardware Oriented Security and Trust (HOST). 166--166","author":"Yasin M.","key":"e_1_3_2_1_18_1","unstructured":"M. Yasin, B. Mazumdar, J. Rajendran, and O. Sinanoglu. 2017. TTLock: Tenacious and Traceless Logic Locking. In IEEE Int. Symp. Hardware Oriented Security and Trust (HOST). 166--166."},{"key":"e_1_3_2_1_19_1","volume-title":"ACM Proc. SIGSAC Conf. Computer and Communications Security","author":"Yasin M.","year":"2017","unstructured":"M. Yasin, A. Sengupta, M. T. Nabeel, M. Ashraf, J. Rajendran, and O. Sinanoglu. 2017. Provably-Secure Logic Locking: From Theory to Practice. ACM Proc. SIGSAC Conf. Computer and Communications Security (2017)."},{"key":"e_1_3_2_1_20_1","first-page":"696","article-title":"A Humble Theory and Application for Logic Encryption","volume":"2017","author":"Zhou H.","year":"2017","unstructured":"H. Zhou. 2017. A Humble Theory and Application for Logic Encryption. IACR Cryptology ePrint Archive 2017 (2017), 696.","journal-title":"IACR Cryptology ePrint Archive"}],"event":{"name":"MEMOCODE '19: 17th ACM-IEEE International Conference on Formal Methods and Models for System Design","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems","SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA"],"location":"La Jolla California","acronym":"MEMOCODE '19"},"container-title":["Proceedings of the 17th ACM-IEEE International Conference on Formal Methods and Models for System Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359986.3361207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3359986.3361207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:27Z","timestamp":1750202007000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359986.3361207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,9]]},"references-count":20,"alternative-id":["10.1145\/3359986.3361207","10.1145\/3359986"],"URL":"https:\/\/doi.org\/10.1145\/3359986.3361207","relation":{},"subject":[],"published":{"date-parts":[[2019,10,9]]},"assertion":[{"value":"2019-10-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}