An HMM Approach to Anonymity Analysis of Continuous Mixes

  • Authors:
  • Zhen Ling;Junzhou Luo;Ming Yang

  • Affiliations:
  • School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China

  • Venue:
  • Advanced Web and NetworkTechnologies, and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the increasing requirement of privacy protection, various anonymity communication systems are designed and implemented. However, in the current communication infrastructure, traffic data can be gathered at moderate cost by adversary. Based on the traffic data, they can easily correlate the input links with output links by applying powerful traffic analysis techniques. In this paper, a Hidden Markov Model (HMM) approach is proposed to analyze one of the important anonymity systems, continuous mixes, which individually delays messages instead of processing batch messages. This approach consists of two parts, arrival traffic model and departure traffic model based on HMM, which capture the mean rates of the arrival and departure messages respectively. By using this approach to analyze anonymity of continuous mixes, a successful anonymity analysis can not be guaranteed, especially while the arrival traffic rate is greater than the departure traffic rate. In order to achieve better anonymity results, a new countermeasure is proposed, which inserts a minimum number of dummy traffic flows to ensure better anonymity of continuous mixes and protects users against various traffic analyses.