On the anonymity of Chaum mixes
Venkitasubramaniam, P.
Anantharam, V.
Electr. & Comput. Eng., Cornell Univ., Ithaca, NY;
This paper appears in: Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Publication Date: 6-11 July 2008
On page(s): 534-538
Location: Toronto, ON,
ISBN: 978-1-4244-2256-2
INSPEC Accession Number: 10156388
Digital Object Identifier: 10.1109/ISIT.2008.4595043
Current Version Published: 2008-08-08
Abstract
The information-theoretic analysis of Chaum mixing under latency constraints is considered. Mixes are relay nodes that collect packets from multiple users and modify packet timings to prevent an eavesdropper from identifying the sources of outgoing packets. In this work, an entropy-based metric of anonymity is proposed to quantify the performance of a mixing strategy under strict delay constraints. Inner and outer bounds on the maximum achievable anonymity are characterized as functions of traffic load and the delay constraint. The bounds are shown to have identical first derivatives at low traffic loads.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
