<?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 07:13:42 +0000</lastBuildDate>
    <item>
      <title>CVE-2026-68354 — firewire: net: Fix fragmented datagram reassembly</title>
      <link>https://vulnerability.circl.lu/vuln/cve-2026-68354</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Linux&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;firewire: net: Fix fragmented datagram reassembly&lt;/p&gt;
&lt;p&gt;fwnet_frag_new() keeps a sorted list of received fragments for a partial
datagram. When a new fragment is adjacent to an existing fragment, the
code checks whether the new fragment also closes the gap to the next or
previous list entry.&lt;/p&gt;
&lt;p&gt;Those neighbor lookups currently assume that the current fragment always
has a real next or previous fragment. At a list edge, the next or
previous entry is the list head, not a struct fwnet_fragment_info.&lt;/p&gt;
&lt;p&gt;The gap checks also compare against the old edge of the current fragment
instead of the edge after adding the new fragment. As a result, a
fragment that bridges two existing ranges may leave two adjacent ranges
unmerged, so fwnet_pd_is_complete() can miss a complete datagram.&lt;/p&gt;
&lt;p&gt;Check for the list head before looking up the neighboring fragment, and
compare the neighbor against the new fragment&amp;#39;s far edge when deciding
whether to merge all three ranges.&lt;/p&gt;
&lt;p&gt;This issue was found by a static analysis checker and confirmed by
manual source review.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Linux&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;firewire: net: Fix fragmented datagram reassembly&lt;/p&gt;
&lt;p&gt;fwnet_frag_new() keeps a sorted list of received fragments for a partial
datagram. When a new fragment is adjacent to an existing fragment, the
code checks whether the new fragment also closes the gap to the next or
previous list entry.&lt;/p&gt;
&lt;p&gt;Those neighbor lookups currently assume that the current fragment always
has a real next or previous fragment. At a list edge, the next or
previous entry is the list head, not a struct fwnet_fragment_info.&lt;/p&gt;
&lt;p&gt;The gap checks also compare against the old edge of the current fragment
instead of the edge after adding the new fragment. As a result, a
fragment that bridges two existing ranges may leave two adjacent ranges
unmerged, so fwnet_pd_is_complete() can miss a complete datagram.&lt;/p&gt;
&lt;p&gt;Check for the list head before looking up the neighboring fragment, and
compare the neighbor against the new fragment&amp;#39;s far edge when deciding
whether to merge all three ranges.&lt;/p&gt;
&lt;p&gt;This issue was found by a static analysis checker and confirmed by
manual source review.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/cve-2026-68354</guid>
    </item>
  </channel>
</rss>
