论文信息 - On the channel capacity of network flow watermarking

On the channel capacity of network flow watermarking

We consider the information theoretical capacity of the network flow watermarking problem. Finding capacity bounds of the watermarking problem can lead to compare different watermarking schemes and help in designing more efficient network flow watermarks.

[1] Shlomo Shamai,et al. On the capacity of some channels with channel state information , 1999, IEEE Trans. Inf. Theory.

[2] J. Wolfowitz. Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

[3] Sushil Jajodia,et al. Tracking anonymous peer-to-peer VoIP calls on the internet , 2005, CCS '05.

[4] Douglas S. Reeves,et al. Inter-Packet Delay Based Correlation for Tracing Encrypted Connections through Stepping Stones , 2002, ESORICS.

[5] Douglas S. Reeves,et al. Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays , 2003, CCS '03.

[6] Thomas M. Cover,et al. Elements of Information Theory , 2005 .

[7] Sushil Jajodia,et al. Network Flow Watermarking Attack on Low-Latency Anonymous Communication Systems , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).

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

[9] Todd P. Coleman. A simple memoryless proof of the capacity of the exponential server timing channel , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.