<?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://vulnerability.circl.lu</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, 01 Oct 2026 19:42:41 +0000</lastBuildDate>
    <item>
      <title>Withdrawn: BELL-CVE-2026-90246 — CVE-2026-90246 does not affect BellSoft software</title>
      <link>https://vulnerability.circl.lu/vuln/bell-cve-2026-90246</link>
      <description>&lt;p&gt;&lt;strong&gt;Withdrawn by the publisher.&lt;/strong&gt;&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Withdrawn by the publisher.&lt;/strong&gt;&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/bell-cve-2026-90246</guid>
    </item>
    <item>
      <title>fkie_cve-2026-90246</title>
      <link>https://vulnerability.circl.lu/vuln/fkie_cve-2026-90246</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;apparmor: fix integer overflow in verify_tags() bounds check&lt;/p&gt;
&lt;p&gt;verify_tags() validates the tagset table unpacked from a policy blob.
For each set it reads a count and checks that advancing the index by
that count stays inside sets.table[]:&lt;/p&gt;
&lt;p&gt;u32 cnt = tags-&amp;gt;sets.table[i];&lt;/p&gt;
&lt;p&gt;if (i+cnt &amp;gt;= tags-&amp;gt;sets.size) {&lt;/p&gt;
&lt;p&gt;i, cnt and sets.size are all u32, so i+cnt is evaluated modulo 2^32.
sets.table[] is filled by unpack_tagsets() with aa_unpack_u32(), so
every entry is a raw unbounded 32-bit word taken from the policy blob,
and verify_tags() is the function that is supposed to validate it.  A
count close to U32_MAX makes the sum wrap to a small value, the guard
passes, and the inner loop then walks sets.table[++i] past the end of
the kcalloc(size, sizeof(u32)) allocation.&lt;/p&gt;
&lt;p&gt;Note that sets.size is bounded by 65535, because unpack_tagsets() reads
it with aa_unpack_array() as a u16, so the wrap cannot be reached by
growing the table; it is reached purely through the attacker-supplied
count.&lt;/p&gt;
&lt;p&gt;With sets.size = 2 and sets.table = { 0, 0xffffffff }:&lt;/p&gt;
&lt;p&gt;i = 0: cnt = 0, guard 0 + 0 &amp;gt;= 2 is false, inner loop does not run
  i = 1: cnt = 0xffffffff, guard (1 + 0xffffffff) mod 2^32 == 0 &amp;gt;= 2 is
         false, so the guard is bypassed and the inner loop reads
         sets.table[2] -- one element past a two element allocation&lt;/p&gt;
&lt;p&gt;The walk continues until an out-of-bounds value happens to be &amp;gt;=
hdrs.size or the access faults, so a crafted…&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;apparmor: fix integer overflow in verify_tags() bounds check&lt;/p&gt;
&lt;p&gt;verify_tags() validates the tagset table unpacked from a policy blob.
For each set it reads a count and checks that advancing the index by
that count stays inside sets.table[]:&lt;/p&gt;
&lt;p&gt;u32 cnt = tags-&amp;gt;sets.table[i];&lt;/p&gt;
&lt;p&gt;if (i+cnt &amp;gt;= tags-&amp;gt;sets.size) {&lt;/p&gt;
&lt;p&gt;i, cnt and sets.size are all u32, so i+cnt is evaluated modulo 2^32.
sets.table[] is filled by unpack_tagsets() with aa_unpack_u32(), so
every entry is a raw unbounded 32-bit word taken from the policy blob,
and verify_tags() is the function that is supposed to validate it.  A
count close to U32_MAX makes the sum wrap to a small value, the guard
passes, and the inner loop then walks sets.table[++i] past the end of
the kcalloc(size, sizeof(u32)) allocation.&lt;/p&gt;
&lt;p&gt;Note that sets.size is bounded by 65535, because unpack_tagsets() reads
it with aa_unpack_array() as a u16, so the wrap cannot be reached by
growing the table; it is reached purely through the attacker-supplied
count.&lt;/p&gt;
&lt;p&gt;With sets.size = 2 and sets.table = { 0, 0xffffffff }:&lt;/p&gt;
&lt;p&gt;i = 0: cnt = 0, guard 0 + 0 &amp;gt;= 2 is false, inner loop does not run
  i = 1: cnt = 0xffffffff, guard (1 + 0xffffffff) mod 2^32 == 0 &amp;gt;= 2 is
         false, so the guard is bypassed and the inner loop reads
         sets.table[2] -- one element past a two element allocation&lt;/p&gt;
&lt;p&gt;The walk continues until an out-of-bounds value happens to be &amp;gt;=
hdrs.size or the access faults, so a crafted…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/fkie_cve-2026-90246</guid>
    </item>
    <item>
      <title>GHSA-jvqw-3p6q-2fgx</title>
      <link>https://vulnerability.circl.lu/vuln/ghsa-jvqw-3p6q-2fgx</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;apparmor: fix integer overflow in verify_tags() bounds check&lt;/p&gt;
&lt;p&gt;verify_tags() validates the tagset table unpacked from a policy blob.
For each set it reads a count and checks that advancing the index by
that count stays inside sets.table[]:&lt;/p&gt;
&lt;p&gt;u32 cnt = tags-&amp;gt;sets.table[i];&lt;/p&gt;
&lt;p&gt;if (i+cnt &amp;gt;= tags-&amp;gt;sets.size) {&lt;/p&gt;
&lt;p&gt;i, cnt and sets.size are all u32, so i+cnt is evaluated modulo 2^32.
sets.table[] is filled by unpack_tagsets() with aa_unpack_u32(), so
every entry is a raw unbounded 32-bit word taken from the policy blob,
and verify_tags() is the function that is supposed to validate it.  A
count close to U32_MAX makes the sum wrap to a small value, the guard
passes, and the inner loop then walks sets.table[++i] past the end of
the kcalloc(size, sizeof(u32)) allocation.&lt;/p&gt;
&lt;p&gt;Note that sets.size is bounded by 65535, because unpack_tagsets() reads
it with aa_unpack_array() as a u16, so the wrap cannot be reached by
growing the table; it is reached purely through the attacker-supplied
count.&lt;/p&gt;
&lt;p&gt;With sets.size = 2 and sets.table = { 0, 0xffffffff }:&lt;/p&gt;
&lt;p&gt;i = 0: cnt = 0, guard 0 + 0 &amp;gt;= 2 is false, inner loop does not run
  i = 1: cnt = 0xffffffff, guard (1 + 0xffffffff) mod 2^32 == 0 &amp;gt;= 2 is
         false, so the guard is bypassed and the inner loop reads
         sets.table[2] -- one element past a two element allocation&lt;/p&gt;
&lt;p&gt;The walk continues until an out-of-bounds value happens to be &amp;gt;=
hdrs.size or the access faults, so a crafted…&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;apparmor: fix integer overflow in verify_tags() bounds check&lt;/p&gt;
&lt;p&gt;verify_tags() validates the tagset table unpacked from a policy blob.
For each set it reads a count and checks that advancing the index by
that count stays inside sets.table[]:&lt;/p&gt;
&lt;p&gt;u32 cnt = tags-&amp;gt;sets.table[i];&lt;/p&gt;
&lt;p&gt;if (i+cnt &amp;gt;= tags-&amp;gt;sets.size) {&lt;/p&gt;
&lt;p&gt;i, cnt and sets.size are all u32, so i+cnt is evaluated modulo 2^32.
sets.table[] is filled by unpack_tagsets() with aa_unpack_u32(), so
every entry is a raw unbounded 32-bit word taken from the policy blob,
and verify_tags() is the function that is supposed to validate it.  A
count close to U32_MAX makes the sum wrap to a small value, the guard
passes, and the inner loop then walks sets.table[++i] past the end of
the kcalloc(size, sizeof(u32)) allocation.&lt;/p&gt;
&lt;p&gt;Note that sets.size is bounded by 65535, because unpack_tagsets() reads
it with aa_unpack_array() as a u16, so the wrap cannot be reached by
growing the table; it is reached purely through the attacker-supplied
count.&lt;/p&gt;
&lt;p&gt;With sets.size = 2 and sets.table = { 0, 0xffffffff }:&lt;/p&gt;
&lt;p&gt;i = 0: cnt = 0, guard 0 + 0 &amp;gt;= 2 is false, inner loop does not run
  i = 1: cnt = 0xffffffff, guard (1 + 0xffffffff) mod 2^32 == 0 &amp;gt;= 2 is
         false, so the guard is bypassed and the inner loop reads
         sets.table[2] -- one element past a two element allocation&lt;/p&gt;
&lt;p&gt;The walk continues until an out-of-bounds value happens to be &amp;gt;=
hdrs.size or the access faults, so a crafted…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/ghsa-jvqw-3p6q-2fgx</guid>
    </item>
    <item>
      <title>openSUSE-SU-2026:11880-1 — kernel-devel-7.2.7-1.1 on GA media</title>
      <link>https://vulnerability.circl.lu/vuln/opensuse-su-2026:11880-1</link>
      <description>&lt;p&gt;kernel-devel-7.2.7-1.1 on GA media&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;kernel-devel-7.2.7-1.1 on GA media&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/opensuse-su-2026:11880-1</guid>
    </item>
    <item>
      <title>UBUNTU-CVE-2026-90246</title>
      <link>https://vulnerability.circl.lu/vuln/ubuntu-cve-2026-90246</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:16.04:LTS: linux-hwe-edge, Ubuntu:18.04:LTS: linux-aws-5.0, Ubuntu:18.04:LTS: linux-aws-5.3, Ubuntu:18.04:LTS: linux-azure, Ubuntu:18.04:LTS: linux-azure-5.3, Ubuntu:18.04:LTS: linux-azure-edge, Ubuntu:18.04:LTS: linux-gcp, Ubuntu:18.04:LTS: linux-gcp-5.3, Ubuntu:18.04:LTS: linux-gke-4.15, Ubuntu:18.04:LTS: linux-gke-5.4 and 118 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: apparmor: fix integer overflow in verify_tags() bounds check verify_tags() validates the tagset table unpacked from a policy blob. For each set it reads a count and checks that advancing the index by that count stays inside sets.table[]: 	u32 cnt = tags-&amp;gt;sets.table[i]; 	if (i+cnt &amp;gt;= tags-&amp;gt;sets.size) { i, cnt and sets.size are all u32, so i+cnt is evaluated modulo 2^32. sets.table[] is filled by unpack_tagsets() with aa_unpack_u32(), so every entry is a raw unbounded 32-bit word taken from the policy blob, and verify_tags() is the function that is supposed to validate it.  A count close to U32_MAX makes the sum wrap to a small value, the guard passes, and the inner loop then walks sets.table[++i] past the end of the kcalloc(size, sizeof(u32)) allocation. Note that sets.size is bounded by 65535, because unpack_tagsets() reads it with aa_unpack_array() as a u16, so the wrap cannot be reached by growing the table; it is reached purely through the attacker-supplied count. With sets.size = 2 and sets.table = { 0, 0xffffffff }:   i = 0: cnt = 0, guard 0 + 0 &amp;gt;= 2 is false, inner loop does not run   i = 1: cnt = 0xffffffff, guard (1 + 0xffffffff) mod 2^32 == 0 &amp;gt;= 2 is          false, so the guard is bypassed and the inner loop reads          sets.table[2] -- one element past a two element allocation The walk continues until an out-of-bounds value happens to be &amp;gt;= hdrs.size or the access faults, so a crafted policy yi…&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:16.04:LTS: linux-hwe-edge, Ubuntu:18.04:LTS: linux-aws-5.0, Ubuntu:18.04:LTS: linux-aws-5.3, Ubuntu:18.04:LTS: linux-azure, Ubuntu:18.04:LTS: linux-azure-5.3, Ubuntu:18.04:LTS: linux-azure-edge, Ubuntu:18.04:LTS: linux-gcp, Ubuntu:18.04:LTS: linux-gcp-5.3, Ubuntu:18.04:LTS: linux-gke-4.15, Ubuntu:18.04:LTS: linux-gke-5.4 and 118 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: apparmor: fix integer overflow in verify_tags() bounds check verify_tags() validates the tagset table unpacked from a policy blob. For each set it reads a count and checks that advancing the index by that count stays inside sets.table[]: 	u32 cnt = tags-&amp;gt;sets.table[i]; 	if (i+cnt &amp;gt;= tags-&amp;gt;sets.size) { i, cnt and sets.size are all u32, so i+cnt is evaluated modulo 2^32. sets.table[] is filled by unpack_tagsets() with aa_unpack_u32(), so every entry is a raw unbounded 32-bit word taken from the policy blob, and verify_tags() is the function that is supposed to validate it.  A count close to U32_MAX makes the sum wrap to a small value, the guard passes, and the inner loop then walks sets.table[++i] past the end of the kcalloc(size, sizeof(u32)) allocation. Note that sets.size is bounded by 65535, because unpack_tagsets() reads it with aa_unpack_array() as a u16, so the wrap cannot be reached by growing the table; it is reached purely through the attacker-supplied count. With sets.size = 2 and sets.table = { 0, 0xffffffff }:   i = 0: cnt = 0, guard 0 + 0 &amp;gt;= 2 is false, inner loop does not run   i = 1: cnt = 0xffffffff, guard (1 + 0xffffffff) mod 2^32 == 0 &amp;gt;= 2 is          false, so the guard is bypassed and the inner loop reads          sets.table[2] -- one element past a two element allocation The walk continues until an out-of-bounds value happens to be &amp;gt;= hdrs.size or the access faults, so a crafted policy yi…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/ubuntu-cve-2026-90246</guid>
    </item>
  </channel>
</rss>
