Padding and Fragmentation for Masking Packet Length Statistics

  • Alfonso Iacovazzi
  • Andrea Baiocchi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7189)

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.

Keywords

Packet Length Application Protocol Packet Fragmentation Distribute System Security IEEE Communication Survey 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Hitchcock, F.L.: The distribution of a product from several sources to numerous localities. J. Math. Phys. 20, 224–230 (1941)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    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)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • Alfonso Iacovazzi
    • 1
  • Andrea Baiocchi
    • 1
  1. 1.Dept. of Information Engineering, Electronics and Telecommunications (DIET)University of Roma SapienzaRomaItaly

Personalised recommendations