netfilter: nft_set_rbtree: check for partial overlaps in anonymous sets
Linux
Affected versions
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
|
Linux
| Product | Affected | Fixed in |
|---|---|---|
| Linux Linux |
|
≥ c9e6978e2725a7d4b6cd23b2facd3f11422c0643 · < dad14d22dff1a191612acb98facceb303d0524a2| No fix yet |
| Linux Linux |
|
|
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.
From the CVE record · Linux
The Linux kernel’s netfilter nft_set_rbtree can fail to detect partially overlapping intervals in anonymous sets when userspace supplies an optimized representation that omits an adjacent interval’s end element. This allows overlapping intervals with the same start element to be added; the input does not specify access requirements or user interaction.
Engineers running Linux kernels with netfilter nft_set_rbtree should check their versions against the vendor advisory; affected versions are not specified in the input.