Abstract
In the paper we shall evaluate various aspects of anonymity properties afforded by practical anonymous communication networks. For that purpose, first we propose two novel anonymity metrics for practical anonymous communication networks. Next we shall discuss whether or not deterministic protocols can provide anonymity efficiently in terms of computational complexity. Unfortunately, we can show that it is diffi- cult to build efficient anonymous networks only by means of deterministic approaches. We also run simulation experiments and discuss the results. © 2003 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Kitazawa, S., Soshi, M., & Miyaji, A. (2003). Evaluation of anonymity of practical anonymous communication networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2727 LNCS, pp. 13–26). https://doi.org/10.1007/3-540-45067-X_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
