2011 IEEE International Conference on Communications (ICC) 2011
DOI: 10.1109/icc.2011.5962451
|View full text |Cite
|
Sign up to set email alerts
|

Netshuffle: Improving Traffic Trace Anonymization through Graph Distortion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…Further, only packets belonging to an unmapped edge need to be buffered allowing improved throughput as more mappings are made. From our results in [1], we concluded that simply separating the traffic into two decks, one containing small edges, and the other containing medium and large edges, results in significant reduction in the damage done to the empirical value of the traffic. Thus, in our current investigation, we again created a two-deck model by separating the set so that the extremely low traffic edges and heavy hitters do not mix.…”
Section: Real-time Netshufflementioning
confidence: 84%
See 4 more Smart Citations
“…Further, only packets belonging to an unmapped edge need to be buffered allowing improved throughput as more mappings are made. From our results in [1], we concluded that simply separating the traffic into two decks, one containing small edges, and the other containing medium and large edges, results in significant reduction in the damage done to the empirical value of the traffic. Thus, in our current investigation, we again created a two-deck model by separating the set so that the extremely low traffic edges and heavy hitters do not mix.…”
Section: Real-time Netshufflementioning
confidence: 84%
“…In our first endeavor, we proposed Netshuffle [1], where we demonstrated that the underlying graph structure, present in network traffic traces as a residue of the point-to-point communications of the IP protocol, remains undisturbed by normal anonymization techniques. As a result, attackers can exploit this graph structure by mapping real-life communications (edges) to the traffic trace and thus identifying two endhosts (nodes).…”
Section: Netshuffle: the Flashbackmentioning
confidence: 99%
See 3 more Smart Citations