Towards a Theory of Anonymous Networking

Date Added: Jul 2009
Format: PDF

The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination nodes, and paths of information flow in the network. One way to achieve such an anonymity is to use mixers. Mixers are nodes that receive packets from multiple sources and change the timing of packets, by mixing packets at the output links, to prevent the eavesdropper from finding sources of outgoing packets. In this paper, the authors consider two simple but fundamental scenarios: double input-single output mixer and double input-double output mixer.