Affiliation:
1. University of Massachusetts Amherst, Amherst, MA
2. Georgetown University, Washington, DC
Abstract
There have been a number of protocols proposed for anonymous network communication. In this paper, we investigate attacks by corrupt group members that degrade the anonymity of each protocol over time. We prove that when a particular initiator continues communication with a particular responder across path reformations, existing protocols are subject to the attack. We use this result to place an upper bound on how long existing protocols, including Crowds, Onion Routing, Hordes, Web Mixes, and DC-Net, can maintain anonymity in the face of the attacks described. This provides a basis for comparing these protocols against each other. Our results show that fully connected DC-Net is the most resilient to these attacks, but it suffers from scalability issues that keep anonymity group sizes small. We also show through simulation that the underlying topography of the DC-Net affects the resilience of the protocol: as the number of neighbors a node has increases the strength of the protocol increases, at the cost of higher communication overhead.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,General Computer Science
Reference32 articles.
1. Project “anonymity and unobservability in the Internet”
2. Bertsekas D. and Gallager R. 1987. Data Networks. Prentice-Hall Englewood Cliffs NJ.]] Bertsekas D. and Gallager R. 1987. Data Networks. Prentice-Hall Englewood Cliffs NJ.]]
3. Untraceable electronic mail, return addresses, and digital pseudonyms
4. The dining cryptographers problem: Unconditional sender and receipient untraceability;Chaum D.;J. Cryptography,1988
Cited by
99 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Plausibly Deniable Content Discovery for Bitswap Using Random Walks;2024 IEEE 49th Conference on Local Computer Networks (LCN);2024-10-08
2. A De-anonymization Attack against Downloaders in Freenet;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20
3. Illegal Patterns Identification on Dark Web Using Machine Learning;2023 International Conference on Emerging Research in Computational Science (ICERCS);2023-12-07
4. Random spanning trees for expanders, sparsifiers, and virtual network security;Computer Communications;2023-12
5. Revelio: A Network-Level Privacy Attack in the Lightning Network;2023 IEEE 8th European Symposium on Security and Privacy (EuroS&P);2023-07