{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T17:05:23Z","timestamp":1770138323859,"version":"3.49.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"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":[[2025,11,14]]},"DOI":"10.1109\/trustcom66490.2025.00096","type":"proceedings-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:42:41Z","timestamp":1770064961000},"page":"825-836","source":"Crossref","is-referenced-by-count":0,"title":["RL-Optimized Lightweight Obfuscation Against Binary Code Similarity Detection"],"prefix":"10.1109","author":[{"given":"Ran","family":"Wei","sequence":"first","affiliation":[{"name":"Ministry of Education,Key Laboratory of Cyberspace Security,ZhengZhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Shu","sequence":"additional","affiliation":[{"name":"Ministry of Education,Key Laboratory of Cyberspace Security,ZhengZhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Kang","sequence":"additional","affiliation":[{"name":"Ministry of Education,Key Laboratory of Cyberspace Security,ZhengZhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3446371"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2025.129646"},{"key":"ref3","article-title":"Structural Comparison of Executable Objects","author":"Dullien","year":"2004","journal-title":"DIMVA"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534367"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3650212.3652145"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277719"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i23.34672"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SPRO.2015.10"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2886012"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.10.114"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzae069"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.3041655"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5466"},{"key":"ref15","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1631\/FITEE.2400088"},{"key":"ref17","first-page":"2099","article-title":"How machine learning is solving the binary function similarity problem","volume-title":"31st USENIX Security Symposium (USENIX Security 22)","author":"Marcelli"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3701992"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950350"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978370"},{"key":"ref21","first-page":"1759","article-title":"Code is not natural language: Unlock the power of {Semantics-Oriented} graph representation for binary code similarity detection","volume-title":"33rd USENIX Security Symposium (USENIX Security 24)","author":"He"},{"key":"ref22","article-title":"A taxonomy of obfuscating transformations","author":"Collberg","year":"1997"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268962"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCL.1998.674154"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77370-2_6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00730-9_10"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/197405.197406"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SPRO.2015.10"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/14095772X"},{"key":"ref30","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3579990.3580007"}],"event":{"name":"2025 IEEE 24th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","location":"Guiyang, China","start":{"date-parts":[[2025,11,14]]},"end":{"date-parts":[[2025,11,17]]}},"container-title":["2025 IEEE 24th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11354467\/11354567\/11354973.pdf?arnumber=11354973","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T06:12:38Z","timestamp":1770099158000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11354973\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/trustcom66490.2025.00096","relation":{},"subject":[],"published":{"date-parts":[[2025,11,14]]}}}