Comprehensive Anonymity Trilemma: User Coordination is not enough

Author:

Das Debajyoti1,Meiser Sebastian2,Mohammadi Esfandiar3,Kate Aniket4

Affiliation:

1. Purdue University ,

2. Visa Research

3. Universitaet zu Luebeck

4. Purdue University

Abstract

Abstract For anonymous communication networks (ACNs), Das et al. recently confirmed a long-suspected trilemma result that ACNs cannot achieve strong anonymity, low latency overhead and low bandwidth overhead at the same time. Our paper emanates from the careful observation that their analysis does not include a relevant class of ACNs with what we call user coordination where users proactively work together towards improving their anonymity. We show that such protocols can achieve better anonymity than predicted by the above trilemma result. As the main contribution, we present a stronger impossibility result that includes all ACNs we are aware of. Along with our formal analysis, we provide intuitive interpretations and lessons learned. Finally, we demonstrate qualitatively stricter requirements for the Anytrust assumption (all but one protocol party is compromised) prevalent across ACNs.

Publisher

Walter de Gruyter GmbH

Subject

General Medicine

Reference33 articles.

1. [1] N. Alexopoulos, A. Kiayias, R. Talviste, and T. Zacharias, MCMix: Anonymous Messaging via Secure Multiparty Computation, in Proceedings of the 26th USENIX Security Symposium, USENIX Association, 2017, pp. 1217–1234.

2. [2] M. Ando, A. Lysyanskaya, and E. Upfal, Practical and Provably Secure Onion Routing, in Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, pp. 144:1–144:14.

3. [3], On the Complexity of Anonymous Communication Through Public Networks, CoRR arXiv, abs/1902.06306 (2019).

4. [4] S. Angel and S. Setty, Unobservable Communication over Fully Untrusted Infrastructure, in Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (OSDI), USENIX Association, 2016, pp. 551–569.

5. [5] G. R. Blakley and C. Meadows, Security of ramp schemes, in Advances in Cryptology, 1985, pp. 242–268.

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Systematic Survey on Security in Anonymity Networks: Vulnerabilities, Attacks, Defenses, and Formalization;IEEE Communications Surveys & Tutorials;2024

2. Maybenot: A Framework for Traffic Analysis Defenses;Proceedings of the 22nd Workshop on Privacy in the Electronic Society;2023-11-26

3. Splitting Hairs and Network Traces;Proceedings of the 21st Workshop on Privacy in the Electronic Society;2022-11-07

4. Poly Onions: Achieving Anonymity in the Presence of Churn;Theory of Cryptography;2022

5. Oblivious DNS over HTTPS (ODoH): A Practical Privacy Enhancement to DNS;Proceedings on Privacy Enhancing Technologies;2021-07-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3