Dependent link padding algorithms for low latency anonymity systems

Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analysis attacks while providing a strict delay bound. The covering traffic generated by our scheme uses the minimum sending rate to provide full anonymity for a given set of flows. The relationship between user anonymity and the minimum covering traffic rate is then studied via analysis and simulation. When user flows are Poisson processes with the same sending rate, the minimum covering traffic rate to provide full anonymity to m users is O(log m). For Pareto traffic, we show that the rate of the covering traffic converges to a constant when the number of flows goes to infinity. Finally, we use real Internet trace files to study the behavior of our algorithm when user flows have different rates. Categories and Subject Descriptors C.2.0 [Computer-Communication Networks]: General

• Type: Conference
• Year: 2008
• Where: CCS
• Authors: Wei Wang 0002, Mehul Motani, Vikram Srinivasan
• Keywords: Anonymity, Anonymity Systems, CCS 2008, Security Privacy, Traffic Analysis Attack