@inproceedings{6691232,
 abstract = {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.},
 author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},
 booktitle = {Information Theory Workshop (ITW), 2013 IEEE},
 doi = {10.1109/ITW.2013.6691232},
 file = {:papers:common_randomness.pdf},
 month = {Sept},
 pages = {1-5},
 tags = {conf,WiNetSec,IT},
 title = {Exploiting common randomness: A resource for network secrecy},
 type = {4},
 year = {2013}
}

{"_id":"tcYZxqNkzfBPHc6iW","bibbaseid":"czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013","author_short":["Czap, L.","Prabhakaran, V.","Diggavi, S.","Fragouli, C."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"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.","author":[{"propositions":[],"lastnames":["Czap"],"firstnames":["L."],"suffixes":[]},{"propositions":[],"lastnames":["Prabhakaran"],"firstnames":["V.M."],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["S."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]}],"booktitle":"Information Theory Workshop (ITW), 2013 IEEE","doi":"10.1109/ITW.2013.6691232","file":":papers:common_randomness.pdf","month":"Sept","pages":"1-5","tags":"conf,WiNetSec,IT","title":"Exploiting common randomness: A resource for network secrecy","year":"2013","bibtex":"@inproceedings{6691232,\n abstract = {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.},\n author = {Czap, L. and Prabhakaran, V.M. and Diggavi, S. and Fragouli, C.},\n booktitle = {Information Theory Workshop (ITW), 2013 IEEE},\n doi = {10.1109/ITW.2013.6691232},\n file = {:papers:common_randomness.pdf},\n month = {Sept},\n pages = {1-5},\n tags = {conf,WiNetSec,IT},\n title = {Exploiting common randomness: A resource for network secrecy},\n type = {4},\n year = {2013}\n}\n\n","author_short":["Czap, L.","Prabhakaran, V.","Diggavi, S.","Fragouli, C."],"key":"6691232","id":"6691232","bibbaseid":"czap-prabhakaran-diggavi-fragouli-exploitingcommonrandomnessaresourcefornetworksecrecy-2013","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib","dataSources":["ZyBHKCcCyS7Qk9n3w","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"],"keywords":[],"search_terms":["exploiting","common","randomness","resource","network","secrecy","czap","prabhakaran","diggavi","fragouli"],"title":"Exploiting common randomness: A resource for network secrecy","year":2013}