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
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
Aono, T., Higuchi, K., Ohira, T., Komiyama, B., & Sasaoka, H. (2005) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2005.858853 · Cited by 324
WISE design of indoor wireless systems: practical computation and optimization
Fortune, S. J., Gay, D. M., Kernighan, B. W., Landron, O., Valenzuela, R. A., & Wright, M. H. (1995) · IEEE Computational Science and Engineering · doi:10.1109/99.372944 · Cited by 289
A universal statistical test for random bit generators
Maurer, U. M. (1992) · Journal of Cryptology · doi:10.1007/bf00193563 · Cited by 263
Fingerprints in the Ether: Using the Physical Layer for Wireless Authentication
Xiao, L., Greenstein, L., Mandayam, N. B., & Trappe, W. K. (2007) · International Conference on Communications · doi:10.1109/icc.2007.767 · Cited by 255
Self-citationRobust location distinction using temporal link signatures
Patwari, N., & Kasera, S. K. (2007) · Proceedings of the 13th annual ACM international conference on Mobile computing and networking · doi:10.1145/1287853.1287867 · Cited by 234
Quantum Cryptography and Secret-Key Distillation
Assche, G. V. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511617744 · Cited by 209
Fast, efficient error reconciliation for quantum cryptography
Buttler, W. T., Lamoreaux, S. K., Torgerson, J. R., Nickel, G. H., Donahue, C. H., & Peterson, C. G. (2003) · Physical Review A · doi:10.1103/physreva.67.052303 · Cited by 201
Extracting Secrecy from Jointly Gaussian Random Variables
Ye, C., Reznik, A., & Shah, Y. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.262101 · Cited by 193
Self-citationSecuring wireless systems via lower layer enforcements
Li, Z., Xu, W., Miller, R., & Trappe, W. (2006) · Proceedings of the 5th ACM workshop on Wireless security · doi:10.1145/1161289.1161297 · Cited by 184
Self-citationSingle-user channel estimation and equalization
Tugnait, J. K., Tong, L., & Ding, Z. (2000) · IEEE Signal Processing Magazine · doi:10.1109/msp.2000.841720 · Cited by 180
Cryptographic Key Agreement for Mobile Radio
Hassan, A. A., Stark, W. E., Hershey, J. E., et al. (1996) · Digital Signal Processing · doi:10.1006/dspr.1996.0023 · Cited by 159
Secure information transmission for mobile radio
Koorapaty, H., Hassan, A. A., & Chennakeshu, S. (2000) · IEEE Communications Letters · doi:10.1109/4234.824754 · Cited by 159
Linking information reconciliation and privacy amplification
Cachin, C., & Maurer, U. M. (1997) · Journal of Cryptology · doi:10.1007/s001459900023 · Cited by 144
A Nearest-Neighbor Approach to Estimating Divergence between Continuous Random Vectors
Wang, Q., Kulkarni, S. R., & Verdú, S. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.261842 · Cited by 88
Construction of a shared secret key using continuous variables
Cardinal, J., & Assche, G. V. (2004) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2003.1216713 · Cited by 17
A universal statistical test for random bit generators
MaurerUeli, M. (1992) · Journal of Cryptology · doi:10.5555/148544.148545 · Cited by 8
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
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.