The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Secret Key Extraction from Wireless Signal Strength in Real Environments
Abstract
We evaluate the effectiveness of secret key extraction, for private communication between two wireless devices, from the received signal strength (RSS) variations on the wireless channel between the two devices. We use real world measurements of RSS in a variety of environments and settings. The results from our experiments with 802.11-based laptops show that in certain environments, due to lack of variations in the wireless channel, the extracted bits have very low entropy making these bits unsuitable for a secret key, an adversary can cause predictable key generation in these static environments, and in dynamic scenarios where the two devices are mobile, and/or where there is a significant movement in the environment, high entropy bits are obtained fairly quickly. Building on the strengths of existing secret key extraction approaches, we develop an environment adaptive secret key generation scheme that uses an adaptive lossy quantizer in conjunction with Cascade-based information reconciliation and privacy amplification. Our measurements show that our scheme, in comparison to the existing ones that we evaluate, performs the best in terms of generating high entropy bits at a high bit rate. The secret key bit streams generated by our scheme also pass the randomness tests of the NIST test suite that we conduct. We also build and evaluate the performance of secret key extraction using small, low-power, hand-held devices-Google Nexus One phones-that are equipped 802.11 wireless network cards. Last, we evaluate secret key extraction in a multiple input multiple output (MIMO)-like sensor network testbed that we create using multiple TelosB sensor nodes. We find that our MIMO-like sensor environment produces prohibitively high bit mismatch, which we address using an iterative distillation stage that we add to the key extraction process. Ultimately, we show that the secret key generation rate is increased when multiple sensors are involved in the key extraction process.
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
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
Wireless Information-Theoretic Security
Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921908 · Cited by 1,847
Experimental quantum cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1992) · Journal of Cryptology · doi:10.1007/bf00191318 · Cited by 1,614
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Experimental Quantum Cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_23 · Cited by 959
Radio Tomographic Imaging with Wireless Networks
Wilson, J., & Patwari, N. (2010) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2009.174 · Cited by 897
Self-citationWireless device identification with radiometric signatures
Brik, V., Banerjee, S., Gruteser, M., & Oh, S. (2008) · Proceedings of the 14th ACM international conference on Mobile computing and networking · doi:10.1145/1409944.1409959 · Cited by 851
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
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
Pseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73009 · Cited by 724
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
Self-citationInformation-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
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
Unconditionally secure key agreement and the intrinsic conditional information
Maurer, U. M., & Wolf, S. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748999 · Cited by 274
On fast and accurate detection of unauthorized wireless access points using clock skews
Jana, S., & Kasera, S. K. (2008) · Proceedings of the 14th ACM international conference on Mobile computing and networking · doi:10.1145/1409944.1409958 · Cited by 259
Self-citationSecure wireless communications: Secret keys through multipath
Sayeed, A., & Perrig, A. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518284 · Cited by 240
Unconventional cryptographic keying variable management
Hershey, J. E., Hassan, A. A., & Yarlagadda, R. (1995) · IEEE Transactions on Communications · doi:10.1109/26.385951 · Cited by 231
On Fast and Accurate Detection of Unauthorized Wireless Access Points Using Clock Skews
Jana, S., & Kasera, S. K. (2009) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2009.145 · Cited by 225
Self-citationExtracting 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
Securing 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
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
Unconditionally secure communications over fading channels
Tope, M. A., & McEachen, J. C. (2002) · doi:10.1109/milcom.2001.985763 · Cited by 76
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
- Premnath, S. N., Jana, S., Croft, J., Gowda, P. L., Clark, M., Kasera, S. K., Patwari, N., & Krishnamurthy, S. V.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2013-05
- Volume
- 12
- Issue
- 5
- Pages
- 917-930
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2091729149
- Cited by
- 297
- References
- 25
- FWCI
- 8.55
- Type
- journal article
- 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.