This project contains known security vulnerabilities. Find detailed information at the bottom.

Crate libp2p-noise

Dependencies

(13 total, 7 outdated, 2 insecure)

CrateRequiredLatestStatus
 bytes^11.12.1up to date
 curve25519-dalek ⚠️^3.0.05.0.0insecure
 futures^0.3.10.3.34up to date
 lazy_static^1.21.5.0up to date
 libp2p-core^0.28.00.44.0out of date
 log^0.40.4.34up to date
 prost^0.70.14.4out of date
 rand^0.8.30.10.2out of date
 sha2^0.9.10.11.0out of date
 snow ⚠️^0.8.00.10.0insecure
 static_assertions^11.1.0up to date
 x25519-dalek^1.1.03.0.0out of date
 zeroize^11.9.0up to date

Dev dependencies

(4 total, 3 outdated)

CrateRequiredLatestStatus
 async-io^1.2.02.6.0out of date
 env_logger^0.8.10.11.11out of date
 quickcheck^0.9.01.1.0out of date
 sodiumoxide^0.2.50.2.7up to date

Security Vulnerabilities

snow: Unauthenticated Nonce Increment in snow

RUSTSEC-2024-0011

There was a logic bug where unauthenticated payloads could still cause a nonce increment in snow's internal state. For an attacker with privileges to inject packets into the channel over which the Noise session operates, this could allow a denial-of-service attack which could prevent message delivery by sending garbage data.

Note that this only affects those who are using the stateful TransportState, not those using StatelessTransportState.

This has been patched in version 0.9.5, and all users are recommended to update.

curve25519-dalek: Timing variability in `curve25519-dalek`'s `Scalar29::sub`/`Scalar52::sub`

RUSTSEC-2024-0344

Timing variability of any kind is problematic when working with potentially secret values such as elliptic curve scalars, and such issues can potentially leak private keys and other secrets. Such a problem was recently discovered in curve25519-dalek.

The Scalar29::sub (32-bit) and Scalar52::sub (64-bit) functions contained usage of a mask value inside a loop where LLVM saw an opportunity to insert a branch instruction (jns on x86) to conditionally bypass this code section when the mask value is set to zero as can be seen in godbolt:

A similar problem was recently discovered in the Kyber reference implementation:

https://groups.google.com/a/list.nist.gov/g/pqc-forum/c/hqbtIGFKIpU/m/cnE3pbueBgAJ

As discussed on that thread, one portable solution, which is also used in this PR, is to introduce a volatile read as an optimization barrier, which prevents the compiler from optimizing it away.

The fix can be validated in godbolt here:

The problem was discovered and the solution independently verified by Alexander Wagner [email protected] and Lea Themint [email protected] using their DATA tool:

https://github.com/Fraunhofer-AISEC/DATA