Affiliation:
1. Institute of Information Science, Beijing Jiaotong University, Beijing 100044, China
2. Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing Jiaotong University, Beijing 100044, China
Abstract
With the rise of the internet, there has been an increasing focus on user anonymity. Anonymous communication networks (ACNs) aim to protect the identity privacy of users in the network. As a typical ACN, Tor achieves user anonymity by relaying user data through a series of relay nodes. However, this results in higher latency due to the transmission of network traffic between multiple nodes. This paper proposes a port-based anonymous communication network (PBACN) to address this issue. First, we propose a path construction algorithm. This algorithm describes constructing paths by partitioning the communication path information, which can reduce the probability of being discovered by adversaries. Secondly, we design a port-based source routing addressing method. During data transmission from the source to the destination, each node can directly forward the data by resolving the address into the port of each node. This method eliminates the need for table lookups, reducing the complexity of routing. Lastly, we propose an entropy-based metric to measure the anonymity of different ACNs. In terms of experimental evaluation, we quantitatively analyze the anonymity and end-to-end delay of various ACNs. The experimental results show that our proposed method reduces end-to-end delay by approximately 25% compared to Tor. When the adversary fraction is 20%, PBACN can improve the anonymity degree by approximately 4%.
Funder
Joint Project of the National Natural Science Foundation of China.
Subject
Electrical and Electronic Engineering,Biochemistry,Instrumentation,Atomic and Molecular Physics, and Optics,Analytical Chemistry
Reference33 articles.
1. Anonymity services tor, i2p, jondonym: Classifying in the dark (web);Montieri;IEEE Trans. Dependable Secur. Comput.,2018
2. The dining cryptographers problem: Unconditional sender and recipient untraceability;Chaum;J. Cryptol.,1988
3. Mödinger, D., Heß, A., and Hauck, F.J. (2021). Arbitrary length K-anonymous dining-cryptographers communication. arXiv.
4. Tarzan: A peer-to-peer anonymizing network layer;Freedman;Proc. ACM Conf. Comput. Commun. Secur.,2002
5. Rennhard, M., and Plattner, B. (2002, January 21). Introducing morphmix: Peer-to-peer based anonymous internet usage with collusion detection. Proceedings of the 2002 ACM Workshop on Privacy in the Electronic Society, Washington, DC, USA.