Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

ReDoS vulnerability in prefixer/css-selector-prefixer.js #23

Open
Moyuchu opened this issue Jun 9, 2023 · 0 comments
Open

ReDoS vulnerability in prefixer/css-selector-prefixer.js #23

Moyuchu opened this issue Jun 9, 2023 · 0 comments

Comments

@Moyuchu
Copy link

Moyuchu commented Jun 9, 2023

Description

ReDoS vulnerability is an algorithmic complexity vulnerability that usually appears in backtracking-kind regex engines, e.g. the python default regex engine. The attacker can construct malicious input to trigger the worst-case time complexity of the regex engine to make a denial-of-service attack.

In this project, here has used the ReDoS vulnerable regex (--)(.*?)(?=:|\)) that can be triggered by the below PoC:

const arg = require('arg');
const args = arg(
    {
        '--foo': String
    },        {
        argv: ['-'.repeat(54773) + '\x00']
    }
);

How to repair

The cause of this vulnerability is the use of the backtracking-kind regex engine. I recommend the author to use the RE2 regex engine developed by google, but it doesn't support lookaround and backreference extension features, so we need to change the original regex and add additional code constraints. Here is my repair solution:

const RE2 = require('re2');
// (--)(.*?)(?=:|\))
function safe_match(string) {
    let res = [];
    const r1 = new RE2('(--)(.*?)', 'g');
    const r2 = new RE2('(:|\\))', 'g');
    let matches = r1.exec(string);
    r1.lastIndex = 0;
    for (let match of matches) {
        let end = string.indexOf(match) + match.length;
        let postfix = string.substr(end);
        if (r2.test(postfix)) {
            res.push(match);
        }
    }
    return res;
}

The match semantics of the new regex + code constraint above is equivalent to the original regex.

I hope the author can adopt this repair solution and I would be very grateful. Thanks!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant