<?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>Fri, 02 Oct 2026 15:27:07 +0000</lastBuildDate>
    <item>
      <title>bdu:2026-10771</title>
      <link>https://cve.radiocsirt.org/vuln/bdu:2026-10771</link>
      <description>bdu:2026-10771</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/bdu:2026-10771</guid>
    </item>
    <item>
      <title>EUVD-2026-342759</title>
      <link>https://cve.radiocsirt.org/vuln/euvd-2026-342759</link>
      <description>EUVD-2026-342759</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/euvd-2026-342759</guid>
    </item>
    <item>
      <title>fkie_cve-2026-67216</title>
      <link>https://cve.radiocsirt.org/vuln/fkie_cve-2026-67216</link>
      <description>&lt;p&gt;cJSON through 1.7.19 contains an inefficient algorithmic complexity flaw in cJSON_Compare(). When comparing objects, the function recurses into each shared subtree twice, once in each direction, with no depth guard, making the running time exponential in nesting depth. A small, deeply nested document of a few hundred bytes (depth around 40) compared for equality consumes hours of CPU, and the cost roughly doubles with each additional level of nesting. An application that calls cJSON_Compare() on attacker-influenced JSON that is structurally equal to a reference document is exposed to a denial-of-service condition.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;cJSON through 1.7.19 contains an inefficient algorithmic complexity flaw in cJSON_Compare(). When comparing objects, the function recurses into each shared subtree twice, once in each direction, with no depth guard, making the running time exponential in nesting depth. A small, deeply nested document of a few hundred bytes (depth around 40) compared for equality consumes hours of CPU, and the cost roughly doubles with each additional level of nesting. An application that calls cJSON_Compare() on attacker-influenced JSON that is structurally equal to a reference document is exposed to a denial-of-service condition.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/fkie_cve-2026-67216</guid>
    </item>
    <item>
      <title>GHSA-ff2v-f99f-wm3f</title>
      <link>https://cve.radiocsirt.org/vuln/ghsa-ff2v-f99f-wm3f</link>
      <description>&lt;p&gt;cJSON through 1.7.19 contains an inefficient algorithmic complexity flaw in cJSON_Compare(). When comparing objects, the function recurses into each shared subtree twice, once in each direction, with no depth guard, making the running time exponential in nesting depth. A small, deeply nested document of a few hundred bytes (depth around 40) compared for equality consumes hours of CPU, and the cost roughly doubles with each additional level of nesting. An application that calls cJSON_Compare() on attacker-influenced JSON that is structurally equal to a reference document is exposed to a denial-of-service condition.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;cJSON through 1.7.19 contains an inefficient algorithmic complexity flaw in cJSON_Compare(). When comparing objects, the function recurses into each shared subtree twice, once in each direction, with no depth guard, making the running time exponential in nesting depth. A small, deeply nested document of a few hundred bytes (depth around 40) compared for equality consumes hours of CPU, and the cost roughly doubles with each additional level of nesting. An application that calls cJSON_Compare() on attacker-influenced JSON that is structurally equal to a reference document is exposed to a denial-of-service condition.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ghsa-ff2v-f99f-wm3f</guid>
    </item>
    <item>
      <title>msrc_CVE-2026-67216 — cJSON cJSON_Compare Exponential Complexity Denial of Service</title>
      <link>https://cve.radiocsirt.org/vuln/msrc_cve-2026-67216</link>
      <description>msrc_CVE-2026-67216</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/msrc_cve-2026-67216</guid>
    </item>
    <item>
      <title>UBUNTU-CVE-2026-67216</title>
      <link>https://cve.radiocsirt.org/vuln/ubuntu-cve-2026-67216</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:Pro:16.04:LTS: iperf3, Ubuntu:16.04:LTS: mapcache, Ubuntu:Pro:18.04:LTS: iperf3, Ubuntu:18.04:LTS: mapcache, Ubuntu:Pro:20.04:LTS: cjson, Ubuntu:Pro:20.04:LTS: iperf3, Ubuntu:20.04:LTS: mapcache, Ubuntu:22.04:LTS: mapcache, Ubuntu:Pro:22.04:LTS: cjson, Ubuntu:Pro:22.04:LTS: iperf3 and 7 more&lt;/p&gt;
&lt;p&gt;cJSON through 1.7.19 contains an inefficient algorithmic complexity flaw in cJSON_Compare(). When comparing objects, the function recurses into each shared subtree twice, once in each direction, with no depth guard, making the running time exponential in nesting depth. A small, deeply nested document of a few hundred bytes (depth around 40) compared for equality consumes hours of CPU, and the cost roughly doubles with each additional level of nesting. An application that calls cJSON_Compare() on attacker-influenced JSON that is structurally equal to a reference document is exposed to a denial-of-service condition.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:Pro:16.04:LTS: iperf3, Ubuntu:16.04:LTS: mapcache, Ubuntu:Pro:18.04:LTS: iperf3, Ubuntu:18.04:LTS: mapcache, Ubuntu:Pro:20.04:LTS: cjson, Ubuntu:Pro:20.04:LTS: iperf3, Ubuntu:20.04:LTS: mapcache, Ubuntu:22.04:LTS: mapcache, Ubuntu:Pro:22.04:LTS: cjson, Ubuntu:Pro:22.04:LTS: iperf3 and 7 more&lt;/p&gt;
&lt;p&gt;cJSON through 1.7.19 contains an inefficient algorithmic complexity flaw in cJSON_Compare(). When comparing objects, the function recurses into each shared subtree twice, once in each direction, with no depth guard, making the running time exponential in nesting depth. A small, deeply nested document of a few hundred bytes (depth around 40) compared for equality consumes hours of CPU, and the cost roughly doubles with each additional level of nesting. An application that calls cJSON_Compare() on attacker-influenced JSON that is structurally equal to a reference document is exposed to a denial-of-service condition.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ubuntu-cve-2026-67216</guid>
    </item>
  </channel>
</rss>
