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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Callado, A., Kamienski, C., Szabo, G., Gero, B., Kelner, J., Fernandes, S., Sadok, D.: A Survey on Internet Traffic Identification. IEEE Communications Surveys & Tutorials 11(3), 37–52 (2009)
Kim, H., Claffy, K., Fomenkov, M., Barman, D., Faloutsos, M., Lee, K.: Internet traffic classification demystified: myths, caveats, and the best practices. In: Proc. of ACM CoNEXT, Madrid, Spain, December 9-12 (2008)
White, A.M., Matthews, A.R., Snow, K.Z., Monrose, F.: Phonotactic Reconstruction of Encrypted VoIP Conversations: Hookt on fon-iks. In: Proc. of the 32nd IEEE Symposium on Security and Privacy, Berkeley, CA, USA, May 22-25 (2011)
Este, A., Gringoli, F., Salgarelli, L.: On the stability of the information carried by traffic flow features at the packet level. ACM SIGCOMM Computer Communication Review 39(3) (2009)
Lim, Y., Kim, H., Jeong, J.: Internet Traffic Classification Demystified: On the Sources of the Discriminative Power. In: Proc. of ACM CoNEXT, Philadelphia, USA (2010)
Wright, C.V., Coull, S.E., Monrose, F.: Traffic Morphing: An Efficient Defense Against Statistical Traffic Analysis. In: Proc. of the 16th Network and Distributed System Security Symposium (NDSS), San Diego, CA, USA, February 8-11 (2009)
Yu, S., Thapngam, T., Wei, S., Zhou, W.: Efficient Web Browsing with Perfect Anonymity Using Page Prefetching. In: Hsu, C.-H., Yang, L.T., Park, J.H., Yeo, S.-S. (eds.) ICA3PP 2010, Part I. LNCS, vol. 6081, pp. 1–12. Springer, Heidelberg (2010)
Hitchcock, F.L.: The distribution of a product from several sources to numerous localities. J. Math. Phys. 20, 224–230 (1941)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)
Maiolini, G., Molina, G., Baiocchi, A., Rizzi, A.: On the fly Application Flows Identification by exploiting K-Means based classifiers. Journal of Information Assurance and Security (2), 142–150 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Iacovazzi, A., Baiocchi, A. (2012). Padding and Fragmentation for Masking Packet Length Statistics. In: Pescapè, A., Salgarelli, L., Dimitropoulos, X. (eds) Traffic Monitoring and Analysis. TMA 2012. Lecture Notes in Computer Science, vol 7189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28534-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-28534-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28533-2
Online ISBN: 978-3-642-28534-9
eBook Packages: Computer ScienceComputer Science (R0)