Koffei

CVE-2026-80521

🟡 Low

Linux kernel · 6.1.141–6.2; 6.6.93–6.7; 6.10+ (patched in 6.12.111 / 6.18.53 / 7.1.10 / 7.2+)

CVSS (Koffei note)
7.8
CVSS (v3.1, CVE List)
7.8
EPSS (2026-11-18)
0.178%
7.41th percentile

Exploitation

Not confirmed — not in CISA KEV

Timeline

  1. 26/08/2026CVE record published (CVE List)
  2. 24/09/2026Ubuntu Linux kernel container escape (CVE-2026-80521)

Risk

7.8 High — AV:L/AC:L/PR:L/UI:N, EPSS 0.1% (race condition on af_unix Unix sockets, concurrent send()/close() calls → possible container escape)

Fix

Yes

Official description

In the Linux kernel, the following vulnerability has been resolved: af_unix: Unlink scc_entry in unix_del_edge(). Kyle Zeng reported that GC could free a dead SCC partially. The scenario is as follows: 1) Create two SCCs: X -. A <-> B ^--' 2) Run the following concurrently: 2-1) send() sk-B to sk-B from sk-X 2-2) close() both A and B At 2-1), there is a small window where unix_add_edges() publishes a new edge (B <-> B) to GC but its skb is not queued by skb_queue_tail(). If 2-2) completes before skb_queue_tail() and GC is triggered, it judges A <-> B as dead, but B is not freed because GC cannot collect the not-yet-queued skb holding the B <-> B edge. X -. A <-> B -. This edge is visible ^--' ^..' but skb is not This itself is not a problem since the next GC run will judge B as dead as well and free it finally. X -. A <.> B -. ^--' ^--' However, X's SCC forces the next GC to call unix_walk_scc_fast(), and it iterates over A through B's scc_entry. Let's unlink scc_entry before freeing the vertex in unix_del_edge().

CVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:H/A:H