{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:18:01Z","timestamp":1767183481066,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/ets.2019.8791550","type":"proceedings-article","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T23:48:50Z","timestamp":1565308130000},"page":"1-6","source":"Crossref","is-referenced-by-count":7,"title":["Revisiting Logic Locking for Reversible Computing"],"prefix":"10.1109","author":[{"given":"Nimisha","family":"Limaye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Yasin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ozgur","family":"Sinanoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2335155"},{"key":"ref11","first-page":"849","article-title":"Rule-based Optimization of Reversible Circuits","author":"arabzadeh","year":"2010","journal-title":"ASPDAC"},{"journal-title":"An Online Resource for Reversible Functions and Circuits","year":"0","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775915"},{"key":"ref14","first-page":"85","article-title":"Synthesis of Reversible Circuits with Minimal Lines for Large Functions","author":"soeken","year":"2012","journal-title":"ASPDAC"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1629984"},{"journal-title":"A Tool for Reversible Circuit Design","year":"0","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.284"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228377"},{"journal-title":"RCViewer+ version 2 5","year":"2013","author":"arabzadeh","key":"ref28"},{"journal-title":"Reversible Logic Synthesis From Fundamentals to Quantum Computing","year":"2012","author":"al-rabadi","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/VTS.2018.8368625"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/PHYCMP.1994.363692"},{"journal-title":"The big hack How china used a tiny chip to infiltrate u s companies","year":"0","author":"businessweek","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"ref5","first-page":"19","article-title":"Optoelectronic Multi-valued Conservative Logic","volume":"2","author":"picton","year":"1991","journal-title":"International Journal of Optical Computing"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2017.93"},{"key":"ref7","first-page":"5","article-title":"IC\/IP piracy assessment of reversible logic","author":"saeed","year":"2018","journal-title":"Proceedings of the ICCAD"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","article-title":"Logical Reversibility of Computation","volume":"17","author":"bennett","year":"1973","journal-title":"IBM Journal of Research and Development"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2018.2823315"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","article-title":"Irreversibility and Heat Generation in the Computing Process","volume":"5","author":"landauer","year":"1961","journal-title":"IBM Journal of Research and Development"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2511144"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53140-2_7"},{"key":"ref21","first-page":"236","article-title":"Sarlock: Sat Attack Resistant Logic Locking","year":"2016","journal-title":"Host"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2017.7951805"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2015.7140252"},{"key":"ref26","first-page":"1601","article-title":"Provably-secure Logic Locking: From Theory to Practice","year":"2017","journal-title":"SIGSAC Conference on CCS"},{"key":"ref25","first-page":"1","article-title":"Removal Attacks on Logic Locking and Camouflaging Techniques","author":"yasin","year":"2017","journal-title":"IEEE TETC"}],"event":{"name":"2019 IEEE European Test Symposium (ETS)","start":{"date-parts":[[2019,5,27]]},"location":"Baden-Baden, Germany","end":{"date-parts":[[2019,5,31]]}},"container-title":["2019 IEEE European Test Symposium (ETS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8784130\/8791505\/08791550.pdf?arnumber=8791550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:54:11Z","timestamp":1658094851000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8791550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/ets.2019.8791550","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}