<?xml version='1.0' encoding='UTF-8'?>
<?xml-stylesheet href="/static/style.xsl" type="text/xsl"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
  <id>https://cve.radiocsirt.org/rss/recent/all/10</id>
  <title>Most recent entries from all</title>
  <updated>2026-10-03T05:36:27.936705+00:00</updated>
  <author>
    <name>Vulnerability-Lookup</name>
    <email>csirt@opendfir.org</email>
  </author>
  <link href="https://cve.radiocsirt.org" rel="alternate"/>
  <generator uri="https://lkiesow.github.io/python-feedgen" version="1.0.0">python-feedgen</generator>
  <subtitle>Contains only the most 10 recent entries.</subtitle>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/bdu:2026-10771</id>
    <title>bdu:2026-10771</title>
    <updated>2026-10-03T05:36:28.036786+00:00</updated>
    <content>bdu:2026-10771</content>
    <link href="https://cve.radiocsirt.org/vuln/bdu:2026-10771"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/euvd-2026-342759</id>
    <title>EUVD-2026-342759</title>
    <updated>2026-10-03T05:36:28.036823+00:00</updated>
    <content>EUVD-2026-342759</content>
    <link href="https://cve.radiocsirt.org/vuln/euvd-2026-342759"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/fkie_cve-2026-67216</id>
    <title>fkie_cve-2026-67216</title>
    <updated>2026-10-03T05:36:28.036838+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml">
        <p>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.</p>
      </div>
    </content>
    <link href="https://cve.radiocsirt.org/vuln/fkie_cve-2026-67216"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/ghsa-ff2v-f99f-wm3f</id>
    <title>GHSA-ff2v-f99f-wm3f</title>
    <updated>2026-10-03T05:36:28.036869+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml">
        <p>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.</p>
      </div>
    </content>
    <link href="https://cve.radiocsirt.org/vuln/ghsa-ff2v-f99f-wm3f"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/msrc_cve-2026-67216</id>
    <title>msrc_CVE-2026-67216 — cJSON cJSON_Compare Exponential Complexity Denial of Service</title>
    <updated>2026-10-03T05:36:28.036889+00:00</updated>
    <content>msrc_CVE-2026-67216</content>
    <link href="https://cve.radiocsirt.org/vuln/msrc_cve-2026-67216"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/ubuntu-cve-2026-67216</id>
    <title>UBUNTU-CVE-2026-67216</title>
    <updated>2026-10-03T05:36:28.036906+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml"><p><strong>Affected:</strong> 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</p>
<p>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.</p></div>
    </content>
    <link href="https://cve.radiocsirt.org/vuln/ubuntu-cve-2026-67216"/>
  </entry>
</feed>
