NYC version 6.1.1 is a minor patch release over version 6.1.0 in the popular code coverage tool designed to work seamlessly with subprocesses. Both versions, described as tools that "work well with subprocesses", share an identical core set of dependencies, including crucial packages like glob for file matching, yargs for command-line argument parsing, istanbul for the core coverage analysis, and source-map for working with source maps. Developers relying on these core functionalities will find the fundamental behavior unchanged.
However, version 6.1.1 includes some key enhancements with bug fixes and internal tweaks that might improve stability, performance, or compatibility in specific edge cases. From a developer perspective, while the feature set remains consistent, upgrading to 6.1.1 ensures you're benefiting from the latest refinements and potential error resolutions. The dependency tree is identical in both versions, suggesting no new features or major version upgrades in underlying libraries. Both leverage a collection of devDependencies for the development and testing workflow, including tap for testing, chai and sinon for assertions and mocking, and standard for code style linting. The critical detail lies under the hood. The release date for 6.1.1 is March 14, 2016, a day after the release date of 6.1.0 (March 13, 2016). A fast patch like this suggests the fixes here might be urgent.
All the vulnerabilities related to the version 6.1.1 of the package
yargs-parser Vulnerable to Prototype Pollution
Affected versions of yargs-parser
are vulnerable to prototype pollution. Arguments are not properly sanitized, allowing an attacker to modify the prototype of Object
, causing the addition or modification of an existing property that will exist on all objects.
Parsing the argument --foo.__proto__.bar baz'
adds a bar
property with value baz
to all objects. This is only exploitable if attackers have control over the arguments being passed to yargs-parser
.
Upgrade to versions 13.1.2, 15.0.1, 18.1.1 or later.
Regular Expression Denial of Service (ReDoS) in micromatch
The NPM package micromatch
prior to version 4.0.8 is vulnerable to Regular Expression Denial of Service (ReDoS). The vulnerability occurs in micromatch.braces()
in index.js
because the pattern .*
will greedily match anything. By passing a malicious payload, the pattern matching will keep backtracking to the input while it doesn't find the closing bracket. As the input size increases, the consumption time will also increase until it causes the application to hang or slow down. There was a merged fix but further testing shows the issue persisted prior to https://github.com/micromatch/micromatch/pull/266. This issue should be mitigated by using a safe pattern that won't start backtracking the regular expression due to greedy matching.
Regular Expression Denial of Service (ReDoS) in braces
A vulnerability was found in Braces versions prior to 2.3.1. Affected versions of this package are vulnerable to Regular Expression Denial of Service (ReDoS) attacks.
Regular Expression Denial of Service in braces
Versions of braces
prior to 2.3.1 are vulnerable to Regular Expression Denial of Service (ReDoS). Untrusted input may cause catastrophic backtracking while matching regular expressions. This can cause the application to be unresponsive leading to Denial of Service.
Upgrade to version 2.3.1 or higher.
Uncontrolled resource consumption in braces
The NPM package braces
fails to limit the number of characters it can handle, which could lead to Memory Exhaustion. In lib/parse.js,
if a malicious user sends "imbalanced braces" as input, the parsing will enter a loop, which will cause the program to start allocating heap memory without freeing it at any moment of the loop. Eventually, the JavaScript heap limit is reached, and the program will crash.
Regular Expression Denial of Service (ReDoS) in cross-spawn
Versions of the package cross-spawn before 7.0.5 are vulnerable to Regular Expression Denial of Service (ReDoS) due to improper input sanitization. An attacker can increase the CPU usage and crash the program by crafting a very large and well crafted string.