Probabilistic Treatment of MIXes to Hamper Traffic Analysis
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Mutual Anonymity Protocols for Hybrid Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The cost of becoming anonymous: on the participant payload in crowds
Information Processing Letters
An Efficient Anonymity Protocol for Grid Computing
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Towards a framework for connection anonymity
SAICSIT '05 Proceedings of the 2005 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
Multiagent and Grid Systems
Adaptive trust-based anonymous network
International Journal of Security and Networks
Building trust in peer-to-peer systems: a review
International Journal of Security and Networks
Survey on anonymous communications in computer networks
Computer Communications
Towards a taxonomy of wired and wireless anonymous networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Anonymity analysis of P2P anonymous communication systems
Computer Communications
SAS: a scalar anonymous communication system
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
An efficient anonymous scheme for mutual anonymous communications
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Performance modelling of anonymity protocols
Performance Evaluation
| Hi-index | 0.00 |
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 strategythat maximizes the anonymity degree of a system. Our analytical and experimental data shows that the anonymity degree may not always monotonically increase as the lengthof communication paths increase. We also found that variable path-length strategies perform better than fixed-length strategies.