Paper 2008/365 Original: eprint.iacr.org/2008/365 ↗
Entropy Bounds for Traffic Confirmation
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$.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2008-10-21: last updated
- 2008-08-27: published
- Short URL
- https://ia.cr/2008/365
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/365,
author = {Luke O'Connor},
title = {Entropy Bounds for Traffic Confirmation},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/365},
year = {2008},
url = {https://eprint.iacr.org/2008/365}
}