https://cve.radiocsirt.org/rss/recent/all/10 Most recent entries from all 2026-10-14T23:56:01.734756+00:00 Vulnerability-Lookup csirt@opendfir.org python-feedgen Contains only the most 10 recent entries. https://cve.radiocsirt.org/vuln/euvd-2026-232514 EUVD-2026-232514 2026-10-14T23:56:01.789030+00:00 EUVD-2026-232514 https://cve.radiocsirt.org/vuln/fkie_cve-2022-36111 fkie_cve-2022-36111 2026-10-14T23:56:01.789065+00:00

immudb is a database with built-in cryptographic proof and verification. In versions prior to 1.4.1, a malicious immudb server can provide a falsified proof that will be accepted by the client SDK signing a falsified transaction replacing the genuine one. This situation can not be triggered by a genuine immudb server and requires the client to perform a specific list of verified operations resulting in acceptance of an invalid state value. This vulnerability only affects immudb client SDKs, the immudb server itself is not affected by this vulnerability. This issue has been patched in version 1.4.1.

 https://cve.radiocsirt.org/vuln/ghsa-672p-m5jq-mrh8 GHSA-672p-m5jq-mrh8 — Insufficient Verification of Proofs generated by the immudb server in client SDK. 2026-10-14T23:56:01.789101+00:00

Affected: Go: github.com/codenotary/immudb

### Impact

In certain scenario a malicious immudb server can provide a falsified proof that will be accepted by the client SDK signing a falsified transaction replacing the genuine one. This situation can not be triggered by a genuine immudb server and requires the client to perform a specific list of verified operations resulting in acceptance of an invalid state value.

This vulnerability only affects immudb client SDKs, the immudb server itself is not affected by this vulnerability.

### Detailed description

immudb uses Merkle Tree enhanced with additional linear part to perform consistency proofs between two transactions. The linear part is built from the last leaf node of the Merkle Tree compensating for transactions that were not yet consumed by the Merkle Tree calculation.

The Merkle Tree part is then used to perform proofs for things that are in transaction range covered by the Merkle Tree where the linear part is used to check those that are not yet in the Merkle Tree.

When doing consistency checks between two immudb states, the linear proof part is not fully checked. In fact only the first (last Merkle Tree leaf) and the last (current DB state value) are checked against new Merkle Tree without ensuring that elements in the middle of that chain are correctly added as Merkle Tree leafs.

This lack of check means that the database can present different set of hashes on the linear proof part to what would later be used once those become part of the Merkle Tree. Thi…

 https://cve.radiocsirt.org/vuln/gsd-2022-36111 gsd-2022-36111 2026-10-14T23:56:01.789152+00:00 gsd-2022-36111