The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Exploiting Channel Diversity in Secret Key Generation From Multipath Fading Randomness
Open accessAbstract
We design and analyze a method to extract secret keys from the randomness inherent to wireless channels. We study a channel model for a multipath wireless channel and exploit the channel diversity in generating secret key bits. We compare the key extraction methods based both on entire channel state information (CSI) and on single channel parameter such as the received signal strength indicators (RSSI). Due to the reduction in the degree-of-freedom when going from CSI to RSSI, the rate of key extraction based on CSI is far higher than that based on RSSI. This suggests that exploiting channel diversity and making CSI information available to higher layers would greatly benefit the secret key generation. We propose a key generation system based on low-density parity-check (LDPC) codes and describe the design and performance of two systems: one based on binary LDPC codes and the other (useful at higher signal-to-noise ratios) based on four-ary LDPC codes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“For more details of these standard aspects of the implementation see [40].”
Background
Cited by
Hamamreh, J. M., Furqan, H. M., & Arslan, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2878035 · Cited by 742
Liu, Y., Chen, H.-H., & Wang, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2598968 · Cited by 698
Self-citationKey Generation From Wireless Channels: A Review
Zhang, J., Duong, T. Q., Marshall, A., & Woods, R. (2016) · IEEE Access · doi:10.1109/access.2016.2521718 · Cited by 451
Fast and practical secret key extraction by exploiting channel response
Liu, H., Wang, Y., Yang, J., & Chen, Y. (2013) · 2013 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2013.6567117 · Cited by 262
Metadata
- Authors
- Liu, Y., Draper, S. C., & Sayeed, A. M.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2012-10
- Volume
- 7
- Issue
- 5
- Pages
- 1484-1497
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W1973956822
- Cited by
- 160
- References
- 1
- FWCI
- 3.66
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Exploiting Channel Diversity in Secret Key Generation From Multipath Fading Randomness. https://app.cochat.ai/papers/10.1109/tifs.2012.2206385
- The paper
- Liu, Y., Draper, S. C., & Sayeed, A. M. (2012). Exploiting Channel Diversity in Secret Key Generation From Multipath Fading Randomness. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2012.2206385
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.