<?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>Sat, 03 Oct 2026 14:05:39 +0000</lastBuildDate>
    <item>
      <title>bdu:2026-00750</title>
      <link>https://cve.radiocsirt.org/vuln/bdu:2026-00750</link>
      <description>bdu:2026-00750</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/bdu:2026-00750</guid>
    </item>
    <item>
      <title>BELL-CVE-2025-68774</title>
      <link>https://cve.radiocsirt.org/vuln/bell-cve-2025-68774</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Alpaquita:23: linux-lts, 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:23: linux-lts, Alpaquita:25: linux-lts, Alpaquita:stream: linux-lts&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/bell-cve-2025-68774</guid>
    </item>
    <item>
      <title>certfr-2026-avi-0166 — De multiples vulnérabilités ont été découvertes dans le noyau Linux de Debian. Elles permettent à un attaquant de provo…</title>
      <link>https://cve.radiocsirt.org/vuln/certfr-2026-avi-0166</link>
      <description>certfr-2026-avi-0166</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/certfr-2026-avi-0166</guid>
    </item>
    <item>
      <title>EUVD-2026-347514</title>
      <link>https://cve.radiocsirt.org/vuln/euvd-2026-347514</link>
      <description>EUVD-2026-347514</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/euvd-2026-347514</guid>
    </item>
    <item>
      <title>fkie_cve-2025-68774</title>
      <link>https://cve.radiocsirt.org/vuln/fkie_cve-2025-68774</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;hfsplus: fix missing hfs_bnode_get() in __hfs_bnode_create&lt;/p&gt;
&lt;p&gt;When sync() and link() are called concurrently, both threads may
enter hfs_bnode_find() without finding the node in the hash table
and proceed to create it.&lt;/p&gt;
&lt;p&gt;Thread A:
  hfsplus_write_inode()
    -&amp;gt; hfsplus_write_system_inode()
      -&amp;gt; hfs_btree_write()
        -&amp;gt; hfs_bnode_find(tree, 0)
          -&amp;gt; __hfs_bnode_create(tree, 0)&lt;/p&gt;
&lt;p&gt;Thread B:
  hfsplus_create_cat()
    -&amp;gt; hfs_brec_insert()
      -&amp;gt; hfs_bnode_split()
        -&amp;gt; hfs_bmap_alloc()
          -&amp;gt; hfs_bnode_find(tree, 0)
            -&amp;gt; __hfs_bnode_create(tree, 0)&lt;/p&gt;
&lt;p&gt;In this case, thread A creates the bnode, sets refcnt=1, and hashes it.
Thread B also tries to create the same bnode, notices it has already
been inserted, drops its own instance, and uses the hashed one without
getting the node.&lt;/p&gt;
&lt;p&gt;```&lt;/p&gt;
&lt;p&gt;node2 = hfs_bnode_findhash(tree, cnid);
	if (!node2) {                                 &amp;lt;- Thread A
		hash = hfs_bnode_hash(cnid);
		node-&amp;gt;next_hash = tree-&amp;gt;node_hash[hash];
		tree-&amp;gt;node_hash[hash] = node;
		tree-&amp;gt;node_hash_cnt++;
	} else {                                      &amp;lt;- Thread B
		spin_unlock(&amp;amp;tree-&amp;gt;hash_lock);
		kfree(node);
		wait_event(node2-&amp;gt;lock_wq,
			!test_bit(HFS_BNODE_NEW, &amp;amp;node2-&amp;gt;flags));
		return node2;
	}
```&lt;/p&gt;
&lt;p&gt;However, hfs_bnode_find() requires each call to take a reference.
Here both threads end up setting refcnt=1. When they later put the node,
this triggers:&lt;/p&gt;
&lt;p&gt;BUG_ON(!atomic_re…&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;hfsplus: fix missing hfs_bnode_get() in __hfs_bnode_create&lt;/p&gt;
&lt;p&gt;When sync() and link() are called concurrently, both threads may
enter hfs_bnode_find() without finding the node in the hash table
and proceed to create it.&lt;/p&gt;
&lt;p&gt;Thread A:
  hfsplus_write_inode()
    -&amp;gt; hfsplus_write_system_inode()
      -&amp;gt; hfs_btree_write()
        -&amp;gt; hfs_bnode_find(tree, 0)
          -&amp;gt; __hfs_bnode_create(tree, 0)&lt;/p&gt;
&lt;p&gt;Thread B:
  hfsplus_create_cat()
    -&amp;gt; hfs_brec_insert()
      -&amp;gt; hfs_bnode_split()
        -&amp;gt; hfs_bmap_alloc()
          -&amp;gt; hfs_bnode_find(tree, 0)
            -&amp;gt; __hfs_bnode_create(tree, 0)&lt;/p&gt;
&lt;p&gt;In this case, thread A creates the bnode, sets refcnt=1, and hashes it.
Thread B also tries to create the same bnode, notices it has already
been inserted, drops its own instance, and uses the hashed one without
getting the node.&lt;/p&gt;
&lt;p&gt;```&lt;/p&gt;
&lt;p&gt;node2 = hfs_bnode_findhash(tree, cnid);
	if (!node2) {                                 &amp;lt;- Thread A
		hash = hfs_bnode_hash(cnid);
		node-&amp;gt;next_hash = tree-&amp;gt;node_hash[hash];
		tree-&amp;gt;node_hash[hash] = node;
		tree-&amp;gt;node_hash_cnt++;
	} else {                                      &amp;lt;- Thread B
		spin_unlock(&amp;amp;tree-&amp;gt;hash_lock);
		kfree(node);
		wait_event(node2-&amp;gt;lock_wq,
			!test_bit(HFS_BNODE_NEW, &amp;amp;node2-&amp;gt;flags));
		return node2;
	}
```&lt;/p&gt;
&lt;p&gt;However, hfs_bnode_find() requires each call to take a reference.
Here both threads end up setting refcnt=1. When they later put the node,
this triggers:&lt;/p&gt;
&lt;p&gt;BUG_ON(!atomic_re…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/fkie_cve-2025-68774</guid>
    </item>
    <item>
      <title>GHSA-2wrv-52xx-6xxv</title>
      <link>https://cve.radiocsirt.org/vuln/ghsa-2wrv-52xx-6xxv</link>
      <description>&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;hfsplus: fix missing hfs_bnode_get() in __hfs_bnode_create&lt;/p&gt;
&lt;p&gt;When sync() and link() are called concurrently, both threads may
enter hfs_bnode_find() without finding the node in the hash table
and proceed to create it.&lt;/p&gt;
&lt;p&gt;Thread A:
  hfsplus_write_inode()
    -&amp;gt; hfsplus_write_system_inode()
      -&amp;gt; hfs_btree_write()
        -&amp;gt; hfs_bnode_find(tree, 0)
          -&amp;gt; __hfs_bnode_create(tree, 0)&lt;/p&gt;
&lt;p&gt;Thread B:
  hfsplus_create_cat()
    -&amp;gt; hfs_brec_insert()
      -&amp;gt; hfs_bnode_split()
        -&amp;gt; hfs_bmap_alloc()
          -&amp;gt; hfs_bnode_find(tree, 0)
            -&amp;gt; __hfs_bnode_create(tree, 0)&lt;/p&gt;
&lt;p&gt;In this case, thread A creates the bnode, sets refcnt=1, and hashes it.
Thread B also tries to create the same bnode, notices it has already
been inserted, drops its own instance, and uses the hashed one without
getting the node.&lt;/p&gt;
&lt;p&gt;```&lt;/p&gt;
&lt;p&gt;node2 = hfs_bnode_findhash(tree, cnid);
	if (!node2) {                                 &amp;lt;- Thread A
		hash = hfs_bnode_hash(cnid);
		node-&amp;gt;next_hash = tree-&amp;gt;node_hash[hash];
		tree-&amp;gt;node_hash[hash] = node;
		tree-&amp;gt;node_hash_cnt++;
	} else {                                      &amp;lt;- Thread B
		spin_unlock(&amp;amp;tree-&amp;gt;hash_lock);
		kfree(node);
		wait_event(node2-&amp;gt;lock_wq,
			!test_bit(HFS_BNODE_NEW, &amp;amp;node2-&amp;gt;flags));
		return node2;
	}
```&lt;/p&gt;
&lt;p&gt;However, hfs_bnode_find() requires each call to take a reference.
Here both threads end up setting refcnt=1. When they later put the node,
this triggers:&lt;/p&gt;
&lt;p&gt;BUG_ON(!atomic_re…&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;hfsplus: fix missing hfs_bnode_get() in __hfs_bnode_create&lt;/p&gt;
&lt;p&gt;When sync() and link() are called concurrently, both threads may
enter hfs_bnode_find() without finding the node in the hash table
and proceed to create it.&lt;/p&gt;
&lt;p&gt;Thread A:
  hfsplus_write_inode()
    -&amp;gt; hfsplus_write_system_inode()
      -&amp;gt; hfs_btree_write()
        -&amp;gt; hfs_bnode_find(tree, 0)
          -&amp;gt; __hfs_bnode_create(tree, 0)&lt;/p&gt;
&lt;p&gt;Thread B:
  hfsplus_create_cat()
    -&amp;gt; hfs_brec_insert()
      -&amp;gt; hfs_bnode_split()
        -&amp;gt; hfs_bmap_alloc()
          -&amp;gt; hfs_bnode_find(tree, 0)
            -&amp;gt; __hfs_bnode_create(tree, 0)&lt;/p&gt;
&lt;p&gt;In this case, thread A creates the bnode, sets refcnt=1, and hashes it.
Thread B also tries to create the same bnode, notices it has already
been inserted, drops its own instance, and uses the hashed one without
getting the node.&lt;/p&gt;
&lt;p&gt;```&lt;/p&gt;
&lt;p&gt;node2 = hfs_bnode_findhash(tree, cnid);
	if (!node2) {                                 &amp;lt;- Thread A
		hash = hfs_bnode_hash(cnid);
		node-&amp;gt;next_hash = tree-&amp;gt;node_hash[hash];
		tree-&amp;gt;node_hash[hash] = node;
		tree-&amp;gt;node_hash_cnt++;
	} else {                                      &amp;lt;- Thread B
		spin_unlock(&amp;amp;tree-&amp;gt;hash_lock);
		kfree(node);
		wait_event(node2-&amp;gt;lock_wq,
			!test_bit(HFS_BNODE_NEW, &amp;amp;node2-&amp;gt;flags));
		return node2;
	}
```&lt;/p&gt;
&lt;p&gt;However, hfs_bnode_find() requires each call to take a reference.
Here both threads end up setting refcnt=1. When they later put the node,
this triggers:&lt;/p&gt;
&lt;p&gt;BUG_ON(!atomic_re…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ghsa-2wrv-52xx-6xxv</guid>
    </item>
    <item>
      <title>msrc_CVE-2025-68774 — hfsplus: fix missing hfs_bnode_get() in __hfs_bnode_create</title>
      <link>https://cve.radiocsirt.org/vuln/msrc_cve-2025-68774</link>
      <description>msrc_CVE-2025-68774</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/msrc_cve-2025-68774</guid>
    </item>
    <item>
      <title>SUSE-SU-2026:0473-1 — Security update for the Linux Kernel</title>
      <link>https://cve.radiocsirt.org/vuln/suse-su-2026:0473-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:0473-1</guid>
    </item>
    <item>
      <title>UBUNTU-CVE-2025-68774</title>
      <link>https://cve.radiocsirt.org/vuln/ubuntu-cve-2025-68774</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:Pro:14.04:LTS: linux, Ubuntu:Pro:14.04:LTS: linux-aws, Ubuntu:Pro:14.04:LTS: linux-azure, Ubuntu:Pro:14.04:LTS: linux-lts-xenial, Ubuntu:Pro:16.04:LTS: linux, Ubuntu:Pro:16.04:LTS: linux-aws, Ubuntu:Pro:16.04:LTS: linux-aws-hwe, Ubuntu:Pro:16.04:LTS: linux-azure, Ubuntu:Pro:16.04:LTS: linux-gcp, Ubuntu:Pro:16.04:LTS: linux-hwe and 232 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: hfsplus: fix missing hfs_bnode_get() in __hfs_bnode_create When sync() and link() are called concurrently, both threads may enter hfs_bnode_find() without finding the node in the hash table and proceed to create it. Thread A:   hfsplus_write_inode()     -&amp;gt; hfsplus_write_system_inode()       -&amp;gt; hfs_btree_write()         -&amp;gt; hfs_bnode_find(tree, 0)           -&amp;gt; __hfs_bnode_create(tree, 0) Thread B:   hfsplus_create_cat()     -&amp;gt; hfs_brec_insert()       -&amp;gt; hfs_bnode_split()         -&amp;gt; hfs_bmap_alloc()           -&amp;gt; hfs_bnode_find(tree, 0)             -&amp;gt; __hfs_bnode_create(tree, 0) In this case, thread A creates the bnode, sets refcnt=1, and hashes it. Thread B also tries to create the same bnode, notices it has already been inserted, drops its own instance, and uses the hashed one without getting the node. ``` 	node2 = hfs_bnode_findhash(tree, cnid); 	if (!node2) {                                 &amp;lt;- Thread A 		hash = hfs_bnode_hash(cnid); 		node-&amp;gt;next_hash = tree-&amp;gt;node_hash[hash]; 		tree-&amp;gt;node_hash[hash] = node; 		tree-&amp;gt;node_hash_cnt++; 	} else {                                      &amp;lt;- Thread B 		spin_unlock(&amp;amp;tree-&amp;gt;hash_lock); 		kfree(node); 		wait_event(node2-&amp;gt;lock_wq, 			!test_bit(HFS_BNODE_NEW, &amp;amp;node2-&amp;gt;flags)); 		return node2; 	} ``` However, hfs_bnode_find() requires each call to take a reference. Here both threads end up setting refcnt=1. When they later put the node, this triggers: BUG_ON(!atomic_read(&amp;amp;node-…&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Ubuntu:Pro:14.04:LTS: linux, Ubuntu:Pro:14.04:LTS: linux-aws, Ubuntu:Pro:14.04:LTS: linux-azure, Ubuntu:Pro:14.04:LTS: linux-lts-xenial, Ubuntu:Pro:16.04:LTS: linux, Ubuntu:Pro:16.04:LTS: linux-aws, Ubuntu:Pro:16.04:LTS: linux-aws-hwe, Ubuntu:Pro:16.04:LTS: linux-azure, Ubuntu:Pro:16.04:LTS: linux-gcp, Ubuntu:Pro:16.04:LTS: linux-hwe and 232 more&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved: hfsplus: fix missing hfs_bnode_get() in __hfs_bnode_create When sync() and link() are called concurrently, both threads may enter hfs_bnode_find() without finding the node in the hash table and proceed to create it. Thread A:   hfsplus_write_inode()     -&amp;gt; hfsplus_write_system_inode()       -&amp;gt; hfs_btree_write()         -&amp;gt; hfs_bnode_find(tree, 0)           -&amp;gt; __hfs_bnode_create(tree, 0) Thread B:   hfsplus_create_cat()     -&amp;gt; hfs_brec_insert()       -&amp;gt; hfs_bnode_split()         -&amp;gt; hfs_bmap_alloc()           -&amp;gt; hfs_bnode_find(tree, 0)             -&amp;gt; __hfs_bnode_create(tree, 0) In this case, thread A creates the bnode, sets refcnt=1, and hashes it. Thread B also tries to create the same bnode, notices it has already been inserted, drops its own instance, and uses the hashed one without getting the node. ``` 	node2 = hfs_bnode_findhash(tree, cnid); 	if (!node2) {                                 &amp;lt;- Thread A 		hash = hfs_bnode_hash(cnid); 		node-&amp;gt;next_hash = tree-&amp;gt;node_hash[hash]; 		tree-&amp;gt;node_hash[hash] = node; 		tree-&amp;gt;node_hash_cnt++; 	} else {                                      &amp;lt;- Thread B 		spin_unlock(&amp;amp;tree-&amp;gt;hash_lock); 		kfree(node); 		wait_event(node2-&amp;gt;lock_wq, 			!test_bit(HFS_BNODE_NEW, &amp;amp;node2-&amp;gt;flags)); 		return node2; 	} ``` However, hfs_bnode_find() requires each call to take a reference. Here both threads end up setting refcnt=1. When they later put the node, this triggers: BUG_ON(!atomic_read(&amp;amp;node-…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ubuntu-cve-2025-68774</guid>
    </item>
    <item>
      <title>WID-SEC-W-2026-0086 — Linux Kernel: Mehrere Schwachstellen</title>
      <link>https://cve.radiocsirt.org/vuln/wid-sec-w-2026-0086</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-2026-0086</guid>
    </item>
  </channel>
</rss>
