SECURING WEB-BASED APPLICATIONS WITH PRIVACY PRESERVING TRAFFIC PADDING

Now-a-days, Web-based applications are gaining great reputation as they require less client side resources and are easier to deliver and maintain. But they also have new security and privacy challenges. The encrypted traffic of many popular Web applications may actually disclose highly sensitive data due to the side channel attack, and consequently lead to serious breaches of user privacy. An eavesdropper potentially identifies the applications’ internal state transitions and the corresponding users’ inputs based on packets’ sizes and/or timing analysis. The existing solution such as random padding and packet size rounding were proven to incur prohibitive overhead but were failing to assure sufficient privacy requirement. For preventing such side channel attack is to pad packets such that each packet will no longer map to a unique input. Padding packets results in additional communication and processing overhead. One extreme cases to pad all packets to the identical size, namely, maximizing. In the proposed system a similarity has been identified between the privacy preserving traffic padding (PPTP) issue and well studied problem privacy preserving data publishing (PPDP). Based on such similarities PPTP model encompassing the privacy requirements, padding costs, and padding methods, and then formulate problems under different application scenarios. These algorithms have been designed for solving the PPTP problems in polynomial time with acceptable overhead. Through experiments an attempt had been made to increases the effectiveness and efficiency of these algorithms than the existing solutions using the real world search engine.