minimatch: Inefficient Regular Expression Complexity
CVE-2022-3517 is a high-severity inefficient regular expression complexity vulnerability in minimatch, 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. Affected minimatch versions: minimatch versions prior to 3.0.5. The record does not name a fixed version, so check the vendor advisory. There is no confirmed exploitation so far. EPSS estimates a 2.28% chance of exploitation within 30 days, higher than 83% of scored CVEs.
High severity with no evidence of exploitation so far.
What to do
- Check which version of minimatch you run against the affected versions below, and install the vendor's latest release.
- Until you can update, restrict network access to the affected service so it is not reachable from untrusted networks.
Affected products and versions
| Vendor | Product | Affected versions | Fixed in |
|---|---|---|---|
| Minimatch | minimatch | minimatch versions prior to 3.0.5 | Not stated |
| Debian | Debian Linux | 10.0 | Not stated |
| Fedora Project | Fedora | 36; 37 | Not stated |
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 system | Score | Severity | Scored by |
|---|---|---|---|
| CVSS 3.1 | 7.5 | High | NVD |
| CVSS 3.1 | 7.5 | High | CISA (ADP) |
Official description
A vulnerability was found in the minimatch package. This flaw allows a Regular Expression Denial of Service (ReDoS) when calling the braceExpand function with specific arguments, resulting in a Denial of Service.
Source: the CVE record as published by its numbering authority, via NVD and CVE.org.
The underlying weakness: Inefficient Regular Expression Complexity
The product uses a regular expression with a worst-case computational complexity that is inefficient and possibly exponential.
How developers prevent this class of flaw
- Use regular expressions that do not support backtracking, e.g. by removing nested quantifiers.
- Set backtracking limits in the configuration of the regular expression implementation, such as PHP's pcre.backtrack_limit. Also consider limits on execution time for the process.
- Do not use regular expressions with untrusted input. If regular expressions must be used, avoid using backtracking in the expression.
More Inefficient Regular Expression Complexity vulnerabilities (CWE-1333)
Timeline
- CVE record published.
- CISA published its SSVC assessment (exploitation: none, automatable: yes, technical impact: partial).
- Record last changed materially (score, affected products, status or references).
References
Patches and release notes
- github.com/grafana/grafana-image-renderer/issues/329Issue Tracking, Third Party Advisory
- github.com/isaacs/minimatch/commit/a8763f4388e51956be62dc6025cec1126beeb5e6Third Party Advisory
Third-party and government advisories
- lists.debian.org/debian-lts-announce/2023/01/msg00011.htmlMailing List, Third Party Advisory
Other references
Recent Inefficient Regular Expression Complexity vulnerabilities
- 7.5 High severity
- 7.5 High severity
- 7.5 High severity
- 7.5 High severity
- 7.5 High severity
- 7.5 High severity
Spotted an error? Tell us.