A New Statistical Hitting Set Attack on Anonymity Protocols

A new Statistical Hitting Set attack (SHS-attack) is presented, using the principle of statistical disclosure attack for reference, to effectively link senders and receivers of an anonymous system. We analyze previous work and some associated bottlenecks of statistical attack. Thereafter we design and implement an algorithm which has been proved computationally efficient. Compared with the previous SHS-attack, ours improves the accuracy of solution while all the recipients congregate in a small group, and effectively estimates the number of victim´s recipients which is hard to get in real-world. The simulations show that our attack is highly effective at compromising the end-to-end anonymity of the system.