Computer Science ›› 2025, Vol. 52 ›› Issue (3): 391-399.doi: 10.11896/jsjkx.240100151

• Information Security • Previous Articles     Next Articles

Tor Network Path Selection Algorithm Based on Similarity Perception

SUI Jiaqi1, HU Hongchao1,2, SHI Xin2, ZHOU Dacheng2, CHEN Shangyu2   

  1. 1 School of Cyber Science and Engineering,Zhengzhou University,Zhengzhou 450001,China
    2 Institute of Information Technology,University of Information Engineering,Zhengzhou 450001,China
  • Received:2024-01-19 Revised:2024-10-25 Online:2025-03-15 Published:2025-03-07
  • About author:SUI Jiaqi,born in 2000,postgraduate.His main research interests include cyber security and anonymous communication.
    HU Hongchao,born in 1982,professor,Ph.D supervisor.His main research interests include cloud computing security and cyber security.
  • Supported by:
    Regional Innovation and Development Joint Fundof the National Natural Science Foundation of China(U22A2001) and National Natural Science Foundation of China(62072467).

Abstract: Due to the low threshold construction conditions and open participation mechanism of Tor,attackers can conduct Sybil assaults on Tor networks by controlling a significant number of malicious Sybil nodes,posing a serious threat to user privacy.One class ofmethod defenses by identifying malicious nodes.This class of security suffers from a lack of accuracy in evaluating node similarities and challenges in recognizing malicious nodes that have targeted concealment.The other class protects by strengthening the security of the Tor path selection algorithm,which has issues such as being unable to withstand repeated Sybil attacks and finding it challenging to satisfy the needs of both performance and security.To make up for the vulnerability problem of the existing defense methods themselves,it is proposed to apply the malicious node identification methods and path selection algorithms comprehensively.First,the information of relay nodes is collected from multiple data sources,and the data from multiple sources are verified,filtered,and fused to improve the security at the data level.Second,the selection tendency of dependable nodes with long-term bandwidth stability is somewhat increased by the optimization of bandwidth measurements based on historical data,increasing the cost of deploying malicious Sybil nodes for attackers.Then,the relay node similarity assessment method is optimized,and a nearest-neighbor sorting algorithm based on aggregated similarity scores is proposed to improve the accuracy of the node similarity analysis.Finally,the optimized similarity assessment method is integrated into the path selection algorithm design,and a path selection algorithm based on similarity perception is proposed.Experimental results show that the algorithm not only shows better defense effect against multiple Sybil attacks,but also ensures that the performance requirements of the link are met.

Key words: Anonymous communication, Tor, Sybil attack, Path selection algorithm

CLC Number: 

  • TP393.08
[1]KARUNANAYAKE I,AHMED N,MALANEY R,et al.De-anonymisation Attacks on Tor:A Survey[J].IEEE Communications Surveys & Tutorials,2021,23(4):2324-2350.
[2]NASR M,BAHRAMALI A,HOUMANSADR A.Deepcorr:Strong flow correlation attacks on tor using deep learning[C]//Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security.2018:1962-1976.
[3]KOHLS K,JANSEN K,RUPPRECHT D,et al.On the Challenges of Geographical Avoidance for Tor[C]//NDSS.2019.
[4]SUN Y X,EDMUNDSON A,VANBEVER L,et al.RAPTOR:Routing attacks on privacy in Tor[C]//24th USENIX Security Symposium(USENIX Security 15).2015:271-286.
[5]RIMMER V,PREUVENEERS D,JUAREZ M,et al.Automated website fingerprinting through deep learning[J].arXiv:1708.06376,2017.
[6]SIRINAM P,IMANI M,JUAREZ M,et al.Deep fingerprinting:Undermining website fingerprinting defenses with deep learning[C]//Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security.2018:1928-1943.
[7]LI S,GUO H J,HOPPER N.Measuring information leakage in website fingerprinting attacks and defenses[C]//Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security.2018:1977-1992.
[8]WINTER P,ENSAFI R,LOESING K,et al.Identifying andcharacterizing Sybils in the Tor network[C]//25th USENIX Security Symposium(USENIX Security 16).2016:1169-1185.
[9]ZHANG W Y.Research and Implementation of Tor Network path selection strategy against sybil attacks[D].Beijing:Beijing University of Posts and Telecommunications,2020.
[10]FENG Q,XIA Y M,YAO W B,et al.Malicious Relay Detection for Tor Network Using Hybrid Multi-Scale CNN-LSTM with Attention[C]//2023 IEEE Symposium on Computers and Communications(ISCC).IEEE,2023:1242-1247.
[11]JOHNSON A,JANSEN R,JAGGARD A D,et al.Avoiding the man on the wire:Improving Tor’s security with trust-aware path selection[J].arXiv:1511.05453,2017.
[12]LV M,ZHU Y F,LIN W.Dynamic Routing Algorithm Based on Bandwidth of Anonymous Network[J].Journal of Information Engineering University,2019,20(5):591-596.
[13]HANLEY H,SUN Y X,WAGH S,et al.DPSelect:A Differential Privacy Based Guard Relay Selection Algorithm for Tor[J].Proceedings on Privacy Enhancing Technologies,2019,2:166-186.
[14]ZHAO H,WANG L M,SHEN T H,et al.Survey on Anonymity Metrics in Communication Network[J].Journal of Software,2021,32(1):218-245.
[15]EVERS B,HOLS J,KULA E,et al.Thirteen years of Tor attacks[EB/OL].https://github.com/Attacks-on-Tor/Attacks-on-Tor/blob/master/Thirteen%20years%20of%20Tor%20Atta-cks.pdf.
[16]YE L,YU X Z,ZHAO J D,et al.Deciding your own anonymity:User-oriented node selection in I2P[J].IEEE Access,2018,6:71350-71359.
[17]YANG M,ZHANG Y T,LUO J Z.Randomized bandwidthweighted node selection algorithm for anonymous communication[J].Journal of Southeast University(Natural Science Edition),2010,40(6):1169-1173.
[18]JOHNSON A,WACEK C,JANSEN R,et al.Users get routed:Traffic correlation on Tor by realistic adversaries[C]//Procee-dings of the 2013 ACM SIGSAC Conference on Computer & Communications Security.2013:337-348
[1] ZHENG Jianwen, LIU Bo, LIN Weiwei, XIE Jiachen. Survey of Communication Efficiency for Federated Learning [J]. Computer Science, 2025, 52(2): 1-7.
[2] XU Ruida, LI Yongkun, XU Yinlong. Performance Optimization of LSM-tree Based Key-Value Storage System Based on Fine-grained Cache andLearned Index [J]. Computer Science, 2025, 52(2): 33-41.
[3] FU Xiong, SONG Zhaoyang, WANG Junchang, DENG Song. Study on Distributed Hybrid Storage Based on Erasure Coding and Replication [J]. Computer Science, 2025, 52(2): 42-47.
[4] WANG Tianyi, LIN Youfang, GONG Letian, CHEN Wei, GUO Shengnan, WAN Huaiyu. Check-in Trajectory and User Linking Based on Natural Language Augmentation [J]. Computer Science, 2025, 52(2): 99-106.
[5] ZHANG Xia, SU Zhaohui, CHEN Lu. Face Detection Algorithm Based on Multi-task Joint Learning in Weak Light Scenes [J]. Computer Science, 2025, 52(2): 191-201.
[6] YAO Zilu, FU Yinjin, XIAO Nong. Research Progress on Optimization Techniques of Tiered Storage Based on Deduplication [J]. Computer Science, 2025, 52(1): 120-130.
[7] LI Chunyu, DENG Long, LI Yongkun, XU Yinlong. Application-aware Disaggregated Storage Design for Remote Memory Graph Database [J]. Computer Science, 2025, 52(1): 151-159.
[8] CAI Junchuang, ZHU Qingling, LIN Qiuzhen, LI Jianqiang, MING Zhong. Decomposition-based Multi-objective Evolutionary Algorithm for Industrial Dynamic Pickup andDelivery Problems [J]. Computer Science, 2025, 52(1): 331-344.
[9] XU He, ZHOU Tao, LI Peng, QIN Fangfang, JI Yimu. LU Parallel Decomposition Optimization Algorithm Based on Kunpeng Processor [J]. Computer Science, 2024, 51(9): 51-58.
[10] LI Zhe, LIU Yiyang, WANG Ke, YANG Jie, LI Yafei, XU Mingliang. Real-time Prediction Model of Carrier Aircraft Landing Trajectory Based on Stagewise Autoencoders and Attention Mechanism [J]. Computer Science, 2024, 51(9): 273-282.
[11] CONG Yingnan, PENG You, ZHU Jinqing. Study on Classification and Grading Allocation of Data Property Rights Protection Rules UnderC&M Framework [J]. Computer Science, 2024, 51(8): 34-44.
[12] MAO Zhixiong, LIU Zhinan, GAO Xuning, WANG Mengxiang, GONG Shufeng, ZHANG Yanfeng. Power-PCSR:An Efficient Dynamic Graph Storage Structure for Power-law Graphs [J]. Computer Science, 2024, 51(8): 56-62.
[13] ZHENG Yu, XUE Zhan’ao, LYU Mingming, XU Jiucheng. Multi-granularity Intuitive Fuzzy Rough Set Model Based on θ Operator [J]. Computer Science, 2024, 51(8): 83-96.
[14] QIAN Zekai, DING Xiaoou, SUN Zhe, WANG Hongzhi, ZHANG Yan. Intelligent Evidence Set Selection Method for Diverse Data Cleaning Tasks [J]. Computer Science, 2024, 51(8): 124-132.
[15] LI Xing, ZHONG Guomin. Fixed-time Recurrent Neural Networks for Time-variant Matrix Computing and Its Application in Repeatable Motion Planning [J]. Computer Science, 2024, 51(8): 324-332.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!