<?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://cve.radiocsirt.org/rss/recent/all/10</id>
  <title>Most recent entries from all</title>
  <updated>2026-10-04T23:06:31.751921+00:00</updated>
  <author>
    <name>Vulnerability-Lookup</name>
    <email>csirt@opendfir.org</email>
  </author>
  <link href="https://cve.radiocsirt.org" 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://cve.radiocsirt.org/vuln/euvd-2026-242389</id>
    <title>EUVD-2026-242389</title>
    <updated>2026-10-04T23:06:31.813358+00:00</updated>
    <content>EUVD-2026-242389</content>
    <link href="https://cve.radiocsirt.org/vuln/euvd-2026-242389"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/fkie_cve-2022-31021</id>
    <title>fkie_cve-2022-31021</title>
    <updated>2026-10-04T23:06:31.813394+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml">
        <p>Ursa is a cryptographic library for use with blockchains. A weakness in the Hyperledger AnonCreds specification that is not mitigated in the Ursa and AnonCreds implementations is that the Issuer does not publish a key correctness proof demonstrating that a generated private key is sufficient to meet the unlinkability guarantees of AnonCreds. The Ursa and AnonCreds CL-Signatures implementations always generate a sufficient private key. A malicious issuer could in theory create a custom CL Signature implementation (derived from the Ursa or AnonCreds CL-Signatures implementations) that uses weakened private keys such that presentations from holders could be shared by verifiers to the issuer who could determine the holder to which the credential was issued. This vulnerability could impact holders of AnonCreds credentials implemented using the CL-signature scheme in the Ursa and AnonCreds implementations of CL Signatures. The ursa project has has moved to end-of-life status and no fix is expected.</p>
      </div>
    </content>
    <link href="https://cve.radiocsirt.org/vuln/fkie_cve-2022-31021"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/ghsa-2q6j-gqc4-4gw3</id>
    <title>GHSA-2q6j-gqc4-4gw3 — Breaking unlinkability in Identity Mixer using malicious keys</title>
    <updated>2026-10-04T23:06:31.813430+00:00</updated>
    <content type="xhtml">
      <div xmlns="http://www.w3.org/1999/xhtml"><p><strong>Affected:</strong> crates.io: anoncreds-clsignatures, crates.io: ursa</p>
<p># CL Signatures Issuer Key Correctness Proof lacks of prime strength checking</p>
<p>A weakness in the Hyperledger AnonCreds specification that is not mitigated in the Ursa and AnonCreds implementations is that the Issuer does not publish a key correctness proof demonstrating that a generated private key is sufficient to meet the unlinkability guarantees of AnonCreds. A sufficient private key is one in which it's components `p` and `q` are safe primes, such that:</p>
<p>- `p` and `q` are both prime numbers
- `p` and `q` are not equal
- `p` and `q` have the same, sufficiently large, size
  - For example, using two values both 1024 bits long is sufficient, whereas using one value 2040 bits long and the other 8 bits long is not.</p>
<p>The Ursa and AnonCreds CL-Signatures implementations always generate a sufficient private key. A malicious issuer could in theory create a custom CL Signature implementation (derived from the Ursa or AnonCreds CL-Signatures implementations) that uses weakened private keys such that presentations from holders could be shared by verifiers  to the issuer who could determine the holder to which the credential was issued.</p>
<p>### Impact</p>
<p>This vulnerability could impact holders of AnonCreds credentials implemented using the CL-signature scheme in the Ursa and AnonCreds implementations of CL Signatures.</p>
<p>### Mitigations</p>
<p>[Jan Camenisch and Markus Michels. Proving in zero-knowledge that a number is the product of two safe primes] (pages 12-13) demonstrates a key correctness…</p></div>
    </content>
    <link href="https://cve.radiocsirt.org/vuln/ghsa-2q6j-gqc4-4gw3"/>
  </entry>
  <entry>
    <id>https://cve.radiocsirt.org/vuln/gsd-2022-31021</id>
    <title>gsd-2022-31021</title>
    <updated>2026-10-04T23:06:31.813481+00:00</updated>
    <content>gsd-2022-31021</content>
    <link href="https://cve.radiocsirt.org/vuln/gsd-2022-31021"/>
  </entry>
</feed>
