{"affected":[{"package":{"ecosystem":"Hex","name":"absinthe","purl":"pkg:hex/absinthe"},"ranges":[{"events":[{"introduced":"1.2.0"},{"fixed":"1.10.2"}],"type":"SEMVER"}],"versions":["1.2.0","1.2.1","1.2.2","1.2.3","1.2.4","1.2.5","1.2.6","1.3.0-beta.0","1.3.0-beta.1","1.3.0-beta.2","1.3.0-rc.0","1.3.0","1.3.1","1.3.2","1.4.0-beta.1","1.4.0-beta.2","1.4.0-beta.3","1.4.0-beta.4","1.4.0-beta.5","1.4.0-rc.0","1.4.0-rc.1","1.4.0-rc.2","1.4.0-rc.3","1.4.0","1.4.1","1.4.2","1.4.3","1.4.4","1.4.5","1.4.6","1.4.7","1.4.8","1.4.9","1.4.10","1.4.11","1.4.12","1.4.13","1.4.14","1.4.15","1.4.16","1.5.0-alpha.0","1.5.0-alpha.1","1.5.0-alpha.2","1.5.0-alpha.3","1.5.0-alpha.4","1.5.0-beta.0","1.5.0-beta.1","1.5.0-beta.2","1.5.0-rc.0","1.5.0-rc.1","1.5.0-rc.2","1.5.0-rc.3","1.5.0-rc.4","1.5.0-rc.5","1.5.0","1.5.1","1.5.2","1.5.3","1.5.4","1.5.5","1.6.0-rc.0","1.6.0-rc.1","1.6.0","1.6.1","1.6.2","1.6.3","1.6.4","1.6.5","1.6.6","1.6.7","1.6.8","1.7.0","1.7.1","1.7.2","1.7.3","1.7.4","1.7.5","1.7.6","1.7.7","1.7.8","1.7.9","1.7.10","1.7.11","1.8.0","1.9.0","1.9.1","1.10.0","1.10.1"]},{"ranges":[{"events":[{"introduced":"0b46e3bcc06c0d3797bacd64761b908a84646c1d"},{"fixed":"223600c520493dcaf95080af552c413099f92c9d"}],"repo":"https://github.com/absinthe-graphql/absinthe","type":"GIT"}]}],"aliases":["GHSA-9mhv-8h52-q7q2","CVE-2026-43967"],"credits":[{"name":"Peter Ullrich","type":"FINDER"},{"name":"Curtis Schiewek","type":"REMEDIATION_DEVELOPER"}],"database_specific":{"capec_ids":["CAPEC-229"],"cpe_ids":["cpe:2.3:a:absinthe-graphql:absinthe:*:*:*:*:*:*:*:*"],"cwe_ids":["CWE-407"]},"details":"## Summary\n\nInefficient Algorithmic Complexity vulnerability in absinthe-graphql absinthe allows unauthenticated denial of service via quadratic fragment-name uniqueness validation.\n\n'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.\n\nBecause 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.\n\nThis issue affects absinthe: from 1.2.0 before 1.10.2.","id":"EEF-CVE-2026-43967","modified":"2026-05-08T15:42:34.347Z","published":"2026-05-08T15:42:34.347Z","references":[{"type":"ADVISORY","url":"https://github.com/absinthe-graphql/absinthe/security/advisories/GHSA-9mhv-8h52-q7q2"},{"type":"WEB","url":"https://cna.erlef.org/cves/CVE-2026-43967.html"},{"type":"FIX","url":"https://github.com/absinthe-graphql/absinthe/commit/223600c520493dcaf95080af552c413099f92c9d"},{"type":"PACKAGE","url":"https://hex.pm/packages/absinthe"}],"related":[],"schema_version":"1.7.3","severity":[{"score":"CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N","type":"CVSS_V4"}],"summary":"Quadratic fragment-name uniqueness check causes denial of service in absinthe","upstream":[]}