Описание
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.
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.
Restore the check on overlapping start elements to report an overlap.
Ссылки
- https://nvd.nist.gov/vuln/detail/CVE-2026-45873
- https://git.kernel.org/stable/c/029e5f6a95e905b12d6bc20421be32a01e0eb311
- https://git.kernel.org/stable/c/05feaf826390fd16f1deb89dd9412def3b2a280f
- https://git.kernel.org/stable/c/4780ec142cbb24b794129d3080eee5cac2943ffc
- https://git.kernel.org/stable/c/7ca5813e1b21ef300e04593f47b073ef3217aac6
- https://git.kernel.org/stable/c/dad14d22dff1a191612acb98facceb303d0524a2
- https://git.kernel.org/stable/c/e6497e06a102870803a59570d75ed2c36d7e11b3
- https://git.kernel.org/stable/c/f1381ce0a1dd013610985e1c4260908163a427df
- https://git.kernel.org/stable/c/f1535d56fc3f6c625b7e0559c006bd0318791bb1
Связанные уязвимости
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 ...
ELSA-2026-50372: Unbreakable Enterprise kernel security update (IMPORTANT)