Network Watermarking Model Based on Optimization Theory

In order to compare the efficiency of different network watermarking systems and help designing a more efficient system by finding capacity bounds and judging robustness and invisibility level, a network watermarking model based on optimization theory is proposed. Firstly, it covers attack effects on network watermarking by inducing network transformation problems. Secondly, the proposed model establishes unified analysis criteria for robustness and invisibility, which helps to divide robustness and invisibility into three levels. Besides, combined with different attack intensities, it can effectively measure robustness and invisibility by goodness-to-fit test. Thirdly, the proposed model converts robustness, invisibility and network transformation problems into different constraints. Therefore, the maximum capacity under different conditions can be figured out by layered superposing corresponding constraints. At last, experimental results verifies the correctness and feasibility of the proposed model.

[1]  Xuemin Shen,et al.  An Efficient Privacy-Preserving Scheme against Traffic Analysis Attacks in Network Coding , 2009, IEEE INFOCOM 2009.

[2]  Nikita Borisov,et al.  RAINBOW: A Robust And Invisible Non-Blind Watermark for Network Flows , 2009, NDSS.

[3]  Nikita Borisov,et al.  On the channel capacity of network flow watermarking , 2009 .

[4]  George Danezis,et al.  Low-cost traffic analysis of Tor , 2005, 2005 IEEE Symposium on Security and Privacy (S&P'05).

[5]  D. Speers,et al.  Duplex Real-Time Reverse Transcriptase PCR Assays for Rapid Detection and Identification of Pandemic (H1N1) 2009 and Seasonal Influenza A/H1, A/H3, and B Viruses , 2010, Journal of Clinical Microbiology.

[6]  Elisa Bertino,et al.  A Provenance Based Mechanism to Identify Malicious Packet Dropping Adversaries in Sensor Networks , 2011, 2011 31st International Conference on Distributed Computing Systems Workshops.

[7]  K. Chung,et al.  Limit Distributions for Sums of Independent Random Variables. , 1955 .

[8]  Prateek Mittal,et al.  Stealthy traffic analysis of low-latency anonymous communication using throughput fingerprinting , 2011, CCS '11.

[9]  Tatu Ylönen,et al.  The Secure Shell (SSH) Protocol Architecture , 2006, RFC.

[10]  Mohamed Ali Kâafar,et al.  Digging into Anonymous Traffic: A Deep Analysis of the Tor Anonymizing Network , 2010, 2010 Fourth International Conference on Network and System Security.

[11]  Vitaly Shmatikov,et al.  The Parrot Is Dead: Observing Unobservable Network Communications , 2013, 2013 IEEE Symposium on Security and Privacy.

[12]  Xiaogang Wang,et al.  A Double Interval Centroid-Based Watermark for network flow traceback , 2010, The 2010 14th International Conference on Computer Supported Cooperative Work in Design.

[13]  B. Gnedenko,et al.  Limit Distributions for Sums of Independent Random Variables , 1955 .

[14]  Nikita Borisov,et al.  Multi-Flow Attacks Against Network Flow Watermarks: Analysis and Countermeasures , 2012, ArXiv.

[15]  Thomas Engel,et al.  Website fingerprinting in onion routing based anonymization networks , 2011, WPES.