forever vulnerabilities

• Vulnerable module: hoek
• Introduced through: flatiron@0.3.11, forever-monitor@1.4.0 and others

Detailed paths

• Introduced through: forever@0.12.0 > flatiron@0.3.11 > broadway@0.2.9 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2 > hoek@0.7.6
• Introduced through: forever@0.12.0 > forever-monitor@1.4.0 > broadway@0.2.10 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2 > hoek@0.7.6
• Introduced through: forever@0.12.0 > winston@0.7.3 > request@2.16.6 > hawk@0.10.2 > hoek@0.7.6
• Introduced through: forever@0.12.0 > flatiron@0.3.11 > broadway@0.2.9 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2 > boom@0.3.8 > hoek@0.7.6
• Introduced through: forever@0.12.0 > forever-monitor@1.4.0 > broadway@0.2.10 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2 > boom@0.3.8 > hoek@0.7.6
• Introduced through: forever@0.12.0 > winston@0.7.3 > request@2.16.6 > hawk@0.10.2 > boom@0.3.8 > hoek@0.7.6
• Introduced through: forever@0.12.0 > flatiron@0.3.11 > broadway@0.2.9 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2 > cryptiles@0.1.3 > boom@0.3.8 > hoek@0.7.6
• Introduced through: forever@0.12.0 > forever-monitor@1.4.0 > broadway@0.2.10 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2 > cryptiles@0.1.3 > boom@0.3.8 > hoek@0.7.6
• Introduced through: forever@0.12.0 > winston@0.7.3 > request@2.16.6 > hawk@0.10.2 > cryptiles@0.1.3 > boom@0.3.8 > hoek@0.7.6
• Introduced through: forever@0.12.0 > flatiron@0.3.11 > broadway@0.2.9 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2 > sntp@0.1.4 > hoek@0.7.6
• Introduced through: forever@0.12.0 > forever-monitor@1.4.0 > broadway@0.2.10 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2 > sntp@0.1.4 > hoek@0.7.6
• Introduced through: forever@0.12.0 > winston@0.7.3 > request@2.16.6 > hawk@0.10.2 > sntp@0.1.4 > hoek@0.7.6

Overview

hoek is a Utility methods for the hapi ecosystem.

Affected versions of this package are vulnerable to Prototype Pollution. The utilities function allow modification of the Object prototype. If an attacker can control part of the structure passed to this function, they could add or modify an existing property.

PoC by Olivier Arteau (HoLyVieR)

var Hoek = require('hoek');
var malicious_payload = '{"__proto__":{"oops":"It works !"}}';

var a = {};
console.log("Before : " + a.oops);
Hoek.merge({}, JSON.parse(malicious_payload));
console.log("After : " + a.oops);

Remediation

Upgrade hoek to versions 4.2.1, 5.0.3 or higher.

References

• HackerOne Report
• GitHub PR
• GitHub Issue - 4.2.1 Backport
• GitHub Commit 5.0.3
• GitHub Commit 4.2.x

• Vulnerable module: hawk
• Introduced through: flatiron@0.3.11, forever-monitor@1.4.0 and others

Detailed paths

• Introduced through: forever@0.12.0 > flatiron@0.3.11 > broadway@0.2.9 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2
• Introduced through: forever@0.12.0 > forever-monitor@1.4.0 > broadway@0.2.10 > winston@0.7.2 > request@2.16.6 > hawk@0.10.2
• Introduced through: forever@0.12.0 > winston@0.7.3 > request@2.16.6 > hawk@0.10.2

Overview

hawk is an HTTP authentication scheme using a message authentication code (MAC) algorithm to provide partial HTTP request cryptographic verification.

Affected versions of this package are vulnerable to Regular Expression Denial of Service (ReDoS) attacks.

Details

Denial of Service (DoS) describes a family of attacks, all aimed at making a system inaccessible to its original and legitimate users. There are many types of DoS attacks, ranging from trying to clog the network pipes to the system by generating a large volume of traffic from many machines (a Distributed Denial of Service - DDoS - attack) to sending crafted requests that cause a system to crash or take a disproportional amount of time to process.

The Regular expression Denial of Service (ReDoS) is a type of Denial of Service attack. Regular expressions are incredibly powerful, but they aren't very intuitive and can ultimately end up making it easy for attackers to take your site down.

Let’s take the following regular expression as an example:

regex = /A(B|C+)+D/

This regular expression accomplishes the following:

• A The string must start with the letter 'A'
• (B|C+)+ The string must then follow the letter A with either the letter 'B' or some number of occurrences of the letter 'C' (the + matches one or more times). The + at the end of this section states that we can look for one or more matches of this section.
• D Finally, we ensure this section of the string ends with a 'D'

The expression would match inputs such as ABBD, ABCCCCD, ABCBCCCD and ACCCCCD

It most cases, it doesn't take very long for a regex engine to find a match:

$ time node -e '/A(B|C+)+D/.test("ACCCCCCCCCCCCCCCCCCCCCCCCCCCCD")'
0.04s user 0.01s system 95% cpu 0.052 total

$ time node -e '/A(B|C+)+D/.test("ACCCCCCCCCCCCCCCCCCCCCCCCCCCCX")'
1.79s user 0.02s system 99% cpu 1.812 total

The entire process of testing it against a 30 characters long string takes around ~52ms. But when given an invalid string, it takes nearly two seconds to complete the test, over ten times as long as it took to test a valid string. The dramatic difference is due to the way regular expressions get evaluated.

Most Regex engines will work very similarly (with minor differences). The engine will match the first possible way to accept the current character and proceed to the next one. If it then fails to match the next one, it will backtrack and see if there was another way to digest the previous character. If it goes too far down the rabbit hole only to find out the string doesn’t match in the end, and if many characters have multiple valid regex paths, the number of backtracking steps can become very large, resulting in what is known as catastrophic backtracking.

Let's look at how our expression runs into this problem, using a shorter string: "ACCCX". While it seems fairly straightforward, there are still four different ways that the engine could match those three C's:

1. CCC
2. CC+C
3. C+CC
4. C+C+C.

The engine has to try each of those combinations to see if any of them potentially match against the expression. When you combine that with the other steps the engine must take, we can use RegEx 101 debugger to see the engine has to take a total of 38 steps before it can determine the string doesn't match.

From there, the number of steps the engine must use to validate a string just continues to grow.

By the time the string includes 14 C's, the engine has to take over 65,000 steps just to see if the string is valid. These extreme situations can cause them to work very slowly (exponentially related to input size, as shown above), allowing an attacker to exploit this and can cause the service to excessively consume CPU, resulting in a Denial of Service.

You can read more about Regular Expression Denial of Service (ReDoS) on our blog.

References

• GitHub Issue

• Vulnerable module: mime
• Introduced through: flatiron@0.3.11, forever-monitor@1.4.0 and others

Detailed paths

• Introduced through: forever@0.12.0 > flatiron@0.3.11 > broadway@0.2.9 > winston@0.7.2 > request@2.16.6 > mime@1.2.11
• Introduced through: forever@0.12.0 > forever-monitor@1.4.0 > broadway@0.2.10 > winston@0.7.2 > request@2.16.6 > mime@1.2.11
• Introduced through: forever@0.12.0 > winston@0.7.3 > request@2.16.6 > mime@1.2.11
• Introduced through: forever@0.12.0 > flatiron@0.3.11 > broadway@0.2.9 > winston@0.7.2 > request@2.16.6 > form-data@0.0.10 > mime@1.2.11
• Introduced through: forever@0.12.0 > forever-monitor@1.4.0 > broadway@0.2.10 > winston@0.7.2 > request@2.16.6 > form-data@0.0.10 > mime@1.2.11
• Introduced through: forever@0.12.0 > winston@0.7.3 > request@2.16.6 > form-data@0.0.10 > mime@1.2.11

Overview

mime is a comprehensive, compact MIME type module.

Affected versions of this package are vulnerable to Regular expression Denial of Service (ReDoS). It uses regex the following regex /.*[\.\/\\]/ in its lookup, which can cause a slowdown of 2 seconds for 50k characters.

The Regular expression Denial of Service (ReDoS) is a type of Denial of Service attack. Many Regular Expression implementations may reach extreme situations that cause them to work very slowly (exponentially related to input size), allowing an attacker to exploit this and can cause the program to enter these extreme situations by using a specially crafted input and cause the service to excessively consume CPU, resulting in a Denial of Service.

Details

Denial of Service (DoS) describes a family of attacks, all aimed at making a system inaccessible to its original and legitimate users. There are many types of DoS attacks, ranging from trying to clog the network pipes to the system by generating a large volume of traffic from many machines (a Distributed Denial of Service - DDoS - attack) to sending crafted requests that cause a system to crash or take a disproportional amount of time to process.

The Regular expression Denial of Service (ReDoS) is a type of Denial of Service attack. Regular expressions are incredibly powerful, but they aren't very intuitive and can ultimately end up making it easy for attackers to take your site down.

Let’s take the following regular expression as an example:

regex = /A(B|C+)+D/

This regular expression accomplishes the following:

• A The string must start with the letter 'A'
• (B|C+)+ The string must then follow the letter A with either the letter 'B' or some number of occurrences of the letter 'C' (the + matches one or more times). The + at the end of this section states that we can look for one or more matches of this section.
• D Finally, we ensure this section of the string ends with a 'D'

The expression would match inputs such as ABBD, ABCCCCD, ABCBCCCD and ACCCCCD

It most cases, it doesn't take very long for a regex engine to find a match:

$ time node -e '/A(B|C+)+D/.test("ACCCCCCCCCCCCCCCCCCCCCCCCCCCCD")'
0.04s user 0.01s system 95% cpu 0.052 total

$ time node -e '/A(B|C+)+D/.test("ACCCCCCCCCCCCCCCCCCCCCCCCCCCCX")'
1.79s user 0.02s system 99% cpu 1.812 total

The entire process of testing it against a 30 characters long string takes around ~52ms. But when given an invalid string, it takes nearly two seconds to complete the test, over ten times as long as it took to test a valid string. The dramatic difference is due to the way regular expressions get evaluated.

Most Regex engines will work very similarly (with minor differences). The engine will match the first possible way to accept the current character and proceed to the next one. If it then fails to match the next one, it will backtrack and see if there was another way to digest the previous character. If it goes too far down the rabbit hole only to find out the string doesn’t match in the end, and if many characters have multiple valid regex paths, the number of backtracking steps can become very large, resulting in what is known as catastrophic backtracking.

Let's look at how our expression runs into this problem, using a shorter string: "ACCCX". While it seems fairly straightforward, there are still four different ways that the engine could match those three C's:

1. CCC
2. CC+C
3. C+CC
4. C+C+C.

The engine has to try each of those combinations to see if any of them potentially match against the expression. When you combine that with the other steps the engine must take, we can use RegEx 101 debugger to see the engine has to take a total of 38 steps before it can determine the string doesn't match.

From there, the number of steps the engine must use to validate a string just continues to grow.

By the time the string includes 14 C's, the engine has to take over 65,000 steps just to see if the string is valid. These extreme situations can cause them to work very slowly (exponentially related to input size, as shown above), allowing an attacker to exploit this and can cause the service to excessively consume CPU, resulting in a Denial of Service.

Remediation

Upgrade mime to versions 1.4.1, 2.0.3 or higher.

References

• Github Issue
• Github Commit 1.x
• Github Commit 2.0.x