{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T18:49:23Z","timestamp":1784918963225,"version":"3.55.0"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004919","name":"King Abdulaziz City for Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004919","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tifs.2021.3092135","type":"journal-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T20:48:06Z","timestamp":1624913286000},"page":"3724-3739","source":"Crossref","is-referenced-by-count":20,"title":["SARO: Scalable Attack-Resistant Logic Locking"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9285-6732","authenticated-orcid":false,"given":"Abdulrahman","family":"Alaql","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6082-6961","authenticated-orcid":false,"given":"Swarup","family":"Bhunia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"234","article-title":"Complexity of a derivation in the propositional calculus, zap","volume":"8","author":"tseitin","year":"1983","journal-title":"Nauchn Sem Leningrad Otd Mat Inst Akad Nauk SSSR"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"ref33","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3057576"},{"key":"ref31","first-page":"139","article-title":"Vulnerability and remedy of stripped function logic locking","volume":"2019","author":"zhou","year":"2019","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED48828.2020.9137052"},{"key":"ref37","first-page":"459","article-title":"Hard and easy distributions of SAT problems","volume":"92","author":"mitchell","year":"1992","journal-title":"Proc 10th Nat Conf Artif Intell (AAAI)"},{"key":"ref36","first-page":"31","article-title":"Evaluation of SAT like proof techniques for formal verification of word level circuits","author":"s\u00fclflow","year":"2007","journal-title":"Proc IEEE Workshop RTL High Level Test"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382541"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2017.7951805"},{"key":"ref40","year":"2020","journal-title":"SARO Benchmarks"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2017.2740364"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66787-4_10"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2511144"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2404876"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/AsianHOST47458.2019.9006720"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/AsianHOST.2018.8607163"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LATW.2015.7102410"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060458"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.2988629"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2016.7495588"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317831"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53140-2_7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3194554.3194580"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/VTS.2019.8758637"},{"key":"ref29","first-page":"351","article-title":"What to lock? Functional and parametric locking","author":"yasin","year":"2017","journal-title":"Proc GLSVLSI"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133985"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687424"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IOLTS.2014.6873671"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23218"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2015.7140252"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403631"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060469"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203759"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2019.i1.97-122"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2968183"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITC44170.2019.9000130"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2019.8741028"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2904838"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/9151439\/09465802.pdf?arnumber=9465802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:43Z","timestamp":1652194363000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9465802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/tifs.2021.3092135","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}