CVE-2026-43967— Quadratic fragment-name uniqueness check causes denial of service in absinthe

Quadratic fragment-name uniqueness check causes denial of service in absinthe

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.

N/A

算法复杂性

Absinthe 安全漏洞

Absinthe是Absinthe开源的一个基于Elixir的GraphQL实现框架。 Absinthe 1.2.0至1.10.2之前版本存在安全漏洞，该漏洞源于片段名称唯一性验证存在二次算法复杂度问题，可能导致未经身份验证的拒绝服务攻击。

N/A

N/A