Metraipolis › archive › dc_b443ac7209ef

Fast and Secure Simultaneous Authentication of Equals for WPA3 — arXiv:2609.31519

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31519
License (as archived)
CC0-1.0
Archived
2026-10-08T02:09:26.745Z
SHA-256 of the archived text
a4ec7cf629408191e4c26629e11f78d4191b04815e199133c37dca401c52d83c
Stable URL of this page
https://metraipolis.com/documento/dc_b443ac7209ef

How to cite

Fast and Secure Simultaneous Authentication of Equals for WPA3 — arXiv:2609.31519 — arXiv (en), https://arxiv.org/abs/2609.31519 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b443ac7209ef (Metraipolis archive dc_b443ac7209ef, sha256 a4ec7cf629408191e4c26629e11f78d4191b04815e199133c37dca401c52d83c)
BibTeX
@misc{dcb443ac7209ef,
  title = {Fast and Secure Simultaneous Authentication of Equals for WPA3 — arXiv:2609.31519},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31519},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b443ac7209ef; sha256 a4ec7cf629408191e4c26629e11f78d4191b04815e199133c37dca401c52d83c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31519. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Simultaneous Authentication of Equals (SAE) protocol, introduced in WPA3, provides robust protection against offline dictionary attacks against a network Pre-Shared Key (PSK) and also protection of session keys from other people knowing that PSK. However, its high computational cost for the Password Element (PE) derivation makes Access Points (APs) vulnerable to CPU exhaustion Denial-of-Service (DoS) attacks. This paper proposes a resilient architectural modification to SAE. First, we introduce an asymmetric resource cost model that offloads the iterative discovery of cryptographic elements to the client, allowing the AP to maintain a fixed computational load during the handshake. To further mitigate brute-force attempts, we implement a mechanism based on a slow-path key derivation (with variable cost key derivation functions, such as PBKDF2 or Argon2), incorporating a deliberate processing delay on the supplicant. Finally, we introduce a ticket-based mechanism to facilitate efficient re-authentication for known devices, bypassing expensive exchanges while preserving system availability under adversarial conditions. Experimental results demonstrate that this architecture significantly mitigates DoS risks without compromising legitimate network access.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-28 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR) ; Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2609.31519 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T01:42:25.561Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).