CVE Vulnerabilities

CVE-2026-4923

Inefficient Regular Expression Complexity

Published: Mar 26, 2026 | Modified: Apr 16, 2026
CVSS 3.x
N/A
Source:
NVD
CVSS 2.x
RedHat/V2
RedHat/V3
5.9 MODERATE
CVSS:3.1/AV:N/AC:H/PR:N/UI:N/S:U/C:N/I:N/A:H
Ubuntu
MEDIUM
root.io logo minimus.io logo echo.ai logo

Impact:

When using multiple wildcards, combined with at least one parameter, a regular expression can be generated that is vulnerable to ReDoS. This backtracking vulnerability requires the second wildcard to be somewhere other than the end of the path.

Unsafe examples:

/*foo-*bar-:baz /*a-:b-*c-:d /x/*a-:b/*c/y

Safe examples:

/*foo-:bar /*foo-:bar-*baz

Patches:

Upgrade to version 8.4.0.

Workarounds:

If you are using multiple wildcard parameters, you can check the regex output with a tool such as https://makenowjust-labs.github.io/recheck/playground/ to confirm whether a path is vulnerable.

Weakness

The product uses a regular expression with a worst-case computational complexity that is inefficient and possibly exponential.

Affected Software

NameVendorStart VersionEnd Version
Path-to-regexpPillarjs8.0.0 (including)8.4.0 (excluding)
Red Hat Developer Hub 1.10RedHatrhdh/rhdh-hub-rhel9:1780930740*
Node-path-to-regexpUbuntuesm-apps/xenial*
Node-path-to-regexpUbuntuupstream*

Potential Mitigations

References