Decreased Forwarding Probability Based Length Control Strategy of Crowds
Jianer Chen · Mini-micro Systems · 2005
In Crowds, an anonymous browsing system, rerouting paths were established basing on a fixed forwarding probability to forward requests among hosts to hide the identity of communication initiators. The length of rerouting paths became too long if the forwarding probability adopted is high, which results in high communication delay and participant payload. In this paper, a new length control strategy basing on a decreased forwarding probability is proposed for controlling the length of rerouting path. Firstly, it is analyzed theoretically that the number of rounds for collaborators to compromise the system by predecessor attack is determined mainly by the number of collaborators in the system, while effected by the length of rerouting path slightly. Based on the analysis, the decreased forwarding probability based length control strategy is proposed for establishing shorter rerouting paths. Simulation result shows that Crowds system can be improved effectively in performance with the new strategy, while keep the anonymity at the same level.