Please use this identifier to cite or link to this item:
|Title:||Dependent link padding algorithms for low latency anonymity systems|
Traffic analysis attack
|Citation:||Wang, W.,Motani, M.,Srinivasan, V. (2008). Dependent link padding algorithms for low latency anonymity systems. Proceedings of the ACM Conference on Computer and Communications Security : 323-332. ScholarBank@NUS Repository. https://doi.org/10.1145/1455770.1455812|
|Abstract:||Low latency anonymity systems are susceptive to traffic analyaia attacka. 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 timinimuni covering traffic rate is then studied via analysis and simulation. When user flows are Poisson processes with the same sending rate, the rninimlsm covering traffic rate to provide full anonymity to an 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. Copyright 2008 ACM.|
|Source Title:||Proceedings of the ACM Conference on Computer and Communications Security|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 11, 2019
checked on Nov 9, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.