An optimal strategy for anonymous communication protocols
Tóm tắt
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.
Từ khóa
#Protocols #Protection #Internet #Application software #Electronic voting #Computer science #Electronic mail #Data analysis #Privacy #Communication system securityTài liệu tham khảo
giilcii, 1996, Mixing Email with Babel, Proceedings of the 1996 Symposium on Network and Distributed System Security
10.1109/49.668973
0, Lucent Personalized Web Assistant
10.1109/49.668972
10.1145/290163.290168
shields, 2000, A Protocol for Anonymous Communication Over the Internet, Proceedings of the 7th ACM Conference on Computer and Communication Security
10.1109/ICNP.2001.992907
10.1109/SECPRI.1997.601314
syverson, 1999, Group Principles and the Formalization of Anonymity, World Congress on Formal Methods'99, LNCS 1708, 814
syverson, 2000, Towards an Analysis of Onion Routing Security, Workshop on Design Issues in Anonymity and Unob-servability
10.1007/BF00206326
chaum, 1981, Untraceable Electronic Mail, Return Ad-dresses, and Digital Pseudonyms, CACM, 24, 84, 10.1145/358549.358563
gabber, 1997, How to make personalized web browing simple, se-cure, and anonymous, Proceedings of Financial Crvptography'97-LNCS 1318
dai, 0, PipeNet 1 1
10.1145/293411.293443
goldberg, 1999, Freedom network 1.0 architecture and protocols
0, Anonymous Remailer
0, The Anonvmizer
guan, 2001, A Optimal Strategy for Anonymous Communications, Technical Report TR2002–3–1 Dept of Computer Science Texas A&M University
syverson, 2000, Onion Routing Access Configuration, DISCEX 2000 Proceedings of the DARPA Information Survivability Conference and Exposition, 34
waidner, 1989, Unconditional Sender and Recipient Un-traceability in Spite of Active Attacks, EUROCRYPT'89
2001, Anton Stiglic, Personal Communication, [email protected], Zero-Knowledge Systems Inc
0, Zero-knowledge systems
wright, 2002, An Analysis of the Degradation of Anonymous Protocols, ISOC Symposium on Network and Distributed System Security (NDSS 2002)