Secret message capacity of erasure broadcast channels with feedback. Czap, L., Prabhakaran, V., Fragouli, C., & Diggavi, S. In Information Theory Workshop (ITW), 2011 IEEE, pages 65-69, Oct, 2011.
abstract   bibtex   
We characterize the secret message capacity of a wiretapped erasure channel where causal channel state information of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generation for the same channel setup. We propose a linear coding scheme that has polynomial encoding/decoding complexity, and prove a converse that shows the optimality of our scheme. Our work also demonstrates the value of causal public feedback, which has previously been shown for the secret key generation problem.
@inproceedings{6089579,
 abstract = {We characterize the secret message capacity of a wiretapped erasure channel where causal channel state information of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generation for the same channel setup. We propose a linear coding scheme that has polynomial encoding/decoding complexity, and prove a converse that shows the optimality of our scheme. Our work also demonstrates the value of causal public feedback, which has previously been shown for the secret key generation problem.},
 author = {Czap, L. and Prabhakaran, V.M. and Fragouli, C. and Diggavi, S.},
 booktitle = {Information Theory Workshop (ITW), 2011 IEEE},
 file = {:papers:secret_erasure_bc.pdf},
 month = {Oct},
 pages = {65-69},
 tags = {conf,WiNetSec,IT},
 title = {Secret message capacity of erasure broadcast channels with feedback},
 type = {4},
 year = {2011}
}

Downloads: 0