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.


Published in:
ITW
Presented at:
IEEE Information Theory Workshop (ITW), Sevilla, Spain, September 9-13, 2013
Year:
2013
Laboratories:




 Record created 2013-08-26, last modified 2018-03-17

n/a:
itw13_full - Download fulltextPDF
itw13_final - Download fulltextPDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)