An Experimental Study and Analysis of Crowds based Anonymity

Crowds provides probable innocence in the face of large number of attackers. In this paper, we present the experimental results of the behavior of Crowds in a dense network. We begin by providing a brief description about Crowds followed by the experimental environment in which the simulations were carried out. We then present the results of our simulations and the inferences made out of them. We will also show that the obtained results match the predictions made by others.

[1]  Jianer Chen,et al.  The cost of becoming anonymous: on the participant payload in Crowds , 2004, Inf. Process. Lett..

[2]  Bart Preneel,et al.  Towards Measuring Anonymity , 2002, Privacy Enhancing Technologies.

[3]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[4]  Vladimiro Sassone,et al.  Trust in Crowds: Probabilistic Behaviour in Anonymity Protocols , 2010, TGC.

[5]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[6]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1998, IEEE J. Sel. Areas Commun..

[7]  Yves Deswarte,et al.  From DC-Nets to pMIXes: Multiple Variants for Anonymous Communications , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).