000199359 001__ 199359
000199359 005__ 20180913062524.0
000199359 020__ $$a978-1-4799-1321-3
000199359 02470 $$2ISI$$a000330643200020
000199359 037__ $$aCONF
000199359 245__ $$aExploiting Common Randomness: a Resource for Network Secrecy
000199359 260__ $$aNew York$$bIeee$$c2013
000199359 269__ $$a2013
000199359 300__ $$a5
000199359 336__ $$aConference Papers
000199359 520__ $$aWe 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.
000199359 700__ $$aCzap, Laszlo
000199359 700__ $$aPrabhakaran, Vinod M.
000199359 700__ $$0241953$$aDiggavi, Suhas$$g157468
000199359 700__ $$0240968$$aFragouli, Christina$$g161832
000199359 7112_ $$aIEEE Information Theory Workshop (ITW)
000199359 773__ $$t2013 Ieee Information Theory Workshop (Itw)
000199359 909C0 $$0252185$$pARNI$$xU11353
000199359 909C0 $$0252133$$pLICOS$$xU10880
000199359 909CO $$ooai:infoscience.tind.io:199359$$pconf
000199359 917Z8 $$x114979
000199359 937__ $$aEPFL-CONF-199359
000199359 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000199359 980__ $$aCONF