<?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>Sun, 04 Oct 2026 13:53:46 +0000</lastBuildDate>
    <item>
      <title>bdu:2026-03155</title>
      <link>https://cve.radiocsirt.org/vuln/bdu:2026-03155</link>
      <description>bdu:2026-03155</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/bdu:2026-03155</guid>
    </item>
    <item>
      <title>BELL-CVE-2025-68208</title>
      <link>https://cve.radiocsirt.org/vuln/bell-cve-2025-68208</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Alpaquita:25: linux-lts, Alpaquita:stream: linux-lts&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Alpaquita:25: linux-lts, Alpaquita:stream: linux-lts&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/bell-cve-2025-68208</guid>
    </item>
    <item>
      <title>certfr-2026-avi-0108 — De multiples vulnérabilités ont été découvertes dans le noyau Linux de SUSE. Certaines d'entre elles permettent à un at…</title>
      <link>https://cve.radiocsirt.org/vuln/certfr-2026-avi-0108</link>
      <description>certfr-2026-avi-0108</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/certfr-2026-avi-0108</guid>
    </item>
    <item>
      <title>EUVD-2026-347460</title>
      <link>https://cve.radiocsirt.org/vuln/euvd-2026-347460</link>
      <description>EUVD-2026-347460</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/euvd-2026-347460</guid>
    </item>
    <item>
      <title>fkie_cve-2025-68208</title>
      <link>https://cve.radiocsirt.org/vuln/fkie_cve-2025-68208</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;bpf: account for current allocated stack depth in widen_imprecise_scalars()&lt;/p&gt;
&lt;p&gt;The usage pattern for widen_imprecise_scalars() looks as follows:&lt;/p&gt;
&lt;p&gt;prev_st = find_prev_entry(env, ...);
    queued_st = push_stack(...);
    widen_imprecise_scalars(env, prev_st, queued_st);&lt;/p&gt;
&lt;p&gt;Where prev_st is an ancestor of the queued_st in the explored states
tree. This ancestor is not guaranteed to have same allocated stack
depth as queued_st. E.g. in the following case:&lt;/p&gt;
&lt;p&gt;def main():
      for i in 1..2:
        foo(i)        // same callsite, differnt param&lt;/p&gt;
&lt;p&gt;def foo(i):
      if i == 1:
        use 128 bytes of stack
      iterator based loop&lt;/p&gt;
&lt;p&gt;Here, for a second &amp;#39;foo&amp;#39; call prev_st-&amp;gt;allocated_stack is 128,
while queued_st-&amp;gt;allocated_stack is much smaller.
widen_imprecise_scalars() needs to take this into account and avoid
accessing bpf_verifier_state-&amp;gt;frame[*]-&amp;gt;stack out of bounds.&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;bpf: account for current allocated stack depth in widen_imprecise_scalars()&lt;/p&gt;
&lt;p&gt;The usage pattern for widen_imprecise_scalars() looks as follows:&lt;/p&gt;
&lt;p&gt;prev_st = find_prev_entry(env, ...);
    queued_st = push_stack(...);
    widen_imprecise_scalars(env, prev_st, queued_st);&lt;/p&gt;
&lt;p&gt;Where prev_st is an ancestor of the queued_st in the explored states
tree. This ancestor is not guaranteed to have same allocated stack
depth as queued_st. E.g. in the following case:&lt;/p&gt;
&lt;p&gt;def main():
      for i in 1..2:
        foo(i)        // same callsite, differnt param&lt;/p&gt;
&lt;p&gt;def foo(i):
      if i == 1:
        use 128 bytes of stack
      iterator based loop&lt;/p&gt;
&lt;p&gt;Here, for a second &amp;#39;foo&amp;#39; call prev_st-&amp;gt;allocated_stack is 128,
while queued_st-&amp;gt;allocated_stack is much smaller.
widen_imprecise_scalars() needs to take this into account and avoid
accessing bpf_verifier_state-&amp;gt;frame[*]-&amp;gt;stack out of bounds.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/fkie_cve-2025-68208</guid>
    </item>
    <item>
      <title>GHSA-2x57-vxvc-jh3v</title>
      <link>https://cve.radiocsirt.org/vuln/ghsa-2x57-vxvc-jh3v</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;bpf: account for current allocated stack depth in widen_imprecise_scalars()&lt;/p&gt;
&lt;p&gt;The usage pattern for widen_imprecise_scalars() looks as follows:&lt;/p&gt;
&lt;p&gt;prev_st = find_prev_entry(env, ...);
    queued_st = push_stack(...);
    widen_imprecise_scalars(env, prev_st, queued_st);&lt;/p&gt;
&lt;p&gt;Where prev_st is an ancestor of the queued_st in the explored states
tree. This ancestor is not guaranteed to have same allocated stack
depth as queued_st. E.g. in the following case:&lt;/p&gt;
&lt;p&gt;def main():
      for i in 1..2:
        foo(i)        // same callsite, differnt param&lt;/p&gt;
&lt;p&gt;def foo(i):
      if i == 1:
        use 128 bytes of stack
      iterator based loop&lt;/p&gt;
&lt;p&gt;Here, for a second &amp;#39;foo&amp;#39; call prev_st-&amp;gt;allocated_stack is 128,
while queued_st-&amp;gt;allocated_stack is much smaller.
widen_imprecise_scalars() needs to take this into account and avoid
accessing bpf_verifier_state-&amp;gt;frame[*]-&amp;gt;stack out of bounds.&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;bpf: account for current allocated stack depth in widen_imprecise_scalars()&lt;/p&gt;
&lt;p&gt;The usage pattern for widen_imprecise_scalars() looks as follows:&lt;/p&gt;
&lt;p&gt;prev_st = find_prev_entry(env, ...);
    queued_st = push_stack(...);
    widen_imprecise_scalars(env, prev_st, queued_st);&lt;/p&gt;
&lt;p&gt;Where prev_st is an ancestor of the queued_st in the explored states
tree. This ancestor is not guaranteed to have same allocated stack
depth as queued_st. E.g. in the following case:&lt;/p&gt;
&lt;p&gt;def main():
      for i in 1..2:
        foo(i)        // same callsite, differnt param&lt;/p&gt;
&lt;p&gt;def foo(i):
      if i == 1:
        use 128 bytes of stack
      iterator based loop&lt;/p&gt;
&lt;p&gt;Here, for a second &amp;#39;foo&amp;#39; call prev_st-&amp;gt;allocated_stack is 128,
while queued_st-&amp;gt;allocated_stack is much smaller.
widen_imprecise_scalars() needs to take this into account and avoid
accessing bpf_verifier_state-&amp;gt;frame[*]-&amp;gt;stack out of bounds.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ghsa-2x57-vxvc-jh3v</guid>
    </item>
    <item>
      <title>OESA-2026-1759 — kernel security update</title>
      <link>https://cve.radiocsirt.org/vuln/oesa-2026-1759</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; openEuler:24.03-LTS: kernel&lt;/p&gt;
&lt;p&gt;The Linux Kernel, the operating system core itself.&#13;
&#13;
Security Fix(es):&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;iommu/s390: Implement blocking domain&lt;/p&gt;
&lt;p&gt;This fixes a crash when surprise hot-unplugging a PCI device. This crash
happens because during hot-unplug __iommu_group_set_domain_nofail()
attaching the default domain fails when the platform no longer
recognizes the device as it has already been removed and we end up with
a NULL domain pointer and UAF. This is exactly the case referred to in
the second comment in __iommu_device_set_domain() and just as stated
there if we can instead attach the blocking domain the UAF is prevented
as this can handle the already removed device. Implement the blocking
domain to use this handling.  With this change, the crash is fixed but
we still hit a warning attempting to change DMA ownership on a blocked
device.(CVE-2024-53232)&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;iommu: Fix two issues in iommu_copy_struct_from_user()&lt;/p&gt;
&lt;p&gt;In the review for iommu_copy_struct_to_user() helper, Matt pointed out that
a NULL pointer should be rejected prior to dereferencing it:
https://lore.kernel.org/all/(CVE-2025-37900)&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;smb: client: Avoid race in open_cached_dir with lease breaks&lt;/p&gt;
&lt;p&gt;A pre-existing valid cfid returned from find_or_create_cached_dir might
race with a lease break, meaning open_cached_dir doesn&amp;amp;apos;t consider it
valid,…&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; openEuler:24.03-LTS: kernel&lt;/p&gt;
&lt;p&gt;The Linux Kernel, the operating system core itself.&#13;
&#13;
Security Fix(es):&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;iommu/s390: Implement blocking domain&lt;/p&gt;
&lt;p&gt;This fixes a crash when surprise hot-unplugging a PCI device. This crash
happens because during hot-unplug __iommu_group_set_domain_nofail()
attaching the default domain fails when the platform no longer
recognizes the device as it has already been removed and we end up with
a NULL domain pointer and UAF. This is exactly the case referred to in
the second comment in __iommu_device_set_domain() and just as stated
there if we can instead attach the blocking domain the UAF is prevented
as this can handle the already removed device. Implement the blocking
domain to use this handling.  With this change, the crash is fixed but
we still hit a warning attempting to change DMA ownership on a blocked
device.(CVE-2024-53232)&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;iommu: Fix two issues in iommu_copy_struct_from_user()&lt;/p&gt;
&lt;p&gt;In the review for iommu_copy_struct_to_user() helper, Matt pointed out that
a NULL pointer should be rejected prior to dereferencing it:
https://lore.kernel.org/all/(CVE-2025-37900)&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;smb: client: Avoid race in open_cached_dir with lease breaks&lt;/p&gt;
&lt;p&gt;A pre-existing valid cfid returned from find_or_create_cached_dir might
race with a lease break, meaning open_cached_dir doesn&amp;amp;apos;t consider it
valid,…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/oesa-2026-1759</guid>
    </item>
    <item>
      <title>openSUSE-SU-2026:20145-1 — Security update for the Linux Kernel</title>
      <link>https://cve.radiocsirt.org/vuln/opensuse-su-2026:20145-1</link>
      <description>&lt;p&gt;Security update for the Linux Kernel&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;Security update for the Linux Kernel&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/opensuse-su-2026:20145-1</guid>
    </item>
    <item>
      <title>SUSE-SU-2026:0278-1 — Security update for the Linux Kernel</title>
      <link>https://cve.radiocsirt.org/vuln/suse-su-2026:0278-1</link>
      <description>&lt;p&gt;Security update for the Linux Kernel&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;Security update for the Linux Kernel&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/suse-su-2026:0278-1</guid>
    </item>
    <item>
      <title>UBUNTU-CVE-2025-68208</title>
      <link>https://cve.radiocsirt.org/vuln/ubuntu-cve-2025-68208</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 137 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: bpf: account for current allocated stack depth in widen_imprecise_scalars() The usage pattern for widen_imprecise_scalars() looks as follows:     prev_st = find_prev_entry(env, ...);     queued_st = push_stack(...);     widen_imprecise_scalars(env, prev_st, queued_st); Where prev_st is an ancestor of the queued_st in the explored states tree. This ancestor is not guaranteed to have same allocated stack depth as queued_st. E.g. in the following case:     def main():       for i in 1..2:         foo(i)        // same callsite, differnt param     def foo(i):       if i == 1:         use 128 bytes of stack       iterator based loop Here, for a second &amp;#39;foo&amp;#39; call prev_st-&amp;gt;allocated_stack is 128, while queued_st-&amp;gt;allocated_stack is much smaller. widen_imprecise_scalars() needs to take this into account and avoid accessing bpf_verifier_state-&amp;gt;frame[*]-&amp;gt;stack out of bounds.&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 137 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: bpf: account for current allocated stack depth in widen_imprecise_scalars() The usage pattern for widen_imprecise_scalars() looks as follows:     prev_st = find_prev_entry(env, ...);     queued_st = push_stack(...);     widen_imprecise_scalars(env, prev_st, queued_st); Where prev_st is an ancestor of the queued_st in the explored states tree. This ancestor is not guaranteed to have same allocated stack depth as queued_st. E.g. in the following case:     def main():       for i in 1..2:         foo(i)        // same callsite, differnt param     def foo(i):       if i == 1:         use 128 bytes of stack       iterator based loop Here, for a second &amp;#39;foo&amp;#39; call prev_st-&amp;gt;allocated_stack is 128, while queued_st-&amp;gt;allocated_stack is much smaller. widen_imprecise_scalars() needs to take this into account and avoid accessing bpf_verifier_state-&amp;gt;frame[*]-&amp;gt;stack out of bounds.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ubuntu-cve-2025-68208</guid>
    </item>
    <item>
      <title>WID-SEC-W-2025-2868 — Linux Kernel: Mehrere Schwachstellen</title>
      <link>https://cve.radiocsirt.org/vuln/wid-sec-w-2025-2868</link>
      <description>&lt;p&gt;Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um nicht näher spezifizierte Angriffe durchzuführen, die möglicherweise zu einer Denial-of-Service- Bedingung führen oder eine Speicherbeschädigung verursachen können.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um nicht näher spezifizierte Angriffe durchzuführen, die möglicherweise zu einer Denial-of-Service- Bedingung führen oder eine Speicherbeschädigung verursachen können.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/wid-sec-w-2025-2868</guid>
    </item>
  </channel>
</rss>
