Embedding information flows into renewal traffic

The secure networking problem of embedding information flows into cover traffic is addressed. When relayed packets must obey a causal delay constraint, this naturally remaps to a matching problem between point processes (here taken as arbitrary renewal processes). The best hiding policy is thus characterized in terms of the maximum fraction of matched points, which is accordingly referred to as embedding capacity. For a broad range of renewal models encountered in practice, we provide a simple analytical formula for the capacity, which depends only on the renewal function of the underlying processes, and further find conditions for capacity-ordering of different types of cover traffic. The results are also tested on real network traces, and a very good match is observed, especially for tight delay constraints.

[1]  Vern Paxson,et al.  Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive Streams by Exploiting Maximum Tolerable Delay , 2002, RAID.

[2]  Dawn Xiaodong Song,et al.  Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds , 2004, RAID.

[3]  Lang Tong,et al.  Detection of Information Flows , 2008, IEEE Transactions on Information Theory.

[4]  Jie Gao,et al.  Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  I. B. Russak,et al.  Manifolds , 2019, Spacetime and Geometry.

[6]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[7]  J. Radok,et al.  Singular Integral Equations: Boundary problems of functions theory and their applications to mathematical physics , 1977 .

[8]  Bruce Hajek,et al.  Hiding traffic flow in communication networks , 1992, MILCOM 92 Conference Record.

[9]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[10]  W. Rudin.  Real and complex analysis , 1968 .

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

[12]  Lang Tong,et al.  Anonymous Networking Amidst Eavesdroppers , 2008, IEEE Transactions on Information Theory.

[13]  Bernd Wilfling,et al.  A sufficient condition for Lorenz ordering , 1996 .

[14]  Lang Tong,et al.  The Embedding Capacity of Information Flows Under Renewal Traffic , 2011, IEEE Transactions on Information Theory.