The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Radio-telepathy: extracting a secret key from an unauthenticated wireless channel
Abstract
Securing communications requires the establishment of cryptographic keys, which is challenging in mobile scenarios where a key management infrastructure is not always present. In this paper, we present a protocol that allows two users to establish a common cryptographic key by exploiting special properties of the wireless channel: the underlying channel response between any two parties is unique and decorrelates rapidly in space. The established key can then be used to support security services (such as encryption) between two users. Our algorithm uses level-crossings and quantization to extract bits from correlated stochastic processes. The resulting protocol resists cryptanalysis by an eavesdropping adversary and a spoofing attack by an active adversary without requiring an authenticated channel, as is typically assumed in prior information-theoretic key establishment schemes. We evaluate our algorithm through theoretical and numerical studies, and provide validation through two complementary experimental studies. First, we use an 802.11 development platform with customized logic that extracts raw channel impulse response data from the preamble of a format-compliant 802.11a packet. We show that it is possible to practically achieve key establishment rates of ~ 1 bit/sec in a real, indoor wireless environment. To illustrate the generality of our method, we show that our approach is equally applicable to per-packet coarse signal strength measurements using off-the-shelf 802.11 hardware.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
(2006) · Choice Reviews Online · doi:10.5860/choice.43-4686 · Cited by 8,128
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
Secret key agreement by public discussion from common information
Maurer, U. M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256484 · Cited by 2,005
Common randomness in information theory and cryptography. I. Secret sharing
Ahlswede, R., & Csiszar, I. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243431 · Cited by 1,325
Privacy Amplification by Public Discussion
Bennett, C. H., Brassard, G., & Robert, J.-M. (1988) · SIAM Journal on Computing · doi:10.1137/0217014 · Cited by 867
Secret-Key Reconciliation by Public Discussion
Brassard, G., & Salvail, L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_35 · Cited by 781
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
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
Security of the Internet of Things: perspectives and challenges
Jing, Q., Vasilakos, A. V., Wan, J., Lu, J., & Qiu, D. (2014) · Wireless Networks · doi:10.1007/s11276-014-0761-7 · Cited by 1,245
From RSSI to CSI: Indoor localization via channel response
Yang, Z., Zhou, Z., & Liu, Y. (2013) · ACM Computing Surveys · doi:10.1145/2543581.2543592 · Cited by 1,229
Hamamreh, J. M., Furqan, H. M., & Arslan, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2878035 · Cited by 742
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
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
Information-Theoretically Secret Key Generation for Fading Wireless Channels
Ye, C., Mathur, S., Reznik, A., Shah, Y., Trappe, W., & Mandayam, N. B. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2043187 · Cited by 417
Self-citationHigh-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
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 Extraction from Wireless Signal Strength in Real Environments
Premnath, S. N., Jana, S., Croft, J., Gowda, P. L., Clark, M., Kasera, S. K., Patwari, N., & Krishnamurthy, S. V. (2013) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2012.63 · Cited by 297
The challenges facing physical layer security
Trappe, W. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7120011 · Cited by 278
Self-citationSecret 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
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
Privacy in mobile technology for personal healthcare
Avancha, S., Baxi, A., & Kotz, D. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379779 · Cited by 229
A Survey on Security and Privacy Issues in Modern Healthcare Systems: Attacks and Defenses
Newaz, A. I., Sikder, A. K., Rahman, M. A., & Uluagac, A. S. (2021) · ACM Transactions on Computing for Healthcare · doi:10.1145/3453176 · Cited by 225
Metadata
- Authors
- Mathur, S., Trappe, W., Mandayam, N., Ye, C., & Reznik, A.
- Venue
- Proceedings of the 14th ACM international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 2008-09-14
- Pages
- 128-139
- OpenAlex
- W2054496355
- Cited by
- 739
- References
- 27
- FWCI
- 37.54
- 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
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.