Cryptology ePrint Archive: Report 2008/365

Entropy Bounds for Traffic Confirmation

Luke O'Connor

Abstract: Consider an open MIX-based anonymity system with $N$ participants and a batch size of $b$. Assume a global passive adversary who targets a given participant Alice with a set ${\cal R}_A$ of $m$ communicating partners. Let $H( {\cal R}_A \mid {\cal B}_t)$ denote the entropy of ${\cal R}_A$ as calculated by the adversary given $t$ message sets (MIX batches) where Alice is a sender in each message set. Our main result is to express the rate at which the anonymity of Alice (as measured by ${\cal R}_A$) degrades over time as a function of the main parameters $N$, $b$ and $m$.

Category / Keywords: foundations /

Publication Info: Unpublished

Date: received 24 Aug 2008, last revised 21 Oct 2008

Contact author: lukejamesoconnor at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20081021:151619 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]