CyberSecBulletin
CVE-2026-68750NVD status: Modified

html_sanitize_ex: Inefficient Algorithmic Complexity

CVE-2026-68750 is a high-severity inefficient algorithmic complexity vulnerability in html_sanitize_ex from Rrrene, with a CVSS 3.1 base score of 7.5 out of 10. It can be exploited remotely over the network by an unauthenticated attacker, without any action from a user. The record lists versions 1.4.5, 1.5.3 as the first without the flaw, so updating html_sanitize_ex to one of those releases or later removes the exposure. There is no confirmed exploitation so far. EPSS estimates a 0.8% chance of exploitation within 30 days, higher than 57% of scored CVEs.

Next patch cycle

High severity with no evidence of exploitation so far.

What to do

  1. Update html_sanitize_ex to 1.4.5 or 1.5.3, whichever matches your release line, or a later version.
  2. Update Htmlsanitizeex to 1.5.3 or a later version.
  3. Until you can update, restrict network access to the affected service so it is not reachable from untrusted networks.

Affected products and versions

VendorProductAffected versionsFixed in
Rrrenehtml_sanitize_ex0.3.1 up to, but not including, 1.4.5; 1.5.0-rc.0 up to, but not including, 1.5.3; 69ea11d61525c470b39b6860d024770d5573ff1f and later1.4.5, 1.5.3
RrreneHtmlsanitizeex0.3.1 up to, but not including, 1.5.31.5.3

Version data comes from the organisation that assigned the CVE. Confirm against the vendor advisory before deciding you are unaffected.

How the severity score breaks down

Attack vector
NetworkCan be exploited remotely over a network, including the internet.
Attack complexity
LowNo special conditions are needed; the attack works reliably.
Privileges required
NoneNo account or login is needed.
User interaction
NoneNo action by a victim is required.
Scope
UnchangedImpact stays within the vulnerable component.
Confidentiality
NoneNo data is disclosed.
Integrity
NoneNothing can be modified.
Availability
HighThe component can be taken down completely.

Vector: CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H. Scored by NVD.

Scoring systemScoreSeverityScored by
CVSS 4.08.2HighCNA
CVSS 3.17.5HighNVD

Official description

Inefficient Algorithmic Complexity vulnerability in the traversal engine in rrrene html_sanitize_ex allows an unauthenticated remote attacker to exhaust server CPU and memory via a flat run of sibling elements in sanitized HTML. The list clause of HtmlSanitizeEx.Traverser.traverse/2 recurses on the tail of a sibling list and then evaluates List.flatten([head] ++ tail) over the already flattened result, so every one of n siblings copies and re-walks the entire remaining tail. The flattening is only needed for the rare case where scrub returns several replacement nodes for one node, but the cost is paid across the whole tail at every step, making traversal quadratic in sibling count. The traverser sits on every public entry point, so no particular scrubber or configuration is required and the payload needs only allowed tags. A 160 KB body of 20,000 sibling elements occupies a scheduler for roughly 1.7 seconds, and the cost grows faster than the body does. This issue affects html_sanitize_ex: from 0.3.1 before 1.4.5 and from 1.5.0-rc.0 before 1.5.3.

Source: the CVE record as published by its numbering authority, via NVD and CVE.org.

The underlying weakness: Inefficient Algorithmic Complexity

An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.

More Inefficient Algorithmic Complexity vulnerabilities (CWE-407)

Timeline

  1. CVE record published.
  2. CISA published its SSVC assessment (exploitation: none, automatable: no, technical impact: partial).
  3. Record last changed materially (score, affected products, status or references).

References

Other vulnerabilities in html_sanitize_ex

All html_sanitize_ex vulnerabilities

Recent Inefficient Algorithmic Complexity vulnerabilities

Spotted an error? Tell us.