Evaluating Mixing Methods: Anonymity, Long-Term Information Leakage, and Cost

被引:0
作者
Aksoy, Alperen [1 ]
Kesdogan, Dogan [2 ]
机构
[1] Friedrich Alexander Univ Erlangen Nurnberg, Lehrstuhl Informat 1, D-91054 Erlangen, Germany
[2] Univ Regensburg, Lehrstuhl Wirtschaftsinformat 4, D-93053 Regensburg, Germany
关键词
Protection; Costs; Information leakage; Entropy; Measurement; Delays; Privacy; Exponential distribution; Bandwidth; Electronic mail; Anonymity; Mix-nets; privacy and cost evaluation; communication networks; TRAFFIC ANALYSIS;
D O I
10.1109/ACCESS.2025.3584267
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mix-nets are essential tools for safeguarding user privacy in communication networks. When deploying systems, two well-known mixing methods, batch (e.g., Timed Mix) and continuous mixing (e.g., Stop-and-Go Mix), are commonly used in real-world Mix-nets. However, no comprehensive study has evaluated the impact of these methods on anonymity, long-term information leakage, and the cost associated with dummy message overhead. To address this gap, this study provides a comprehensive analysis of these mixing methods. To this end, anonymity set size and entropy metrics are used to evaluate the anonymity protection of individual messages. The applicability of the Statistical Disclosure Attack (SDA) is extended to evaluate long-term information leakage for both mixing methods, and the closed-loop control anonymity protection model is adapted to measure the cost of anonymity protection in terms of the dummy message overhead. The experimental results show that continuous mixes provide stronger anonymity protection for individual messages-yielding up to 10% higher entropy under the default experimental settings. However, both long-term information leakage and the cost of achieving the desired protection are generally higher in continuous mixes, especially under high traffic scenarios. For example, under the default experimental settings, completing the SDA requires 1.5 times more observations in batch mixing than in continuous mixing and achieves the desired protection with 49% less cost in terms of the dummy message usage. These findings highlight the importance of selecting appropriate mixing method to balance anonymity, long-term information leakage, and cost in anonymous communication systems.
引用
收藏
页码:113028 / 113048
页数:21
相关论文
共 54 条
[21]   On Anonymity in an Electronic Society: A Survey of Anonymous Communication Systems [J].
Edman, Matthew ;
Yener, Buelent .
ACM COMPUTING SURVEYS, 2009, 42 (01)
[22]   Let the Users Choose: Low Latency or Strong Anonymity? Investigating Mix Nodes with Paired Mixing Techniques [J].
Gaballah, Sarah Abdelwahab ;
Abdullah, Lamya ;
Muehlhaeuser, Max ;
Marky, Karola .
19TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY, AND SECURITY, ARES 2024, 2024,
[23]   Mitigating Intersection Attacks in Anonymous Microblogging [J].
Gaballah, Sarah Abdelwahab ;
Thanh Hoang Long Nguyen ;
Abdullah, Lamya ;
Zimmer, Ephraim ;
Muehlhaeuser, Max .
18TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY & SECURITY, ARES 2023, 2023,
[24]   Onion Routing for anonymous and private Internet connections [J].
Goldschlag, D ;
Reed, M ;
Syverson, P .
COMMUNICATIONS OF THE ACM, 1999, 42 (02) :39-41
[25]   Cover Traffic: A Trade of Anonymity and Efficiency [J].
Grube, Tim ;
Thummerer, Markus ;
Daubert, Joerg ;
Muehlhaeuser, Max .
SECURITY AND TRUST MANAGEMENT (STM 2017), 2017, 10547 :213-223
[26]  
Guirat I., 2020, P PRIV ENH TECHN S H
[27]   TASP: Towards Anonymity Sets that Persist [J].
Hayes, Jamie ;
Troncoso, Carmela ;
Danezis, George .
PROCEEDINGS OF THE 2016 ACM WORKSHOP ON PRIVACY IN THE ELECTRONIC SOCIETY (WPES'16), 2016, :177-180
[28]  
Hugenroth D, 2023, PROCEEDINGS OF THE 32ND USENIX SECURITY SYMPOSIUM, P5431
[29]  
Hugenroth D, 2021, PROCEEDINGS OF THE 30TH USENIX SECURITY SYMPOSIUM, P3433
[30]  
Jiang P, 2023, PROCEEDINGS OF THE 20TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION, NSDI 2023, P877