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 条
  • [1] Balancing anonymity and resilience in anonymous communication networks
    Xia, Yusheng
    Chen, Rongmao
    Su, Jinshu
    Zou, Hongcheng
    COMPUTERS & SECURITY, 2021, 101
  • [2] Evaluation of anonymity of practical anonymous communication networks
    Kitazawa, S
    Soshi, M
    Miyaji, A
    INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2003, 2727 : 13 - 26
  • [3] A probabilistic model for anonymity analysis of anonymous communication networks
    Almasizadeh, Jaafar
    Azgomi, Mohammad Abdollahi
    TELECOMMUNICATION SYSTEMS, 2018, 69 (02) : 171 - 186
  • [4] A probabilistic model for anonymity analysis of anonymous communication networks
    Jaafar Almasizadeh
    Mohammad Abdollahi Azgomi
    Telecommunication Systems, 2018, 69 : 171 - 186
  • [5] An Anonymity Revocation Technology for Anonymous Communication
    Antoniou, Giannakis
    Batten, Lynn
    Parampalli, Udaya
    INFORMATION SYSTEMS DEVELOPMENT: TOWARDS A SERVICE PROVISION SOCIETY, 2009, : 329 - +
  • [6] Anonymity and the Internet - Anonymous communication is a cyberspace dilemma
    Johnson, D
    FUTURIST, 2000, 34 (04) : 12 - 12
  • [7] A Survey on Measuring Anonymity in Anonymous Communication Systems
    Lu, Tianbo
    Du, Zeyu
    Wang, Z. Jane
    IEEE ACCESS, 2019, 7 : 70584 - 70609
  • [8] On Anonymity in an Electronic Society: A Survey of Anonymous Communication Systems
    Edman, Matthew
    Yener, Buelent
    ACM COMPUTING SURVEYS, 2009, 42 (01)
  • [9] Anonymous communication in overlay networks
    Ren, Jian
    Li, Yun
    Jiang, Tingting
    Li, Tongtong
    SECURITY AND COMMUNICATION NETWORKS, 2016, 9 (03) : 229 - 240
  • [10] Relay Selection for Optimal Delay Anonymity Tradeoff in Anonymous Networks
    Javidbakht, Omid
    Venkitasubramaniam, Parv
    2015 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM 2015), 2015, : 960 - 965