{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:52:29Z","timestamp":1778345549773,"version":"3.51.4"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272039"],"award-info":[{"award-number":["62272039"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2702402"],"award-info":[{"award-number":["2022YFB2702402"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3560193","type":"journal-article","created":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T17:55:59Z","timestamp":1744394159000},"page":"4726-4738","source":"Crossref","is-referenced-by-count":2,"title":["De-Anonymizing Monero: A Maximum Weighted Matching-Based Approach"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2796-776X","authenticated-orcid":false,"given":"Xingyu","family":"Yang","sequence":"first","affiliation":[{"name":"School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6435-6055","authenticated-orcid":false,"given":"Lei","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3277-3887","authenticated-orcid":false,"given":"Liehuang","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3346276"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186046"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583345"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3266162"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3208471"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-9213-3_38"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2024.104019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.52214\/cblr.v2022i1.9986"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0025"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66399-9_9"},{"key":"ref11","first-page":"760","article-title":"Analysis of CryptoNote transaction graphs using the dulmage-mendelsohn decomposition","volume-title":"Proc. 5th Conf. Adv. Financial Technol. (AFT)","author":"Vijayakumaran"},{"key":"ref12","article-title":"Alt-coin traceability","author":"Ye","year":"2020","journal-title":"Cryptol. ePrint Arch."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICBC59979.2024.10634447"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00165"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICBC51069.2021.9461084"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90567-5_22"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICBC51069.2021.9461130"},{"key":"ref18","volume-title":"Zero to Monero","author":"Alonso","year":"2020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2022-0085"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_32"},{"key":"ref21","volume-title":"Cryptonote V2.0","author":"van Saberhagen","year":"2013"},{"key":"ref22","article-title":"Improving obfuscation in the cryptonote protocol","author":"Mackenzie","year":"2015"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0047"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2024.130294"},{"issue":"1","key":"ref25","first-page":"148","article-title":"Survey of anonymity and tracking technology in Monero","volume":"42","author":"Lin","year":"2022","journal-title":"J. Comput. Appl."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68974-1_15"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"ref28","first-page":"434","article-title":"Data structures for weighted matching and nearest common ancestors with linking","volume-title":"Proc. 1st Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Gabow"},{"key":"ref29","article-title":"Greedy online bipartite matching on random graphs","author":"Mastin","year":"2013","journal-title":"arXiv:1307.2536"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.07.012"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.10.021"},{"key":"ref32","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton"},{"key":"ref33","first-page":"134","article-title":"Learning what to defer for maximum independent sets","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ahn"},{"key":"ref34","article-title":"Reinforcement learning: An introduction","author":"Sutton","year":"2018","journal-title":"A Bradford Book"},{"key":"ref35","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017","journal-title":"arXiv:1707.06347"},{"key":"ref36","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv:1810.00826"},{"key":"ref37","volume-title":"Lord of the Rings: An Empirical Analysis of Monero\u2019s Ring Signature Resilience to Artificially Intelligent Attacks","year":"2022"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100205"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/10963663.pdf?arnumber=10963663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T17:59:22Z","timestamp":1746813562000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10963663\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3560193","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}