ComPass: Proximity Aware Common Passphrase Agreement Protocol for Wi-Fi devices Using Physical Layer Security

  title={ComPass: Proximity Aware Common Passphrase Agreement Protocol for Wi-Fi devices Using Physical Layer Security},
  author={Khan Reaz and Gerhard Wunder},
Secure and scalable device provisioning is a notorious challenge in Wi-Fi. WPA2/WPA3 solutions take user interaction and a strong passphrase for granted. However, the often weak passphrases are subject to guessing attacks. Notably, there has been a significant rise of cyberattacks on Wi-Fi home or small office networks during the COVID-19 pandemic. This paper addresses the device provisioning problem in Wi-Fi (personal mode) and proposes ComPass protocol to supplement WPA2/WPA3. ComPass… 


Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
We provide formal definitions and efficient secure techniques for turning biometric information into keys usable for any cryptographic application, and reliably and securely authenticating
<inline-formula><tex-math notation="LaTeX">$\pi$</tex-math><alternatives> <inline-graphic xlink:href="zhu-ieq1-2793222.gif"/></alternatives></inline-formula>-Splicer: Perceiving Accurate CSI Phases with Commodity WiFi Devices
Results of extensive real-world experiments indicate that accurate CSI phase measurements can significantly improve the performance of splicing and the stability of the derived power delay profiles (PDPs).
Secret Group-Key Generation at Physical Layer for Multi-Antenna Mesh Topology
The simulation results verify the performance of the proposed secret group-key generation scheme using various key-related metrics and verify the practical robustness of the scheme by implementing a testbed using universal software radio peripheral and test it using the National Institute of Standards and Technology test suit.
Instant and Robust Authentication and Key Agreement among Mobile Devices
This work design and implement an authentication and key agreement protocol for mobile devices, called The Dancing Signals (TDS), being extremely fast and error-free, and shows that TDS only takes a couple of seconds to make devices agree on a 256-bit secret key with high entropy.
Security Analysis of Quantization Schemes for Channel-based Key Extraction
This work presents test vectors based on a large measurement campaign, an extensive comparative evaluation framework (including ten protocols as well as new on-line entropy estimators), and a rigorous experimental security analysis that answers for the first time a variety of security and performance related questions about the behavior of 10 channel-based key establishment schemes from the literature.
A Novel Key Generating Architecture for Wireless Low-Resource Devices
This work presents a new system architecture which is suitable also for resource-constrained platforms, and strongly focuses on security, rather than a robust key generation rate, as well as on low complexity and efficiency.
Factoring RSA Keys in the IoT Era
  • Jonathan Kilgallin, Ross Vasko
  • Computer Science
    2019 First IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA)
  • 2019
It is concluded that device manufacturers must ensure their devices have access to sufficient entropy and adhere to best practices in cryptography to protect consumers.
Free Your CSI: A Channel State Information Extraction Platform For Modern Wi-Fi Chipsets
The nexmon CSI Extractor Tool allows per-frame CSI extraction for up to four spatial streams using up toFour receive chains on modern Broadcom and Cypress Wi-Fi chips with up to 80MHz bandwidth in both the 2.4 and 5GHz bands.
Opportunistic Wireless Encryption
This memo specifies an extension to IEEE Std 802.11 to provide for opportunistic (unauthenticated) encryption to the wireless media.
Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
  • R. Chien
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1964
This paper presents new general error-correction procedures for fhe class of codes known as Bose-Chaudhuri-Hocquenghem codes. It is shown that these procedures are efficient in time required for