{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:30:47Z","timestamp":1753882247718,"version":"3.41.2"},"reference-count":27,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:00:00Z","timestamp":1730246400000},"content-version":"vor","delay-in-days":303,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61931004","62072250"],"award-info":[{"award-number":["61931004","62072250"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021QY0700"],"award-info":[{"award-number":["2021QY0700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Intelligent Systems"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>Anonymous network tracing is a significant research subject in the field of network security, and flow correlation technology serves as a fundamental technique for deanonymizing network traffic. Existing flow correlation techniques are considered ineffective and unreliable when applied on a large scale because they exhibit high false\u2010positive rates or require impractically long periods of traffic observation to achieve reliable correlations. To address this issue, this paper proposed an innovative flow correlation approach for the typical and most widely used Tor anonymous network by combining graph convolutional neural networks with triplet networks. Our proposed method involves extracting features such as packet intervals, packet lengths, and directions from Tor network traffic and encoding each flow into a graph representation. The integration of triplet networks enhances the internode relationships, which can effectively fuse flow representations with node associations. The graph convolutional neural network extracts features from the input graph topology, mapping them to distinct representations in the embedding space, thus effectively distinguishing different Tor flows. Experimental results demonstrate that with a false\u2010positive rate as low as 0.1%, the correlation accuracy reaches 86.4%, showcasing a 5.1% accuracy improvement compared to the existing state\u2010of\u2010the\u2010art methods.<\/jats:p>","DOI":"10.1155\/2024\/8823511","type":"journal-article","created":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T16:42:57Z","timestamp":1730306577000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FlowCorrGCN: Enhancing Flow Correlation Through Graph Convolutional Networks and Triplet Networks"],"prefix":"10.1155","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8557-9899","authenticated-orcid":false,"given":"Jiangtao","family":"Zhai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0349-3873","authenticated-orcid":false,"given":"Kaijie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolong","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufei","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4729-7406","authenticated-orcid":false,"given":"Guangjie","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2024,10,30]]},"reference":[{"key":"e_1_2_14_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2023.103713"},{"key":"e_1_2_14_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2020.102106"},{"key":"e_1_2_14_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2023.109828"},{"key":"e_1_2_14_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/comst.2021.3093615"},{"key":"e_1_2_14_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2022.3174003"},{"key":"e_1_2_14_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2018.2868054"},{"key":"e_1_2_14_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/tii.2020.2988870"},{"key":"e_1_2_14_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnse.2022.3179569"},{"key":"e_1_2_14_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2018.2804394"},{"key":"e_1_2_14_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2022.06.028"},{"key":"e_1_2_14_11_2","doi-asserted-by":"crossref","unstructured":"JohnsonA. WacekC. JansenR. SherrM. andSyversonP. Users Get Routed: Traffic Correlation on Tor by Realistic Adversaries Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security November 2013 Berlin Germany ACM 337\u2013348.","DOI":"10.1145\/2508859.2516651"},{"key":"e_1_2_14_12_2","doi-asserted-by":"crossref","unstructured":"HoumansadrA.andBorisovN. The Need for Flow Fingerprints to Link Correlated Network Flows Privacy Enhancing Technologies: 13th International Symposium PETS 2013 July 2013 Bloomington IN Springer Berlin Heidelberg 205\u2013224.","DOI":"10.1007\/978-3-642-39077-7_11"},{"key":"e_1_2_14_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2023.103123"},{"key":"e_1_2_14_14_2","unstructured":"SunY. EdmundsonA. VanbeverL.et al. Routing Attacks on Privacy in Tor 24th USENIX Security Symposium (USENIX Security 15) August 2015 Washington DC 271\u2013286."},{"key":"e_1_2_14_15_2","doi-asserted-by":"crossref","unstructured":"NasrM. HoumansadrA. andMazumdarA. Compressive Traffic Analysis: A New Paradigm for Scalable Traffic Analysis 4 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security October 2017 Dallas TX 2053\u20132069 https:\/\/doi.org\/10.1145\/3133956.3134074 2-s2.0-85041452153.","DOI":"10.1145\/3133956.3134074"},{"key":"e_1_2_14_16_2","doi-asserted-by":"crossref","unstructured":"NasrM. BahramaliA. andHoumansadrA. Deepcorr: Strong Flow Correlation Attacks on Tor Using Deep Learning Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security October 2018 Toronto Canada 1962\u20131976.","DOI":"10.1145\/3243734.3243824"},{"key":"e_1_2_14_17_2","doi-asserted-by":"crossref","unstructured":"ZhongG. GangX. ZhenL. andGouG. ResTor: A Pre-processing Model for Removing the Noise Pattern in Flow Correlation 2020 IEEE Symposium on Computers and Communications July 2020 Washington DC IEEE Press 1\u20136.","DOI":"10.1109\/ISCC50000.2020.9219544"},{"key":"e_1_2_14_18_2","doi-asserted-by":"crossref","unstructured":"JiLi ChunxiangGu ZhangX. andLiuW. AttCorr: A Novel Deep Learning Model for Flow Correlation Attacks on Tor 2021 IEEE International Conference on Consumer Electronics and Computer Engineering January 2021 Washington DC IEEE Press 427\u2013430.","DOI":"10.1109\/ICCECE51280.2021.9342534"},{"key":"e_1_2_14_19_2","doi-asserted-by":"crossref","unstructured":"OhS. E. YangT. MathewsN.et al. Improved Flow Correlation Attacks on Tor via Metric Learning and Amplification 2022 IEEE Symposium on Security and Privacy May 2022 Washington DC IEEE Press 1915\u20131932.","DOI":"10.1109\/SP46214.2022.9833801"},{"key":"e_1_2_14_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2946802"},{"key":"e_1_2_14_21_2","doi-asserted-by":"crossref","unstructured":"PanchenkoA. NiessenL. ZinnenA. andEngelT. Website Fingerprinting in Onion Routing Based Anonymization Networks Proceedings of the 10th Annual ACM Workshop on Privacy in the Electronic Society October 2011 Chicago IL 103\u2013114.","DOI":"10.1145\/2046556.2046570"},{"key":"e_1_2_14_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126534"},{"key":"e_1_2_14_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2023.117024"},{"key":"e_1_2_14_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126272"},{"key":"e_1_2_14_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106046"},{"key":"e_1_2_14_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/tmm.2021.3118881"},{"volume-title":"Deep Learning With Keras","year":"2017","author":"Gulli A.","key":"e_1_2_14_27_2"}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2024\/8823511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T16:43:09Z","timestamp":1730306589000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2024\/8823511"}},"subtitle":[],"editor":[{"given":"Yu-an","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1155\/2024\/8823511"],"URL":"https:\/\/doi.org\/10.1155\/2024\/8823511","archive":["Portico"],"relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"type":"print","value":"0884-8173"},{"type":"electronic","value":"1098-111X"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"2024-05-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8823511"}}