Evaluation of anonymity of practical anonymous communication networks

Authors:
Shigeki Kitazawa;Masakazu Soshi;Atsuko Miyaji
Affiliations:
Mitsubishi Electric Corporation Information Technology R&D Center, Kanagawa, Japan;School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan;School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan
Venue:
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Year:
2003

Citing 8
Cited 0

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Crowds: anonymity for Web transactions

ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Reputation System to Increase MIX-Net Reliability

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Anonymous Connections and Onion Routing

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
How to break a practical MIX and design a new one

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Reliable MIX cascade networks through reputation

FC'02 Proceedings of the 6th international conference on Financial cryptography

Quantified Score

Hi-index	0.00

Visualization

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 difficult to build efficient anonymous networks only by means of deterministic approaches. We also run simulation experiments and discuss the results.