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. © 2012 Springer-Verlag.
Padding and fragmentation for masking packet length statistics / Iacovazzi, Alfonso; Baiocchi, Andrea. - 7189 LNCS(2012), pp. 85-88. ((Intervento presentato al convegno 4th International Workshop on Traffic Monitoring and Analysis, TMA 2012 tenutosi a Vienna nel 12 March 2012 through 12 March 2012. - LECTURE NOTES IN COMPUTER SCIENCE. [10.1007/978-3-642-28534-9_9].
Padding and fragmentation for masking packet length statistics
IACOVAZZI, ALFONSO;BAIOCCHI, Andrea
2012
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. © 2012 Springer-Verlag.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
