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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abe, M.: Universally verifiable Mix-net with verification work independent of the number of Mix-servers. IEICE Trans. Fundamentals E83-A (2000) 1431–1440
Anonymizer: http://www.anonymizer.com/
Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. CACM 24 (1981) 84–88
Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptography 1 (1988) 65–75
Desmedt, Y., Kurosawa, K.: How to break a practical MIX and design a new one. EUROCRYPT 2000. Vol. 1807 of LNCS, Springer-Verlag (2000) 557–572
Pfitzmann, A.: A switched/broadcast ISDN to decrease user observability. Proc. of 1984 International Zurich Seminar on Digital Communications, Applications of Coding, Channel Coding and Secrecy Coding. (1984) 183–190
Reiter, M.K., Rubin, A.D.: Crowds: anonymity for web transactions. ACM Trans. Information and System Security 1 (1998) 66–92
Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and Onion routing. IEEE Symposium on Security and Privacy. (1997) 44–54
Mitomo, M., Kurosawa, K.: Attack for flash MIX. ASIACRYPT 2000. Vol. 1976 of LNCS, Springer-Verlag (2000) 192–204
Syverson, P.F., Tsudik, G., Reed, M.G., Landwehr, C.E.: Towards an analysis of onion routing security. Workshop on Design Issues in Anonymity and Unobservability. (2000)
Wright, M., Adler, M., Levine, B.N., Shields, C.: An analysis of the degradation of anonymous protocols. Network and Distributed System Security Symposium. (2002)
Dingledine, R., Freedman, M.J., Hopwood, D., Molnar, D.: A reputation system to increase MIX-net reliability. Information Hiding: 4th International Workshop, IHW 2001. Volume 2137 of LNCS. (2001) 126–140
Dingledine, R., Syverson, P.: Reliable MIX cascade networks through reputation. Sixth International Financial Cryptography Conference (FC 2002). (2002)
International Organization of Standardization (ISO): International standard ISO/IEC 15408 (1999) Technically identical to Common Criteria version 2.1.
Garey, M.R., Johnson, D.S.: Computers and Intractability — A Guide to the Theory of NP-completeness. W. H. Freeman and Co. (1979)
Winick, J., Jamin, S.: Inet-3.0: Internet topology generator. Technical Report CSE-TR-456-02, University of Michigan (2002)
Harary, F.: Graph Theory. Perseus Publishing (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kitazawa, S., Soshi, M., Miyaji, A. (2003). Evaluation of Anonymity of Practical Anonymous Communication Networks. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_2
Download citation
DOI: https://doi.org/10.1007/3-540-45067-X_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40515-3
Online ISBN: 978-3-540-45067-2
eBook Packages: Springer Book Archive