Padding and fragmentation for masking packet length statistics

Authors:
Alfonso Iacovazzi;Andrea Baiocchi
Affiliations:
Dept. of Information Engineering, Electronics and Telecommunications (DIET), University of Roma Sapienza, Roma, Italy;Dept. of Information Engineering, Electronics and Telecommunications (DIET), University of Roma Sapienza, Roma, Italy
Venue:
TMA'12 Proceedings of the 4th international conference on Traffic Monitoring and Analysis
Year:
2012

Citing 6
Cited 0

Internet traffic classification demystified: myths, caveats, and the best practices

CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
On the stability of the information carried by traffic flow features at the packet level

ACM SIGCOMM Computer Communication Review
Internet traffic classification demystified: on the sources of the discriminative power

Proceedings of the 6th International COnference
Phonotactic Reconstruction of Encrypted VoIP Conversations: Hookt on Fon-iks

SP '11 Proceedings of the 2011 IEEE Symposium on Security and Privacy
Efficient web browsing with perfect anonymity using page prefetching

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
A Survey on Internet Traffic Identification

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

We aim at understanding if and how complex it is to obfuscate traffic features exploited by statistical traffic flow classification tools. We address packet length masking and define perfect masking as an optimization problem, aiming at minimizing overhead. An explicit efficient algorithm is given to compute the optimum masking sequence. Numerical results are provided, based on measured traffic traces. We find that fragmenting requires about the same overhead as padding does.