netfilter: nft_set_rbtree: check for partial overlaps in anonymous sets
- Published
- Last modified
- Where the record stands: published, rejected by its publisher, or superseded by another id.What do these mean? →
- published
- Whether CISA lists it in its Known Exploited Vulnerabilities catalog: proof that attackers are using it.What do these mean? →
- Not listed in CISA KEV
- Fix
- Fixed in 5.10.252, 5.15.202, 6.1.165, 4.20, 5.5
- Whether working attack code is public (Exploit-DB, Metasploit, Nuclei or GitHub). Public code makes attacks easier.What do these mean? →
- None on Exploit-DB, Metasploit or GitHub
Summary
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.
Timeline
- CVE published
Affected versions
- Linux Linux
From 5.10.166 · fixed in 5.10.252; From 5.15.91 · fixed in 5.15.202; From 6.1.9 · fixed in 6.1.165; From 4.19.316 · fixed in 4.20; From 5.4.262 · fixed in 5.5
- Linux Linux
6.2
References 8
git.kernel.org
- stable/c/7ca5813e1b21ef300e04593f47b073ef3217aac6
- stable/c/029e5f6a95e905b12d6bc20421be32a01e0eb311
- stable/c/f1381ce0a1dd013610985e1c4260908163a427df
- stable/c/f1535d56fc3f6c625b7e0559c006bd0318791bb1
- stable/c/05feaf826390fd16f1deb89dd9412def3b2a280f
- stable/c/dad14d22dff1a191612acb98facceb303d0524a2
- stable/c/e6497e06a102870803a59570d75ed2c36d7e11b3
- stable/c/4780ec142cbb24b794129d3080eee5cac2943ffc