On-Demand Link Padding in Traffic Anonymizing

We consider the problem of using artificially generated cover traffic to hide the network paths used by an application against an adversarial observer who can monitor network traffic and perform traffic analysis. We propose that on-demand link padding be used on top of existing traffic anonymizing infrastructures such as those described in the Onion Routing Project or in the ANON Project. In on-demand link padding, cover traffic is generated dynamically only when real traffic is present. Moreover, the bandwidth usage is economical because we only generate a small amount of cover traffic above real traffic. We describe two types of on-demand link padding schemes and evaluate their performance by simulation. We report our findings based on the simulation results and quantify potential trade-offs in configuring a couple of important parameters. Finally, we provide a strategy for mitigating the potential problem in face of lost or corrupted control packets, to which the traditional recovery solutions based on packet retransmission are inappropriate for performance considerations.

[1]  Deborah Estrin,et al.  Advances in network simulation , 2000, Computer.

[2]  H. T. Kung,et al.  Design and analysis of an IP-Layer anonymizing infrastructure , 2003, Proceedings DARPA Information Survivability Conference and Exposition.

[3]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[4]  Tom Lyche,et al.  Curves and Surfaces , 2014, Lecture Notes in Computer Science.

[5]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[6]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[7]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1998, IEEE J. Sel. Areas Commun..

[8]  Von Seggern,et al.  CRC standard curves and surfaces , 1993 .

[9]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[10]  Jean-François Raymond,et al.  Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[11]  Moni Naor,et al.  Non-malleable cryptography , 1991, STOC '91.