k-indistinguishable traffic padding in web applications

  • Authors:

  • Wen Ming Liu;Lingyu Wang;Kui Ren;Pengsu Cheng;Mourad Debbabi

  • Affiliations:

  • Concordia Institute for Information Systems Engineering, Concordia University, Canada;Concordia Institute for Information Systems Engineering, Concordia University, Canada;Department of Electrical and Computer Engineering, Illinois Institute of Technology;Concordia Institute for Information Systems Engineering, Concordia University, Canada;Concordia Institute for Information Systems Engineering, Concordia University, Canada

  • Venue:
  • PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

While web-based applications are becoming increasingly ubiquitous, they also present new security and privacy challenges. In particular, recent research revealed that many high profile Web applications might cause private user information to leak from encrypted traffic due to side-channel attacks exploiting packet sizes and timing. Moreover, existing solutions, such as random padding and packet-size rounding, are shown to incur prohibitive cost while still not ensuring sufficient privacy protection. In this paper, we propose a novel k-indistinguishable traffic padding technique to achieve the optimal tradeoff between privacy protection and communication and computational cost. Specifically, we first present a formal model of the privacy-preserving traffic padding (PPTP). We then formulate PPTP problems under different application scenarios, analyze their complexity, and design efficient heuristic algorithms. Finally, we confirm the effectiveness and efficiency of our algorithms by comparing them to existing solutions through experiments using real-world Web applications.