In the Linux kernel, the following vulnerability has been resolved: netfilter: nft_set_rbtree: check for partial overlaps in anonymous sets Userspace provides an optimized representation in case intervals are adjacent, where the end element is omitted. The existing partial overlap detection logic skips anonymous set checks on start elements for this reason. However, it is possible to add intervals that overlap to this anonymous where two start elements with the same, eg. A-B, A-C where C < B. start end A B start end A C Restore the check on overlapping start elements to report an overlap.

In the Linux kernel, the following vulnerability has been resolved: netfilter: nft_set_rbtree: check for partial overlaps in anonymous sets Userspace provides an optimized representation in case intervals are adjacent, where the end element is omitted. The existing partial overlap detection logic skips anonymous set checks on start elements for this reason. However, it is possible to add intervals that overlap to this anonymous where two start elements with the same, eg. A-B, A-C where C < B. start end A B start end A C Restore the check on overlapping start elements to report an overlap.

In the Linux kernel, the following vulnerability has been resolved: netfilter: nft_set_rbtree: check for partial overlaps in anonymous sets Userspace provides an optimized representation in case intervals are adjacent, where the end element is omitted. The existing partial overlap detection logic skips anonymous set checks on start elements for this reason. However, it is possible to add intervals that overlap to this anonymous where two start elements with the same, eg. A-B, A-C where C < B. start end A B start end A C Restore the check on overlapping start elements to report an overlap.

In the Linux kernel, the following vulnerability has been resolved: netfilter: nft_set_rbtree: check for partial overlaps in anonymous sets Userspace provides an optimized representation in case intervals are adjacent, where the end element is omitted. The existing partial overlap detection logic skips anonymous set checks on start elements for this reason. However, it is possible to add intervals that overlap to this anonymous where two start elements with the same, eg. A-B, A-C where C < B. start end A B start end A C Restore the check on overlapping start elements to report an overlap.

In the Linux kernel, the following vulnerability has been resolved: n ...

Уязвимость компонента nft_set_rbtree.c ядра операционной системы Linux, позволяющая нарушителю вызвать отказ в обслуживании

Уязвимость kernel-lt

Уязвимость kernel-lt

ALT-PU-2026-7465: package `kernel-image-rt` update to version 5.10.252-alt1.rt148

ALT-PU-2026-4750: package `kernel-image-std-def` update to version 5.10.252-alt1

Security update for the Linux Kernel

Security update for the Linux Kernel

ALT-PU-2026-4752: package `kernel-image-pine` update to version 6.18.15-alt1

ALT-PU-2026-4126: package `kernel-image-un-def` update to version 6.1.166-alt1

ELSA-2026-50372: Unbreakable Enterprise kernel security update (IMPORTANT)

Security update for the Linux Kernel

ALT-PU-2026-4865: package `kernel-image-6.18` update to version 6.18.19-alt1

ALT-PU-2026-6044: package `kernel-image-rpi-un` update to version 6.12.79-alt1

ALT-PU-2026-7006: package `kernel-image-6.12` update to version 6.12.85-alt1

ALT-PU-2026-7004: package `kernel-image-rt` update to version 6.12.85-alt1