A remark on secret-key generation over correlated fading channels

A remark on secret-key generation over correlated fading channels. Khisti, A & Diggavi, S. In GLOBECOM Workshops (GC Wkshps), 2011 IEEE, pages 864-868, Dec, 2011.
doi abstract bibtex

We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.

@inproceedings{6162578,
 abstract = {We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.},
 author = {Khisti, A and Diggavi, S.N.},
 booktitle = {GLOBECOM Workshops (GC Wkshps), 2011 IEEE},
 doi = {10.1109/GLOCOMW.2011.6162578},
 file = {:papers:remark_secret_keygen.pdf},
 month = {Dec},
 pages = {864-868},
 tags = {conf,WiNetSec,IT},
 title = {A remark on secret-key generation over correlated fading channels},
 type = {4},
 year = {2011}
}

Downloads: 0

{"_id":"B3f5hvqurAMufgmxB","bibbaseid":"khisti-diggavi-aremarkonsecretkeygenerationovercorrelatedfadingchannels-2011","author_short":["Khisti, A","Diggavi, S."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.","author":[{"propositions":[],"lastnames":["Khisti"],"firstnames":["A"],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["S.N."],"suffixes":[]}],"booktitle":"GLOBECOM Workshops (GC Wkshps), 2011 IEEE","doi":"10.1109/GLOCOMW.2011.6162578","file":":papers:remark_secret_keygen.pdf","month":"Dec","pages":"864-868","tags":"conf,WiNetSec,IT","title":"A remark on secret-key generation over correlated fading channels","year":"2011","bibtex":"@inproceedings{6162578,\n abstract = {We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.},\n author = {Khisti, A and Diggavi, S.N.},\n booktitle = {GLOBECOM Workshops (GC Wkshps), 2011 IEEE},\n doi = {10.1109/GLOCOMW.2011.6162578},\n file = {:papers:remark_secret_keygen.pdf},\n month = {Dec},\n pages = {864-868},\n tags = {conf,WiNetSec,IT},\n title = {A remark on secret-key generation over correlated fading channels},\n type = {4},\n year = {2011}\n}\n\n","author_short":["Khisti, A","Diggavi, S."],"key":"6162578","id":"6162578","bibbaseid":"khisti-diggavi-aremarkonsecretkeygenerationovercorrelatedfadingchannels-2011","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["remark","secret","key","generation","over","correlated","fading","channels","khisti","diggavi"],"title":"A remark on secret-key generation over correlated fading channels","year":2011}