An Optimal Strategy for Anonymous Communication Protocols

For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communication systems have been realized over the recent years. The effectiveness of these systems relies greatly on the way messages are routed among the participants. (We call this the route selection strategy.) In this paper, we describe how to select routes so as to maximize the ability of the anonymous communication systems to protect anonymity. To measure this ability, we define a metric (anonymity degree), and we design and evaluate an optimal route selection strategy that maximizes the anonymity degree of a system. Our analytical and experimental data shows that the anonymity degree may not always monotonically increase as the length of communication paths increase. We also found that variable path-length strategies perform better than fixed-length strategies.

• Type: Conference
• Year: 2002
• Where: ICDCS
• Authors: Yong Guan, Xinwen Fu, Riccardo Bettati, Wei Zhao
• Keywords: Anonymity Degree, Anonymous Communication Systems, Distributed And Parallel Computing, ICDCS 2002, Route Selection Strategy