An analysis of forwarding mechanism in crowds
Conference Paper
Overview
Additional Document Info
View All
Overview
abstract
The mechanism of forwarding request plays the most important role in Crowds anonymous communication protocol. On one hand, it hides the identity of the request initiator against the responder, the participants in protocol, and eavesdroppers. On the other hand, it causes additional latency on communication and payload on participants in the protocol. In this paper, we investigate the influence of the forwarding mechanism with respect to the performance and the security in Crowds. Different from the previous approaches, our analysis focuses on the length of forwarding paths, and is independent of the underlying length control strategy. In the study of system performance, we consider the participant payload in Crowds and prove that the expected participant payload is equal to the expected length of forwarding paths. Applying this result to the currently used length control strategy in Crowds, we derive that the expected participant payload in Crowds is 1/(1 - Pf) + 1, where Pf is the forwarding probability in Crowds. This improves Reiter and Rubin's original result and demonstrates that the participant payload in Crowds is entirely independent of the size of Crowds protocol. Thus, Crowds has a very nice scalability property. In the study of security, we investigate the number of rounds of attack to identify the request initiator with high probability, and show that it is not affected significantly by the maximum length of forwarding paths. Therefore, in order to improve the system performance (such as participant payload and communication latency) without significantly affecting the system security, length control strategies that shorten the forwarding paths can be considered.
name of conference
Proceedings of IEEE International Conference on Communications, ICC 2003, Anchorage, Alaska, USA, 11-15 May, 2003
