Secure cascade channel synthesis

We investigate channel synthesis in a cascade setting where nature provides an iid sequence Xn at node 1. Node 1 can send a message at rate R1 to node 2 and node 2 can send a message at rate R2 to node 3. Additionally, all 3 nodes share bits of common randomness at rate R0. We want to generate sequences Y n and Zn along nodes in the cascade such that (Xn, Y n, Zn) appears to be appropriately correlated and iid even to an eavesdropper who is cognizant of the messages being sent. We characterize the optimal tradeoff between the amount of common randomness used and the required rates of communication. We also solve the problem for arbitrarily long cascades and provide an inner bound for cascade channel synthesis without an eavesdropper.

[1]  Stephen P. Boyd,et al.  Future directions in control in an information-rich world , 2003 .

[2]  Venkat Anantharam,et al.  Generating dependent random variables over networks , 2011, 2011 IEEE Information Theory Workshop.

[3]  A. Winter Compression of sources of probability distributions and density operators , 2002, quant-ph/0208131.

[4]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[5]  Paul W. Cuff Using a secret key to foil an eavesdropper , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  Andreas J. Winter,et al.  The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels , 2009, IEEE Transactions on Information Theory.

[7]  Haim H. Permuter,et al.  Coordination Capacity , 2009, IEEE Transactions on Information Theory.

[8]  Paul W. Cuff A Framework for Partial Secrecy , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[9]  Paul W. Cuff,et al.  Communication requirements for generating correlated random variables , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  Amin Gohari,et al.  Channel Simulation via Interactive Communications , 2012, IEEE Transactions on Information Theory.

[11]  Andreas J. Winter,et al.  Secret, public and quantum correlation cost of triples of random variables , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[12]  Paul W. Cuff,et al.  Distributed Channel Synthesis , 2012, IEEE Transactions on Information Theory.

[13]  Jörg Kliewer,et al.  Strong coordination with polar codes , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Matthieu R. Bloch,et al.  Secrecy from Resolvability , 2011, ArXiv.

[15]  Paul W. Cuff State Information in Bayesian Games , 2009, ArXiv.

[16]  Aaron D. Wyner,et al.  The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.

[17]  Amin Gohari,et al.  Coordination via a relay , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[18]  Amin Gohari,et al.  Achievability Proof via Output Statistics of Random Binning , 2012, IEEE Transactions on Information Theory.

[19]  Haim H. Permuter,et al.  Capacity of Coordinated Actions , 2007, 2007 IEEE International Symposium on Information Theory.

[20]  Amin Gohari,et al.  Secure channel simulation , 2012, 2012 IEEE Information Theory Workshop.