<?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://db.gcve.eu</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, 20 Nov 2026 21:03:33 +0000</lastBuildDate>
    <item>
      <title>fkie_cve-2026-99786</title>
      <link>https://db.gcve.eu/vuln/fkie_cve-2026-99786</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;xfrm: retry inexact policy lookup after node reinsertion&lt;/p&gt;
&lt;p&gt;An inexact policy lookup first records pointers to candidate hlist heads
and then traverses the lists.  A concurrent policy insertion can merge
inexact tree nodes between those operations:&lt;/p&gt;
&lt;p&gt;lookup                         policy insertion
  ------                         ----------------
  find inexact candidates
    save obsolete hlist head
                                 write_seqcount_begin(&amp;amp;bin-&amp;gt;count)
                                 merge inexact tree nodes
                                   hlist_del_rcu(&amp;amp;policy-&amp;gt;bydst)
                                   reinsert policy-&amp;gt;bydst in survivor
                                 write_seqcount_end(&amp;amp;bin-&amp;gt;count)
  evaluate saved candidate list
    miss the moved policy&lt;/p&gt;
&lt;p&gt;The merge immediately reinserts the same hlist node into the surviving
tree node.  RCU keeps the policy alive, but it does not provide a
consistent view while its list node is moved.  A lookup that selected the
obsolete list can observe it empty.  A lookup already traversing a moved
policy can instead follow the next pointer rewritten by the reinsertion.
Either case can return an incorrect IPsec policy result.&lt;/p&gt;
&lt;p&gt;The per-bin sequence counter already brackets calls to
xfrm_policy_inexact_insert_node(), including node merges.  The read side,
however, currently validates the counter only while searching an
individual rb-tree.  A successful…&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;xfrm: retry inexact policy lookup after node reinsertion&lt;/p&gt;
&lt;p&gt;An inexact policy lookup first records pointers to candidate hlist heads
and then traverses the lists.  A concurrent policy insertion can merge
inexact tree nodes between those operations:&lt;/p&gt;
&lt;p&gt;lookup                         policy insertion
  ------                         ----------------
  find inexact candidates
    save obsolete hlist head
                                 write_seqcount_begin(&amp;amp;bin-&amp;gt;count)
                                 merge inexact tree nodes
                                   hlist_del_rcu(&amp;amp;policy-&amp;gt;bydst)
                                   reinsert policy-&amp;gt;bydst in survivor
                                 write_seqcount_end(&amp;amp;bin-&amp;gt;count)
  evaluate saved candidate list
    miss the moved policy&lt;/p&gt;
&lt;p&gt;The merge immediately reinserts the same hlist node into the surviving
tree node.  RCU keeps the policy alive, but it does not provide a
consistent view while its list node is moved.  A lookup that selected the
obsolete list can observe it empty.  A lookup already traversing a moved
policy can instead follow the next pointer rewritten by the reinsertion.
Either case can return an incorrect IPsec policy result.&lt;/p&gt;
&lt;p&gt;The per-bin sequence counter already brackets calls to
xfrm_policy_inexact_insert_node(), including node merges.  The read side,
however, currently validates the counter only while searching an
individual rb-tree.  A successful…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/fkie_cve-2026-99786</guid>
    </item>
    <item>
      <title>GHSA-44vj-jj35-j8g2</title>
      <link>https://db.gcve.eu/vuln/ghsa-44vj-jj35-j8g2</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;xfrm: retry inexact policy lookup after node reinsertion&lt;/p&gt;
&lt;p&gt;An inexact policy lookup first records pointers to candidate hlist heads
and then traverses the lists.  A concurrent policy insertion can merge
inexact tree nodes between those operations:&lt;/p&gt;
&lt;p&gt;lookup                         policy insertion
  ------                         ----------------
  find inexact candidates
    save obsolete hlist head
                                 write_seqcount_begin(&amp;amp;bin-&amp;gt;count)
                                 merge inexact tree nodes
                                   hlist_del_rcu(&amp;amp;policy-&amp;gt;bydst)
                                   reinsert policy-&amp;gt;bydst in survivor
                                 write_seqcount_end(&amp;amp;bin-&amp;gt;count)
  evaluate saved candidate list
    miss the moved policy&lt;/p&gt;
&lt;p&gt;The merge immediately reinserts the same hlist node into the surviving
tree node.  RCU keeps the policy alive, but it does not provide a
consistent view while its list node is moved.  A lookup that selected the
obsolete list can observe it empty.  A lookup already traversing a moved
policy can instead follow the next pointer rewritten by the reinsertion.
Either case can return an incorrect IPsec policy result.&lt;/p&gt;
&lt;p&gt;The per-bin sequence counter already brackets calls to
xfrm_policy_inexact_insert_node(), including node merges.  The read side,
however, currently validates the counter only while searching an
individual rb-tree.  A successful…&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;xfrm: retry inexact policy lookup after node reinsertion&lt;/p&gt;
&lt;p&gt;An inexact policy lookup first records pointers to candidate hlist heads
and then traverses the lists.  A concurrent policy insertion can merge
inexact tree nodes between those operations:&lt;/p&gt;
&lt;p&gt;lookup                         policy insertion
  ------                         ----------------
  find inexact candidates
    save obsolete hlist head
                                 write_seqcount_begin(&amp;amp;bin-&amp;gt;count)
                                 merge inexact tree nodes
                                   hlist_del_rcu(&amp;amp;policy-&amp;gt;bydst)
                                   reinsert policy-&amp;gt;bydst in survivor
                                 write_seqcount_end(&amp;amp;bin-&amp;gt;count)
  evaluate saved candidate list
    miss the moved policy&lt;/p&gt;
&lt;p&gt;The merge immediately reinserts the same hlist node into the surviving
tree node.  RCU keeps the policy alive, but it does not provide a
consistent view while its list node is moved.  A lookup that selected the
obsolete list can observe it empty.  A lookup already traversing a moved
policy can instead follow the next pointer rewritten by the reinsertion.
Either case can return an incorrect IPsec policy result.&lt;/p&gt;
&lt;p&gt;The per-bin sequence counter already brackets calls to
xfrm_policy_inexact_insert_node(), including node merges.  The read side,
however, currently validates the counter only while searching an
individual rb-tree.  A successful…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/ghsa-44vj-jj35-j8g2</guid>
    </item>
    <item>
      <title>WID-SEC-W-2026-4695 — Linux Kernel: Mehrere Schwachstellen ermöglichen nicht spezifizierten Angriff</title>
      <link>https://db.gcve.eu/vuln/wid-sec-w-2026-4695</link>
      <description>&lt;p&gt;Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um einen nicht näher spezifizierten Angriff durchzuführen, möglicherweise einen Denial-of-Service-Angriff auszulösen, Daten zu manipulieren oder offenzulegen oder Sicherheitsmaßnahmen zu umgehen&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;Ein Angreifer kann mehrere Schwachstellen im Linux Kernel ausnutzen, um einen nicht näher spezifizierten Angriff durchzuführen, möglicherweise einen Denial-of-Service-Angriff auszulösen, Daten zu manipulieren oder offenzulegen oder Sicherheitsmaßnahmen zu umgehen&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://db.gcve.eu/vuln/wid-sec-w-2026-4695</guid>
    </item>
  </channel>
</rss>
