Exploiting Common Randomness: a Resource for Network Secrecy
We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate limited common random source they both observe. The communication channels are erasure channels with strictly causal channel state information of the destination available publicly. A passive adversary is present in the system eavesdropping on any one of the channels. We design a linear scheme that ensures secrecy against the eavesdropper. By deriving an outer bound for the problem we prove that the scheme is optimal in certain special cases.
itw13_final.pdf
openaccess
125.67 KB
Adobe PDF
59edb3785d13bca7c7d803cac9ce8d28
itw13_full.pdf
openaccess
282.9 KB
Adobe PDF
82786ba1a20756296c6b11eccb49d5cb