Balancing anonymity and resilience in anonymous communication networks

被引:0
|
作者
Xia, Yusheng [1 ]
Chen, Rongmao [1 ]
Su, Jinshu [2 ]
Zou, Hongcheng [1 ]
机构
[1] College of Computer, National University of Defense Technology, Changsha, China
[2] National Key Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
来源
Computers and Security | 2021年 / 101卷
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Anonymous communication networks (ACNs) are intended to protect the metadata privacy during the communication. As typical ACNs, onion mix-nets adopt source routing where the source defines a static path and wraps the message with the public keys of on-path nodes so that the message could be delivered to the destination. However, onion mix-nets lack resilience when the static on-path mixes fail, which could result in message loss, communication failure and even de-anonymization attacks. Therefore, it is desirable to achieve routing resilience in onion mix-nets for persistent routing capability even against node failure. The state-of-the-art solutions mainly adopt mix groups and thus need to share secrets among all the group members, which may cause single point of failure and render massive loss of anonymity. To address the above problem, in this work we design a hybrid routing approach, which essentially embeds the onion mix-net with hop-by-hop routing to achieve desirable routing resilience. Furthermore, we extend our scheme with a threshold setting, and propose T-hybrid routing to mitigate the anonymity loss when group mixes are compromised. Besides, we propose the active defense mechanism to defend replay attacks in the scenario of mix groups. As for experimental evaluations, we conduct a quantitative analysis of the resilience and anonymity for various schemes, and demonstrate that T-hybrid routing can achieve a good balance between resilience and anonymity. In addition, we manage to realize the full T-hybrid routing prototype and test its performance in the cloud hosting environment. The experimental results show that compared with typical onion mix-nets, our T-hybrid routing mechanism only increases about 20%-25% regarding the end-to-end delay, and thus is still practical while with better resilience. © 2020 Elsevier Ltd
引用
收藏
相关论文
共 50 条
  • [41] Quantum anonymous voting with anonymity check
    Horoshko, Dmitri
    Kilin, Sergei
    PHYSICS LETTERS A, 2011, 375 (08) : 1172 - 1175
  • [42] Mobility changes anonymity: Mobile ad hoc networks need efficient anonymous routing
    Kong, JJ
    Hong, XY
    Sanadidi, MY
    Gerla, M
    10TH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2005, : 57 - 62
  • [43] Strong Anonymity is not Enough: Introducing Fault Tolerance to Planet-Scale Anonymous Communication Systems
    Oldenburg, Lennart
    Tschorsch, Florian
    ARES 2021: 16TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY AND SECURITY, 2021,
  • [44] An Anonymous Authentication and Communication Protocol for Wireless Mesh Networks
    Sen, Jaydip
    ADVANCES IN COMPUTING AND COMMUNICATIONS, PT 4, 2011, 193 : 580 - 592
  • [45] On flow marking attacks in wireless anonymous communication networks
    Fu, XW
    Zhu, Y
    Graham, B
    Bettati, R
    Zhao, W
    25TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2005, : 493 - 503
  • [46] A new replay attack against anonymous communication networks
    Pries, Ryan
    Yu, Wei
    Fu, Xinwen
    Zhao, Wei
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 1578 - +
  • [47] TightRope: Towards Optimal Load-balancing of Paths in Anonymous Networks
    Darir, Hussein
    Sibai, Hussein
    Borisov, Nikita
    Dullerud, Geir
    Mitra, Sayan
    PROCEEDINGS OF THE 2018 WORKSHOP ON PRIVACY IN THE ELECTRONIC SOCIETY (WPES'18), 2018, : 76 - 85
  • [48] Time and Communication Complexity of Leader Election in Anonymous Networks
    Kowalski, Dariusz R.
    Mosteiro, Miguel A.
    2021 IEEE 41ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2021), 2021, : 449 - 460
  • [49] LEVEL OF RESILIENCE MEASURE FOR COMMUNICATION NETWORKS
    Ibrahim, Mariam Wajdi
    JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGY-MALAYSIA, 2018, 17 (01): : 115 - 139
  • [50] De-Anonymizing and Countermeasures in Anonymous Communication Networks
    Yang, Ming
    Luo, Junzhou
    Ling, Zhen
    Fu, Xinwen
    Yu, Wei
    IEEE COMMUNICATIONS MAGAZINE, 2015, 53 (04) : 60 - 66