On Blending Attacks for Mixes with Memory

Blending attacks are a general class of traffic-based attacks, exemplified by the (n − 1)-attack. Adding memory or pools to mixes mitigates against such attacks, however there are few known quantitative results concerning the effect of pools on blending attacks. In this paper we give a precise analysis of the number of rounds required to perform a blending attack for the pool mix, timed pool mix, timed dynamic pool mix and the binomial mix.

• Type: Conference
• Year: 2005
• Where: IH
• Authors: Luke O'Connor
• Keywords: Blending Attack, IH 2005, Pool Mix, Traffic-based Attacks