Anonymity of networks of mixes
Venkat Anantharam and Parvathinathan Venkitasubramaniam1
National Science Foundation CCF-0500023, National Science Foundation CCF-0635372, National Science Foundation CNS-0627161 and National Science Foundation CCF-0728872
Mixes are entities in networks that randomize the departures of packets from different flows arriving at them, in order to obfuscate the connection between the arrival and departure links of flows. They aim to provide anonymity of the sources of a flows in networks.
We investigate optimal strategies for delay-constrained mixes, with anonymity measured in information-theoretic terms. Upper and lower bounds are provided, which are exact in light traffic for linear mix networks.
- On the anonymity of Chaum mixes. Venkitasubramaniam, P.; Anantharam, V.; Information Theory, 2008. ISIT 2008. IEEE International Symposium on 6-11 July 2008 Page(s):534 - 538.