{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:56:42Z","timestamp":1780444602618,"version":"3.54.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-009"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-001"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/csf54842.2022.9919691","type":"proceedings-article","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T21:29:20Z","timestamp":1667510960000},"page":"455-470","source":"Crossref","is-referenced-by-count":2,"title":["Locked Circuit Indistinguishability: A Notion of Security for Logic Locking"],"prefix":"10.1109","author":[{"given":"Mohamed El","family":"Massad","sequence":"first","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nahid","family":"Juma","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Shahen","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siddharth","family":"Garg","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahesh","family":"Tripunitara","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","author":"garey","year":"2011","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref34","first-page":"696","article-title":"A humble theory and application for logic encryption","volume":"2017","author":"zhou","year":"2017","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref12","first-page":"180","year":"2002","journal-title":"Secure Hash Standard"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3335741.3335752"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/14095772X"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2511144"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2015.7140252"},{"key":"ref33","first-page":"351","article-title":"What to lock? functional and parametric locking","author":"yasin","year":"0","journal-title":"Proceedings of the on Great Lakes Symposium on VLSI 2017"},{"key":"ref11","author":"elmassad","year":"2020","journal-title":"Xor-locked one-way functions and indistinguishably-locked circuits"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133985"},{"key":"ref10","first-page":"675","article-title":"Basing obfuscation on simple tamper-proof hardware assumptions","volume":"2011","author":"d\u00f6ttling","year":"2011","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref2","first-page":"689","article-title":"Differing-inputs obfuscation and applications","volume":"2013","author":"ananth","year":"2013","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref1","year":"0","journal-title":"ABC A System for Sequential Synthesis and Verification"},{"key":"ref17","author":"han","year":"0","journal-title":"Does logic locking work with eda tools?"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"ref19","first-page":"1","article-title":"Full-lock: Hard distributions of sat instances for obfuscating circuits using fully configurable logic and routing blocks","author":"mardani kamali","year":"0","journal-title":"Proceedings of the 56th Annual Design Automation Conference 2019"},{"key":"ref18","article-title":"Indistinguishability obfuscation from well-founded assumptions","author":"jain","year":"2020","journal-title":"Cryptology ePrint Archive Report 2020\/1003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403631"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228377"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/VTS.2018.8368625"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.2968898"},{"key":"ref20","first-page":"85","author":"karp","year":"1972","journal-title":"Reducibility Among Combinatorial Problems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34047-5_15"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1201\/b17668"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3194554.3194580"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2017.7951805"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2019.8741035"},{"key":"ref8","first-page":"1","author":"cook","year":"1997","journal-title":"Finding hard instances of the satisfiability problem a survey"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"ref9","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2172\/974399"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"ref5","first-page":"1","article-title":"On the (im) possibility of obfuscating programs","author":"barak","year":"2001","journal-title":"Annual International Cryptology Conference"}],"event":{"name":"2022 IEEE 35th Computer Security Foundations Symposium (CSF)","location":"Haifa, Israel","start":{"date-parts":[[2022,8,7]]},"end":{"date-parts":[[2022,8,10]]}},"container-title":["2022 IEEE 35th Computer Security Foundations Symposium (CSF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9919409\/9919636\/09919691.pdf?arnumber=9919691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T18:05:26Z","timestamp":1699466726000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9919691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/csf54842.2022.9919691","relation":{},"subject":[],"published":{"date-parts":[[2022,8]]}}}