<?xml version='1.0' encoding='UTF-8'?>
<?xml-stylesheet href="/static/style.xsl" type="text/xsl"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/" version="2.0">
  <channel>
    <title>Most recent entries from all</title>
    <link>https://cve.radiocsirt.org</link>
    <description>Contains only the most 10 recent entries.</description>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <generator>python-feedgen</generator>
    <language>en</language>
    <lastBuildDate>Thu, 08 Oct 2026 22:38:00 +0000</lastBuildDate>
    <item>
      <title>CVE-2026-43967 — Quadratic fragment-name uniqueness check causes denial of service in absinthe</title>
      <link>https://cve.radiocsirt.org/vuln/cve-2026-43967</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; absinthe-graphql absinthe&lt;/p&gt;
&lt;p&gt;Inefficient Algorithmic Complexity vulnerability in absinthe-graphql absinthe allows unauthenticated denial of service via quadratic fragment-name uniqueness validation.&lt;/p&gt;
&lt;p&gt;&amp;#39;Elixir.Absinthe.Phase.Document.Validation.UniqueFragmentNames&amp;#39;:run/2 iterates over all fragments and for each one calls duplicate?/2, which evaluates Enum.count(fragments, &amp;amp;(&amp;amp;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.&lt;/p&gt;
&lt;p&gt;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.&lt;/p&gt;
&lt;p&gt;This issue affects absinthe: from 1.2.0 before 1.10.2.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; absinthe-graphql absinthe&lt;/p&gt;
&lt;p&gt;Inefficient Algorithmic Complexity vulnerability in absinthe-graphql absinthe allows unauthenticated denial of service via quadratic fragment-name uniqueness validation.&lt;/p&gt;
&lt;p&gt;&amp;#39;Elixir.Absinthe.Phase.Document.Validation.UniqueFragmentNames&amp;#39;:run/2 iterates over all fragments and for each one calls duplicate?/2, which evaluates Enum.count(fragments, &amp;amp;(&amp;amp;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.&lt;/p&gt;
&lt;p&gt;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.&lt;/p&gt;
&lt;p&gt;This issue affects absinthe: from 1.2.0 before 1.10.2.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/cve-2026-43967</guid>
    </item>
  </channel>
</rss>
