2. When the arrival probabilities of the general multiuser system can be expressed as a rational fraction k/2ⁿ for some fixed n, this convergence rate is shown to be achievable. The anonymity analysis is extended to a general network of mixes connecting the sources to a common destination, where the source anonymity achievable on the destination link is shown to be lower bounded by a weighted sum of the anonymity achievable by each individual mix.">

Anonymity of Memory-Limited Chaum Mixes Under Timing Analysis: An Information Theoretic Perspective (original) (raw)

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2026 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.