CVE Catalog

CVE-2024-26924

HighCVSS 7.8
Published: Updated: Translated: NVD NIST

Exploitation Probability (EPSS)

Elevated risk
1.29%

67th percentile - higher than 67% of all known CVEs

Summary

In the Linux kernel, a vulnerability in the netfilter module (nft_set_pipapo) can lead to a system crash during large batch add/remove operations. The issue arises from incorrect element removal when multiple elements share the same key, potentially unmapping the wrong element and leaving a stale pointer in the data structure.

Risk Assessment

An attacker with privileges to configure netfilter rules (e.g., via nftables) could trigger a kernel panic, causing a denial of service (DoS) for the entire system. The vulnerability is local but requires access to the firewall administration interface.

Recommendation

Immediately update the Linux kernel to a version containing the fix (commit resolving the issue in nft_set_pipapo). If updating is not possible, restrict access to netfilter administration tools (e.g., nft) to trusted users only.

Other vulnerabilities in Linux kernel

See all
Original NVD description (English source)

In the Linux kernel, the following vulnerability has been resolved: netfilter: nft_set_pipapo: do not free live element Pablo reports a crash with large batches of elements with a back-to-back add/remove pattern. Quoting Pablo: add_elem("00000000") timeout 100 ms ... add_elem("0000000X") timeout 100 ms del_elem("0000000X") <---------------- delete one that was just added ... add_elem("00005000") timeout 100 ms 1) nft_pipapo_remove() removes element 0000000X Then, KASAN shows a splat. Looking at the remove function there is a chance that we will drop a rule that maps to a non-deactivated element. Removal happens in two steps, first we do a lookup for key k and return the to-be-removed element and mark it as inactive in the next generation. Then, in a second step, the element gets removed from the set/map. The _remove function does not work correctly if we have more than one element that share the same key. This can happen if we insert an element into a set when the set already holds an element with same key, but the element mapping to the existing key has timed out or is not active in the next generation. In such case its possible that removal will unmap the wrong element. If this happens, we will leak the non-deactivated element, it becomes unreachable. The element that got deactivated (and will be freed later) will remain reachable in the set data structure, this can result in a crash when such an element is retrieved during lookup (stale pointer). Add a check that the fully matching key does in fact map to the element that we have marked as inactive in the deactivation step. If not, we need to continue searching. Add a bug/warn trap at the end of the function as well, the remove function must not ever be called with an invisible/unreachable/non-existent element. v2: avoid uneeded temporary variable (Stefano)

Vulnerability data from NVD (NIST) · CISA KEV · EPSS