Provable Anonymity for Networks of Mixes

  • Marek Klonowski
  • Mirosław Kutyłowski
Conference paper

DOI: 10.1007/11558859_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3727)
Cite this paper as:
Klonowski M., Kutyłowski M. (2005) Provable Anonymity for Networks of Mixes. In: Barni M., Herrera-Joancomartí J., Katzenbeisser S., Pérez-González F. (eds) Information Hiding. IH 2005. Lecture Notes in Computer Science, vol 3727. Springer, Berlin, Heidelberg

Abstract

We analyze networks of mixes used for providing untraceable communication. We consider a network consisting of k mixes working in parallel and exchanging the outputs – which is the most natural architecture for composing mixes of a certain size into networks able to mix a larger number of inputs at once. We prove that after \(\mathcal{O}\)(1) rounds the network considered provides a fair level of privacy protection for any number of messages n. Number of required rounds does not dependent on number of mixes provided that nk2 . No mathematical proof of this kind has been published before. We show that if at least one of server is corrupted we need substantially more rounds to meet the same requirements of privacy protection.

Keywords

anonymity mix network Markov chain rapid mixing coupling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Marek Klonowski
    • 1
  • Mirosław Kutyłowski
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of TechnologyWrocławPoland

Personalised recommendations