CVE Catalog

CVE-2026-43967

High
Published: Translated: NVD NIST

Summary

The vulnerability in absinthe-graphql absinthe related to inefficient algorithmic complexity allows unauthenticated denial of service via quadratic fragment-name uniqueness validation.

Risk Assessment

An attacker can exploit this vulnerability to perform a denial of service attack, potentially causing significant downtime for the application.

Recommendation

It is recommended to upgrade to absinthe-graphql version 1.10.2 or later to mitigate the risks associated with this vulnerability.

Other vulnerabilities in absinthe-graphql

Original NVD description (English source)

Inefficient Algorithmic Complexity vulnerability in absinthe-graphql absinthe allows unauthenticated denial of service via quadratic fragment-name uniqueness validation. 'Elixir.Absinthe.Phase.Document.Validation.UniqueFragmentNames':run/2 iterates over all fragments and for each one calls duplicate?/2, which evaluates Enum.count(fragments, &(&1.name == name)) — a full linear scan of the fragment list. The result is O(N²) comparisons per document, where N is the number of fragment definitions supplied by the caller. Because input.fragments is built directly from the GraphQL query body, N is fully attacker-controlled. A minimum-size fragment definition is roughly 16 bytes, so a ~1 MB document carries ~60,000 fragments and forces ~3.6 × 10⁹ comparisons inside this single validation phase. No authentication, schema knowledge, or special configuration is required. This issue affects absinthe: from 1.2.0 before 1.10.2.

Vulnerability data from NVD (NIST) · CISA KEV · EPSS