Security Resilience

CVE-2026-31413

Memory Safety in Linux Kernel 6.12.75 – 6.12.80

Published
12 April 2026
Modified
20 May 2026
Patch / advisory
CVSS Score v3.1 7.8
Click a component to see what it means
Raw vectorCVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:H/A:H
EPSS Score 0.0022 13th percentile
Risk Priority 55 floored blend · peak EPSS

CVSS and EPSS are reproduced from their sources (NVD, FIRST EPSS). EPSS scores by FIRST (EPSS SIG), generated by Empirical Security. Risk Priority is our own derived reading, not an NVD score.

Summary

CVE-2026-31413 is a high-severity Out-of-bounds Read (CWE-125) vulnerability in Linux Kernel. Its CVSS base score is 7.8 (High).

Operationally, exploitation aligns with the MITRE ATT&CK technique Endpoint Denial of Service (T1499); ranked at the 13th percentile by exploit likelihood (below the median); it is not currently listed in the CISA KEV catalog.

The strongest mitigations our analysis identified map to SA-11 (Developer Testing and Evaluation) and SA-8 (Security and Privacy Engineering Principles) — see the control section below for these in your framework.

Deeper analysis AI-assisted summary

Synthesised by an AI model from the NVD description and linked references — a reading aid, not an authoritative source.

CVE-2026-31413 is a vulnerability in the Linux kernel's BPF verifier, specifically in the maybe_fork_scalars() function handling BPF_OR operations with a constant source operand. When the destination register has a signed range of [-1, 0], the verifier incorrectly forks the state: the pushed path assumes dst=0, while the runtime value becomes the constant K after 0 | K. This verifier/runtime divergence enables out-of-bounds access to BPF maps. The issue affects Linux kernels supporting eBPF programs and has a CVSS v3.1 base score of 7.8 (AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:H/A:H).

A local attacker with low privileges can exploit this by submitting a malicious eBPF program that passes verification due to the flawed scalar forking but triggers out-of-bounds map access at runtime. Successful exploitation grants high-impact confidentiality, integrity, and availability effects, potentially allowing kernel memory corruption or arbitrary code execution within the kernel context.

Kernel patches addressing this vulnerability are available in stable trees via the referenced commits, including 342aa1ee995ef5bbf876096dc3a5e51218d76fa4, 58bd87d0e69204dbd739e4387a1edb0c4b1644e7, c845894ebd6fb43226b3118d6b017942550910c5, and d13281ae7ea8902b21d99d10a2c8caf0bdec0455. The fix modifies push_stack() to pass env->insn_idx instead of env->insn_idx + 1, forcing the pushed verifier path to re-execute the ALU instruction and compute the correct runtime value. Security practitioners should update to patched kernels to mitigate exploitation.

EU & UK References

Vulnerability Data

In the Linux kernel, the following vulnerability has been resolved: bpf: Fix unsound scalar forking in maybe_fork_scalars() for BPF_OR maybe_fork_scalars() is called for both BPF_AND and BPF_OR when the source operand is a constant. When dst has signed range [-1,…

more

0], it forks the verifier state: the pushed path gets dst = 0, the current path gets dst = -1. For BPF_AND this is correct: 0 & K == 0. For BPF_OR this is wrong: 0 | K == K, not 0. The pushed path therefore tracks dst as 0 when the runtime value is K, producing an exploitable verifier/runtime divergence that allows out-of-bounds map access. Fix this by passing env->insn_idx (instead of env->insn_idx + 1) to push_stack(), so the pushed path re-executes the ALU instruction with dst = 0 and naturally computes the correct result for any opcode.

CWE(s)

Related Threats

MITRE ATT&CK Enterprise Techniques

T1499 Endpoint Denial of Service Impact
Adversaries may perform Endpoint Denial of Service (DoS) attacks to degrade or block the availability of services to users.
T1068 Exploitation for Privilege Escalation Privilege Escalation
Adversaries may exploit software vulnerabilities in an attempt to elevate privileges.
T1185 Browser Session Hijacking Collection
Adversaries may take advantage of security vulnerabilities and inherent functionality in browser software to change content, modify user-behaviors, and intercept information as part of various browser session hijacking techniques.
T1190 Exploit Public-Facing Application Initial Access
Adversaries may attempt to exploit a weakness in an Internet-facing host or system to initially access a network.
T1203 Exploitation for Client Execution Execution
Adversaries may exploit software vulnerabilities in client applications to execute code.
T1211 Exploitation for Stealth Stealth
Adversaries may exploit vulnerabilities to evade detection by hiding activity, suppressing logging, or operating within trusted or unmonitored components.
Derived from this CVE’s CWE(s) via the direct CWE→ATT&CK cross-walk.

CVEs Like This One

CVE-2025-21741Same product: Linux Linux Kernel
CVE-2024-53099Same product: Linux Linux Kernel
CVE-2024-42264Same product: Linux Linux Kernel
CVE-2025-21647Same product: Linux Linux Kernel
CVE-2024-38585Same product: Linux Linux Kernel
CVE-2026-46022Same product: Linux Linux Kernel
CVE-2025-22104Same product: Linux Linux Kernel
CVE-2024-39277Same product: Linux Linux Kernel
CVE-2026-23315Same product: Linux Linux Kernel
CVE-2026-53149Same product: Linux Linux Kernel

Affected Assets

linux
linux kernel
6.12.75 — 6.12.80 · 6.18.16 — 6.18.21 · 6.19.6 — 6.19.11

Mitigating Controls

Mitigating Controls (NIST 800-53 r5) AI

Developer testing and evaluation directly finds out-of-bounds read flaws through static analysis, fuzzing, and dynamic bounds checks.

Secure engineering principles require bounds checking and memory-safe constructs that stop out-of-bounds reads from being introduced.

Process isolation confines the effects of an out-of-bounds read to the compromised process.

Input validation rejects malformed indices or lengths that would otherwise cause reads outside buffer bounds.

Mitigating Controls (NIST CSF 2.0) AI

Derived directly from the weakness types (CWEs) cited in the NVD entry via our AI-authored CWE→CSF cross-walk (authority under review) — links open the control.

PR.PS-06 mostly match
blocks

Secure-development practices such as bounds checking and memory-safe languages directly prevent out-of-bounds reads.

ID.RA-01 partial match
blocks

Vulnerability scanning and recording can discover instances of out-of-bounds reads after code is deployed.

PR.PS-02 partial match
blocks

Routine patching replaces vulnerable code containing out-of-bounds read flaws.

Mitigating Controls (ISO/IEC 27001:2022 Annex A) AI

Derived directly from the weakness types (CWEs) cited in the NVD entry via our AI-authored CWE→ISO cross-walk (authority under review) — links open the control.

finds

Security testing in development and acceptance includes fuzzing and static analysis that detect out-of-bounds read defects before release.

prevents

Secure coding standards explicitly forbid unsafe pointer arithmetic and mandate bounds-checked reads, eliminating CWE-125.

References