Secret key agreement using asymmetry in channel state knowledge
We study secret-key agreement protocols over a wiretap channel controlled by a state parameter. The secret-key capacity is established when the wiretap channel is discrete and memoryless, the sender and receiver are both revealed the underlying state parameter, and no public discussion is allowed. A...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2010
|
| Online Access: | http://hdl.handle.net/1721.1/59452 https://orcid.org/0000-0001-9166-4758 |
| _version_ | 1811086814333632512 |
|---|---|
| author | Wornell, Gregory W. Khisti, Ashish Diggavi, Suhas N. |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Wornell, Gregory W. Khisti, Ashish Diggavi, Suhas N. |
| author_sort | Wornell, Gregory W. |
| collection | MIT |
| description | We study secret-key agreement protocols over a wiretap channel controlled by a state parameter. The secret-key capacity is established when the wiretap channel is discrete and memoryless, the sender and receiver are both revealed the underlying state parameter, and no public discussion is allowed. An optimal coding scheme involves a two step approach - (i) design a wiretap codebook assuming that the state parameter is also known to the eavesdropper (ii) generate an additional secret key by exploiting the uncertainty of the state parameter at the eavesdropper. When unlimited public discussion is allowed between the legitimate terminals, we provide an upper bound on the secret-key capacity and establish its tightness when the channel outputs of the legitimate receiver and eavesdropper satisfy a conditional independence property. Numerical results for an on-off fading model suggest that the proposed coding schemes significantly outperform naive schemes that either disregard the contribution of the common state sequence or the contribution of the underlying channel. |
| first_indexed | 2024-09-23T13:35:06Z |
| format | Article |
| id | mit-1721.1/59452 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:35:06Z |
| publishDate | 2010 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/594522022-09-28T14:48:30Z Secret key agreement using asymmetry in channel state knowledge Wornell, Gregory W. Khisti, Ashish Diggavi, Suhas N. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Wornell, Gregory W. Wornell, Gregory W. We study secret-key agreement protocols over a wiretap channel controlled by a state parameter. The secret-key capacity is established when the wiretap channel is discrete and memoryless, the sender and receiver are both revealed the underlying state parameter, and no public discussion is allowed. An optimal coding scheme involves a two step approach - (i) design a wiretap codebook assuming that the state parameter is also known to the eavesdropper (ii) generate an additional secret key by exploiting the uncertainty of the state parameter at the eavesdropper. When unlimited public discussion is allowed between the legitimate terminals, we provide an upper bound on the secret-key capacity and establish its tightness when the channel outputs of the legitimate receiver and eavesdropper satisfy a conditional independence property. Numerical results for an on-off fading model suggest that the proposed coding schemes significantly outperform naive schemes that either disregard the contribution of the common state sequence or the contribution of the underlying channel. National Science Foundation (U.S.) (Grant No. CCF-0515109) 2010-10-21T19:47:12Z 2010-10-21T19:47:12Z 2009-04 2009-06 Article http://purl.org/eprint/type/JournalArticle 978-1-4244-4312-3 INSPEC Accession Number: 10842360 http://hdl.handle.net/1721.1/59452 Khisti, A., G. Wornell, and S. Diggavi. “Secret key agreement using asymmetry in channel state knowledge.” Information Theory, 2009. ISIT 2009. IEEE International Symposium on. 2009. 2286-2290. ©2009 Institute of Electrical and Electronics Engineers. https://orcid.org/0000-0001-9166-4758 en_US http://dx.doi.org/10.1109/ISIT.2009.5205906 IEEE International Symposium on Information Theory, 2009. ISIT 2009. Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf Institute of Electrical and Electronics Engineers IEEE |
| spellingShingle | Wornell, Gregory W. Khisti, Ashish Diggavi, Suhas N. Secret key agreement using asymmetry in channel state knowledge |
| title | Secret key agreement using asymmetry in channel state knowledge |
| title_full | Secret key agreement using asymmetry in channel state knowledge |
| title_fullStr | Secret key agreement using asymmetry in channel state knowledge |
| title_full_unstemmed | Secret key agreement using asymmetry in channel state knowledge |
| title_short | Secret key agreement using asymmetry in channel state knowledge |
| title_sort | secret key agreement using asymmetry in channel state knowledge |
| url | http://hdl.handle.net/1721.1/59452 https://orcid.org/0000-0001-9166-4758 |
| work_keys_str_mv | AT wornellgregoryw secretkeyagreementusingasymmetryinchannelstateknowledge AT khistiashish secretkeyagreementusingasymmetryinchannelstateknowledge AT diggavisuhasn secretkeyagreementusingasymmetryinchannelstateknowledge |