CVE-2026-27903
published 2026-02-26CVE-2026-27903: minimatch is a minimal matching utility for converting glob expressions into JavaScript RegExp objects. Prior to version 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2…
PriorityP348high7.5CVSS 3.1
AVNACLPRNUINSUCNINAH
EPSS
0.52%
40.0th percentile
minimatch is a minimal matching utility for converting glob expressions into JavaScript RegExp objects. Prior to version 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2, 5.1.8, 4.2.5, and 3.1.3, `matchOne()` performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent `**` (GLOBSTAR) segments and the input path does not match. The time complexity is O(C(n, k)) -- binomial -- where `n` is the number of path segments and `k` is the number of globstars. With k=11 and n=30, a call to the default `minimatch()` API stalls for roughly 5 seconds. With k=13, it exceeds 15 seconds. No memoization or call budget exists to bound this behavior. Any application where an attacker can influence the glob pattern passed to `minimatch()` is vulnerable. The realistic attack surface includes build tools and task runners that accept user-supplied glob arguments (ESLint, Webpack, Rollup config), multi-tenant systems where one tenant configures glob-based rules that run in a shared process, admin or developer interfaces that accept ignore-rule or filter configuration as globs, and CI/CD pipelines that evaluate user-submitted config files containing glob patterns. An attacker who can place a crafted pattern into any of these paths can stall the Node.js event loop for tens of seconds per invocation. The pattern is 56 bytes for a 5-second stall and does not require authentication in contexts where pattern input is part of the feature. Versions 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2, 5.1.8, 4.2.5, and 3.1.3 fix the issue.
Affected
25 ranges
| Vendor | Product | Version range | Fixed in |
|---|---|---|---|
| debian | node-minimatch | < node-minimatch 9.0.7-1 (sid) | node-minimatch 9.0.7-1 (sid) |
| isaacs | minimatch | < 3.1.3 | 3.1.3 |
| isaacs | minimatch | — | — |
| isaacs | minimatch | — | — |
| isaacs | minimatch | — | — |
| isaacs | minimatch | — | — |
| isaacs | minimatch | — | — |
| isaacs | minimatch | — | — |
| isaacs | minimatch | — | — |
| minimatch_project | minimatch | < 3.1.3 | 3.1.3 |
| minimatch_project | minimatch | >= 0 < 3.1.3 | 3.1.3 |
| minimatch_project | minimatch | >= 10.0.0 < 10.2.3 | 10.2.3 |
| minimatch_project | minimatch | >= 10.0.0 < 10.2.3 | 10.2.3 |
| minimatch_project | minimatch | >= 4.0.0 < 4.2.5 | 4.2.5 |
| minimatch_project | minimatch | >= 4.0.0 < 4.2.5 | 4.2.5 |
| minimatch_project | minimatch | >= 5.0.0 < 5.1.8 | 5.1.8 |
| minimatch_project | minimatch | >= 5.0.0 < 5.1.8 | 5.1.8 |
| minimatch_project | minimatch | >= 6.0.0 < 6.2.2 | 6.2.2 |
| minimatch_project | minimatch | >= 6.0.0 < 6.2.2 | 6.2.2 |
| minimatch_project | minimatch | >= 7.0.0 < 7.4.8 | 7.4.8 |
| minimatch_project | minimatch | >= 7.0.0 < 7.4.8 | 7.4.8 |
| minimatch_project | minimatch | >= 8.0.0 < 8.0.6 | 8.0.6 |
| minimatch_project | minimatch | >= 8.0.0 < 8.0.6 | 8.0.6 |
| minimatch_project | minimatch | >= 9.0.0 < 9.0.7 | 9.0.7 |
| minimatch_project | minimatch | >= 9.0.0 < 9.0.7 | 9.0.7 |
CVSS provenance
nvdv3.17.5HIGHCVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H
osv7.5HIGH
vendor_debian7.5HIGH
vendor_redhat7.5HIGH
Stop checking back — get the weekly exploitation signal.
Every Monday: what got weaponized or added to CISA KEV in the last seven days — each CVE cross-linked to its PoC, Nuclei template, and detection rule. Free, one email a week, unsubscribe in one click.
GHSA
minimatch has ReDoS: matchOne() combinatorial backtracking via multiple non-adjacent GLOBSTAR segments
ghsa·2026-02-26
CVE-2026-27903 [HIGH] CWE-407 minimatch has ReDoS: matchOne() combinatorial backtracking via multiple non-adjacent GLOBSTAR segments
minimatch has ReDoS: matchOne() combinatorial backtracking via multiple non-adjacent GLOBSTAR segments
### Summary
`matchOne()` performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent `**` (GLOBSTAR) segments and the input path does not match. The time complexity is O(C(n, k)) -- binomial -- where `n` is the number of path segments and `k` is the number of globstars. With k=11 and n=30, a call to the default `minimatch()` API stalls for roughly 5 seconds. With k=13, it exceeds 15 seconds. No memoization or call budget exists to bound this behavior.
---
### Details
The vulnerable loop is in `matchOne()` at [`src/index.ts#L960`](https://github.com/isaacs/minimatch/blob/v10.2.2/src/index.ts#L960):
```typescript
while (fr ~5.4s, k=13 -> ~15.9s
const k
OSV
minimatch has ReDoS: matchOne() combinatorial backtracking via multiple non-adjacent GLOBSTAR segments
osv·2026-02-26
CVE-2026-27903 [HIGH] minimatch has ReDoS: matchOne() combinatorial backtracking via multiple non-adjacent GLOBSTAR segments
minimatch has ReDoS: matchOne() combinatorial backtracking via multiple non-adjacent GLOBSTAR segments
### Summary
`matchOne()` performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent `**` (GLOBSTAR) segments and the input path does not match. The time complexity is O(C(n, k)) -- binomial -- where `n` is the number of path segments and `k` is the number of globstars. With k=11 and n=30, a call to the default `minimatch()` API stalls for roughly 5 seconds. With k=13, it exceeds 15 seconds. No memoization or call budget exists to bound this behavior.
---
### Details
The vulnerable loop is in `matchOne()` at [`src/index.ts#L960`](https://github.com/isaacs/minimatch/blob/v10.2.2/src/index.ts#L960):
```typescript
while (fr ~5.4s, k=13 -> ~15.9s
const k
OSV
CVE-2026-27903: minimatch is a minimal matching utility for converting glob expressions into JavaScript RegExp objects
osv·2026-02-26·CVSS 7.5
CVE-2026-27903 [HIGH] CVE-2026-27903: minimatch is a minimal matching utility for converting glob expressions into JavaScript RegExp objects
minimatch is a minimal matching utility for converting glob expressions into JavaScript RegExp objects. Prior to version 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2, 5.1.8, 4.2.5, and 3.1.3, `matchOne()` performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent `**` (GLOBSTAR) segments and the input path does not match. The time complexity is O(C(n, k)) -- binomial -- where `n` is the number of path segments and `k` is the number of globstars. With k=11 and n=30, a call to the default `minimatch()` API stalls for roughly 5 seconds. With k=13, it exceeds 15 seconds. No memoization or call budget exists to bound this behavior. Any application where an attacker can influence the glob pattern passed to `minimatch()` is vulnerable. The realistic attack surface includes
Red Hat
minimatch: minimatch: Denial of Service due to unbounded recursive backtracking via crafted glob patterns
vendor_redhat·2026-02-26·CVSS 7.5
CVE-2026-27903 [HIGH] CWE-1333 minimatch: minimatch: Denial of Service due to unbounded recursive backtracking via crafted glob patterns
minimatch: minimatch: Denial of Service due to unbounded recursive backtracking via crafted glob patterns
minimatch is a minimal matching utility for converting glob expressions into JavaScript RegExp objects. Prior to version 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2, 5.1.8, 4.2.5, and 3.1.3, `matchOne()` performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent `**` (GLOBSTAR) segments and the input path does not match. The time complexity is O(C(n, k)) -- binomial -- where `n` is the number of path segments and `k` is the number of globstars. With k=11 and n=30, a call to the default `minimatch()` API stalls for roughly 5 seconds. With k=13, it exceeds 15 seconds. No memoization or call budget exists to bound this behavior. Any application where an attacker
Debian
CVE-2026-27903: node-minimatch - minimatch is a minimal matching utility for converting glob expressions into Jav...
vendor_debian·2026·CVSS 7.5
CVE-2026-27903 [HIGH] CVE-2026-27903: node-minimatch - minimatch is a minimal matching utility for converting glob expressions into Jav...
minimatch is a minimal matching utility for converting glob expressions into JavaScript RegExp objects. Prior to version 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2, 5.1.8, 4.2.5, and 3.1.3, `matchOne()` performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent `**` (GLOBSTAR) segments and the input path does not match. The time complexity is O(C(n, k)) -- binomial -- where `n` is the number of path segments and `k` is the number of globstars. With k=11 and n=30, a call to the default `minimatch()` API stalls for roughly 5 seconds. With k=13, it exceeds 15 seconds. No memoization or call budget exists to bound this behavior. Any application where an attacker can influence the glob pattern passed to `minimatch()` is vulnerable. The realistic attack surface includes
No detection rules found.
No public exploits indexed.
2026-02-26
Published