Evaluation of anonymity providing techniques using queuing theory

Abstract

In our work we use queuing theory both for security (i.e. anonymity) and performance analysis. A well-known anonymity technique, the MIX method, which is the basis of most of today's deployments, is the object of our investigation. We show shortcomings and problems in the MIX method and suggest possible workarounds. Our investigation reveals the level of security of 3 MIX based systems and their performance characteristics on the Internet.