<?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://db.gcve.eu/rss/recent/all/10</id>
  <title>Most recent entries from all</title>
  <updated>2026-11-20T21:03:33.446591+00:00</updated>
  <author>
    <name>Vulnerability-Lookup</name>
    <email>info@gcve.eu</email>
  </author>
  <link href="https://db.gcve.eu" 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://db.gcve.eu/vuln/fkie_cve-2026-99786</id>
    <title>fkie_cve-2026-99786</title>
    <updated>2026-11-20T21:03:33.450667+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml"><p>In the Linux kernel, the following vulnerability has been resolved:</p>
<p>xfrm: retry inexact policy lookup after node reinsertion</p>
<p>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:</p>
<p>lookup                         policy insertion
  ------                         ----------------
  find inexact candidates
    save obsolete hlist head
                                 write_seqcount_begin(&amp;bin-&gt;count)
                                 merge inexact tree nodes
                                   hlist_del_rcu(&amp;policy-&gt;bydst)
                                   reinsert policy-&gt;bydst in survivor
                                 write_seqcount_end(&amp;bin-&gt;count)
  evaluate saved candidate list
    miss the moved policy</p>
<p>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.</p>
<p>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…</p></div>
    </content>
    <link href="https://db.gcve.eu/vuln/fkie_cve-2026-99786"/>
  </entry>
  <entry>
    <id>https://db.gcve.eu/vuln/ghsa-44vj-jj35-j8g2</id>
    <title>GHSA-44vj-jj35-j8g2</title>
    <updated>2026-11-20T21:03:33.450768+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml"><p>In the Linux kernel, the following vulnerability has been resolved:</p>
<p>xfrm: retry inexact policy lookup after node reinsertion</p>
<p>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:</p>
<p>lookup                         policy insertion
  ------                         ----------------
  find inexact candidates
    save obsolete hlist head
                                 write_seqcount_begin(&amp;bin-&gt;count)
                                 merge inexact tree nodes
                                   hlist_del_rcu(&amp;policy-&gt;bydst)
                                   reinsert policy-&gt;bydst in survivor
                                 write_seqcount_end(&amp;bin-&gt;count)
  evaluate saved candidate list
    miss the moved policy</p>
<p>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.</p>
<p>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…</p></div>
    </content>
    <link href="https://db.gcve.eu/vuln/ghsa-44vj-jj35-j8g2"/>
  </entry>
  <entry>
    <id>https://db.gcve.eu/vuln/wid-sec-w-2026-4695</id>
    <title>WID-SEC-W-2026-4695 — Linux Kernel: Mehrere Schwachstellen ermöglichen nicht spezifizierten Angriff</title>
    <updated>2026-11-20T21:03:33.450807+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml">
        <p>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</p>
      </div>
    </content>
    <link href="https://db.gcve.eu/vuln/wid-sec-w-2026-4695"/>
  </entry>
</feed>
