An efficient and reliable anonymous solution for a self-organized P2P network
IPOM'07 Proceedings of the 7th IEEE international conference on IP operations and management
SAS: a scalar anonymous communication system
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.00 |
Host-based rerouting mechanism is a routing schemethat stores and forwards data in application layer. Withthis, users can communicate in a indirect way. Thus, identityinformation such as IP addresses can be effectively hiddenagainst eavesdropper. In anonymous communicationsystems, such as Mixes, Onion Routing, and Crowds, thismechanism is adopted to provide anonymity. This mechanism,however, can result in extra overhead in performancesuch as communication delay and participant payload,which may affect the applications of anonymous communicationsystems. In this paper, we study quantitativelythe participant payload induced by host-based reroutingmechanisms. A probability formula for calculating the participantpayload is derived, which shows that the participantpayload is determined by the number of participants,the number of rerouting paths, and the probability distributionof the length of rerouting paths. Applying this formulato the practical anonymous communication system, Crowds,we get immediately the precise expected participant payload,which significantly improves Reiter and Rubin's originalanalysis and demonstrates that the participant payloadin Crowds remains a constant and independent of the variationof the number of participants in Crowds. Simulationresults are presented to testify our theoretical analysis.