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.


Publié dans:
2013 Ieee Information Theory Workshop (Itw)
Présenté à:
IEEE Information Theory Workshop (ITW)
Année
2013
Publisher:
New York, Ieee
ISBN:
978-1-4799-1321-3
Laboratoires:




 Notice créée le 2014-06-02, modifiée le 2018-09-13


Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)