The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Fast and practical secret key extraction by exploiting channel response
Abstract
Securing wireless communication remains challenging in dynamic mobile environments due to the shared nature of wireless medium and lacking of fixed key management infrastructures. Generating secret keys using physical layer information thus has drawn much attention to complement traditional cryptographic-based methods. Although recent work has demonstrated that Received Signal Strength (RSS) based secret key extraction is practical, existing RSS-based key generation techniques are largely limited in the rate they generate secret bits and are mainly applicable to mobile wireless networks. In this paper, we show that exploiting the channel response from multiple Orthogonal Frequency-Division Multiplexing (OFDM) subcarriers can provide fine-grained channel information and achieve higher bit generation rate for both static and mobile cases in real-world scenarios. We further develop a Channel Gain Complement (CGC) assisted secret key extraction scheme to cope with channel non-reciprocity encountered in practice. Our extensive experiments using WiFi networks in both indoor as well as outdoor environments demonstrate that our approach can achieve significantly faster secret bit generation rate at 60 ~ 90bit/packet, and is resilient to malicious attacks identified to be harmful to RSS-based techniques including predictable channel attack and stalking attack.
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
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · cited 2×
“To ensure that the secret key generated is substantially random, the standard randomness test suite from NIST [20] is”
BackgroundRukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
Tool release: gathering 802.11n traces with channel state information
Halperin, D., Hu, W., Sheth, A., & Wetherall, D. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1925861.1925870 · Cited by 1,761
Radio-telepathy: extracting a secret key from an unauthenticated wireless channel
Mathur, S., Trappe, W., Mandayam, N., Ye, C., & Reznik, A. (2008) · Proceedings of the 14th ACM international conference on Mobile computing and networking · doi:10.1145/1409944.1409960 · Cited by 739
On the effectiveness of secret key extraction from wireless signal strength in real environments
Jana, S., Premnath, S. N., Clark, M., Kasera, S. K., Patwari, N., & Krishnamurthy, S. V. (2009) · Proceedings of the 15th annual international conference on Mobile computing and networking · doi:10.1145/1614320.1614356 · Cited by 518
High-Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements
Patwari, N., Croft, J., Jana, S., & Kasera, S. K. (2010) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2009.88 · Cited by 416
Robust key generation from signal envelopes in wireless networks
Azimi-Sadjadi, B., Kiayias, A., Mercado, A., & Yener, B. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315295 · Cited by 356
Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels
Wilson, R., Tse, D., & Scholtz, R. A. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.902666 · Cited by 332
Fast and scalable secret key generation exploiting channel phase randomness in wireless networks
Wang, Q., Su, H., Ren, K., & Kim, K. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5934929 · Cited by 251
Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks
Zeng, K., Wu, D., Chan, A., & Mohapatra, P. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462004 · Cited by 242
Cited by
Hamamreh, J. M., Furqan, H. M., & Arslan, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2878035 · Cited by 742
Key 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
Metadata
- Authors
- Liu, H., Wang, Y., Yang, J., & Chen, Y.
- Venue
- 2013 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2013-04
- Pages
- 3048-3056
- OpenAlex
- W2127697497
- Cited by
- 262
- References
- 16
- FWCI
- 18.31
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Fast and practical secret key extraction by exploiting channel response. https://app.cochat.ai/papers/10.1109/infcom.2013.6567117
- The paper
- Liu, H., Wang, Y., Yang, J., & Chen, Y. (2013). Fast and practical secret key extraction by exploiting channel response. 2013 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2013.6567117
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.