Cited by 380Cryptographic Implementations and SecurityAdvanced Authentication Protocols SecurityWireless Networks and Protocols

Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2

Open access
Vanhoef, Mathy, Piessens, Frank·2017·Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

Abstract

We introduce the key reinstallation attack. This attack abuses design or implementation flaws in cryptographic protocols to reinstall an already-in-use key. This resets the key's associated parameters such as transmit nonces and receive replay counters. Several types of cryptographic Wi-Fi handshakes are affected by the attack. All protected Wi-Fi networks use the 4-way handshake to generate a fresh session key. So far, this 14-year-old handshake has remained free from attacks, and is even proven secure. However, we show that the 4-way handshake is vulnerable to a key reinstallation attack. Here, the adversary tricks a victim into reinstalling an already-in-use key. This is achieved by manipulating and replaying handshake messages. When reinstalling the key, associated parameters such as the incremental transmit packet number (nonce) and receive packet number (replay counter) are reset to their initial value. Our key reinstallation attack also breaks the PeerKey, group key, and Fast BSS Transition (FT) handshake. The impact depends on the handshake being attacked, and the data-confidentiality protocol in use. Simplified, against AES-CCMP an adversary can replay and decrypt (but not forge) packets. This makes it possible to hijack TCP streams and inject malicious data into them. Against WPA-TKIP and GCMP the impact is catastrophic: packets can be replayed, decrypted, and forged. Because GCMP uses the same authentication key in both communication directions, it is especially affected. Finally, we confirmed our findings in practice, and found that every Wi-Fi device is vulnerable to some variant of our attacks. Notably, our attack is exceptionally devastating against Android 6.0: it forces the client into using a predictable all-zero encryption key.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3133956.3134027

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Vanhoef and Piessens discovered a vulnerability in the four-way handshake that allows an adversary to decrypt a user's traffic without capturing the handshake or knowing the key.

    “Vanhoef and Piessens discovered a vulnerability in the four-way handshake that would give any adversary the ability to decrypt a user's traffic without needing to capture the handshake and have knowledge of the key [2].”

    From A Comprehensive Attack Flow Model and Security Analysis for Wi-Fi and WPA3 (2018) · cites this paper as [2]

    The Introduction and Conclusion say the four-way handshake is vulnerable to key reinstallation attacks that can enable frame decryption; §6.4 says the attack does not recover the session key. But §3.3 requires an adversary in a man-in-the-middle position to manipulate handshake messages, including a retransmission of message 3. The paper therefore does not support the claim that any adversary can decrypt traffic without capturing handshake messages. (LLM, conf=0.87)

    Experimental — accuracy not yet measured
  • For KRACK, the attacker sets the counters to their initial values and can then replay messages and decrypt them.

    “For this attack, the attacker sets the counters to their initial values and can then replay messages and decrypt them [2].”
  • KRACK exploits the four-way handshake that wireless security protocols use to authenticate users when connecting to the network.

    “This process exploits the four-way handshake that wireless security protocols use to authenticate their users when connecting to the network.”
  • WPA2 can be exploited by KRACK.

    “It has also been demonstrated that WPA2 can be exploited by a method known as KRACK, for which we will go into further depth in Section 4.2.7.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 15

  1. IEEE Std 802.
  2. IEEE Std 802.11ac. 2013. Amendment 4: Enhancements for Very High Throughput for Operation in Bands below 6 GHz.
  3. IEEE Std 802.11ad. 2012. Amendment 3: Enhancements for Very High Throughput in the 60 GHz Band.
  4. IEEE Std 802.11i. 2004. Amendment 6: Medium Access Control (MAC) Security Enhancements.
  5. IEEE Std 802.11r. 2008. Amendment 2: Fast Basic Service Set (BSS) Transition.
  6. Nimrod Aviram, Sebastian Schinzel, Juraj Somorovsky, Nadia Heninger, Maik Dankel, Jens Steube, Luke Valenta, David Adrian, J Alex Halderman, Viktor Dukhovni, et al. 2016. DROWN: breaking TLS using SSLv2. In USENIX Security.
  7. Nikita Borisov, Ian Goldberg, and David Wagner. 2001. Analysis of 802.11 Security, or Wired Equivalent Privacy Isn't. In Mac Crypto Workshop.
  8. Alessandro Cimatti, Edmund Clarke, Enrico Giunchiglia, Fausto Giunchiglia, Marco Pistore, Marco Roveri, Roberto Sebastiani, and Armando Tacchella. 2002. Nusmv 2: An opensource tool for symbolic model checking. In International Conference on Computer Aided Verification. Springer.
  9. David L Mills. 2011. Computer network time synchronization (2 ed.). CRC Press.
  10. Grand View Research. 2017. Wireless Gigabit (WiGig) Market Size To Reach $7.42 Billion By 2024. (2017). Retrieved May 10, 2017 from http://www. grandviewresearch.com/press-release/global-wireless-gigabit-wigig-market
  11. J. Selvi. 2015. Breaking SSL using time synchronisation attacks. In DEF CON Hacking Conference.
  12. Robert Stacey, Adrian Stephens, Jesse Walker, Herbert Liondas, and Emily Qi. 2010. Rekeying Protocol Fix. (2010). Retrieved August 19, 2017 from https:// mentor.ieee.org/802.11/dcn/10/11-10-0313-01-000m-rekeying-protocol-fix.ppt
  13. Robert Stacey, Adrian Stephens, Jesse Walker, Herbert Liondas, and Emily Qi. 2010. Rekeying Protocol Fix Text. (2010). Retrieved August 19, 2017 from https://mentor. ieee.org/802.11/dcn/10/11-10-0314-00-000m-rekeying-protocol-fix-text.doc
  14. Adam Stubblefield, John Ioannidis, Aviel D Rubin, et al. 2002. Using the Fluhrer, Mantin, and Shamir Attack to Break WEP. In NDSS.
  15. Joshua Wright. 2003. Weaknesses in LEAP challenge/response. In DEF CON Hacking Conference.

Cited by

Sorted by citations

Authors
Vanhoef, M., & Piessens, F.
Affiliations
IMEC (BE)
Venue
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
Publisher
ACM
Published
2017-10-30
Pages
1313-1328
ISSN
1543-7221 (ISSN-L)
OpenAlex
W2767098552
Cited by
380
References
38
Citations by year
2026: 25 · 2025: 31 · 2024: 38 · 2023: 42 · 2022: 40 · 2021: 35 · 2020: 53 · 2019: 55 · 2018: 59 · 2017: 2
FWCI
21.08
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGSAC Conference on Computer and Communications Security (CCS) (publishedVersion)
  • Lirias (KU Leuven) (submittedVersion, other-oa)
Funders
KU Leuven
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
Keywords
Wi-Fi security, 4-way handshake, replay attacks, group key

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