The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fast and scalable secret key generation exploiting channel phase randomness in wireless networks
Abstract
Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Several interesting approaches have been developed and demonstrated for their feasibility. The state-of-the-art, however, still has much room for improving their practicality. This is because i) the key bit generation rate supported by most existing approaches is very low which significantly limits their practical usage given the intermittent connectivity in mobile environments; ii) existing approaches suffer from the scalability and flexibility issues, i.e., they cannot be directly extended to support efficient group key generation and do not suit for static environments. With these observations in mind, we present a new secret key generation approach that utilizes the uniformly distributed phase information of channel responses to extract shared cryptographic keys under narrowband multipath fading models. The proposed approach enjoys a high key bit generation rate due to its efficient introduction of multiple randomized phase information within a single coherence time interval as the keying sources. The proposed approach also provides scalability and flexibility because it relies only on the transmission of periodical extensions of unmodulated sinusoidal beacons, which allows effective accumulation of channel phases across multiple nodes. The proposed scheme is thoroughly evaluated through both analytical and simulation studies. Compared to existing work that focus on pairwise key generation, our approach is highly scalable and can improve the analytical key bit generation rate by a couple of orders of magnitude.
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 by
A Survey on Wireless Security: Technical Challenges, Recent Advances, and Future Trends
Zou, Y., Zhu, J., Wang, X., & Hanzo, L. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2558521 · Cited by 1,272
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
On the Security of the Automatic Dependent Surveillance-Broadcast Protocol
Strohmeier, M., Lenders, V., & Martinovic, I. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2365951 · Cited by 298
Secret key generation exploiting channel characteristics in wireless communications
Ren, K., Su, H., & Wang, Q. (2011) · IEEE Wireless Communications · doi:10.1109/mwc.2011.5999759 · Cited by 262
Self-citation
Metadata
- Authors
- Wang, Q., Su, H., Ren, K., & Kim, K.
- Venue
- 2011 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2011-04
- Pages
- 1422-1430
- OpenAlex
- W2126477936
- Cited by
- 251
- References
- 1
- FWCI
- 22.62
- 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 scalable secret key generation exploiting channel phase randomness in wireless networks. https://app.cochat.ai/papers/10.1109/infcom.2011.5934929
- The paper
- Wang, Q., Su, H., Ren, K., & Kim, K. (2011). Fast and scalable secret key generation exploiting channel phase randomness in wireless networks. 2011 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2011.5934929
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.