RUSTSEC-2026-0342: Zero-length DATAGRAM frames bypass the receive buffer limit in quinn-proto
Nadie ha tomado este issue todavía.
Evaluación
- Dificultad
- 4/5
- Tiempo estimado
- 3-5 días
- Aptitud para principiantes
- 15/100
Línea de trabajo
The report describes a vulnerability in the quinn-proto package, fixed in version 0.11.17, and links to the upstream pull request #2790. Start by reviewing that pull request and the RustSec advisory to understand the receive and send buffer accounting flaw. Done means confirming whether this repository is affected and addressing the vulnerable dependency or documenting why it is not applicable.
Escrito por el modelo de indexación a partir del texto del issue.
Descripción
Zero-length DATAGRAM frames bypass the receive buffer limit in quinn-proto
| Details | |
|---|---|
| Package | quinn-proto |
| Version | 0.11.16 |
| URL | https://github.com/quinn-rs/quinn/pull/2790 |
| Date | 2026-08-17 |
| Patched versions | >=0.11.17 |
| Unaffected versions | <0.5.0 |
quinn-proto bounds its queue of received datagrams by charging each queued frame's payload length
against TransportConfig::datagram_receive_buffer_size, evicting the oldest datagrams when the
limit is exceeded. A DATAGRAM frame with an empty payload was charged zero bytes, so it never
triggered eviction and was appended to the queue, which has no other bound.
DATAGRAM frames are not subject to flow control. A peer that has completed the handshake can
therefore send a stream of empty DATAGRAM frames and grow the receiver's heap without limit until
the process is killed. An application that reads incoming datagrams but does so more slowly than
the peer sends them is still affected. Receiving datagrams is enabled by default, so all endpoints
that do not explicitly set datagram_receive_buffer_size(None) are affected.
The send path had the same accounting flaw: an application could enqueue an unbounded number of
empty outgoing datagrams without ever receiving SendDatagramError::Blocked.
The flaw was corrected in 0.11.17 by accounting for the fixed per-datagram overhead in both
directions, so that every queued datagram consumes buffer space.
Thanks to @alexpyattaev for reporting this issue.
See advisory page for additional details.
- Lenguaje dominante
- Rust
- Estrellas
- 1
- Forks
- 0
- Merge medio
- 11 h 44 min
- PR fusionados (30 d)
- 2
Preparar el entorno
- Sin Dockerfile ni archivo de Docker Compose
- Tiene una plantilla de pull request
- Leer la guía de contribución
Primeros pasos
- Lee el issue completo y luego la guía de contribución del proyecto.
- Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
- Haz un fork del repositorio y trabaja en una rama.
- Abre un pull request que haga referencia al número del issue.
Más de stackabletech/stackable-odbc-trino
-
Dificultad 4/5 3-5 días Aptitud para principiantes 42/100
-
Dificultad 3/5 1-2 días Aptitud para principiantes 55/100
-
Dificultad 4/5 3-5 días Aptitud para principiantes 20/100
-
Dificultad 4/5 3-5 días Aptitud para principiantes 30/100
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 55/100
Todos los issues de stackabletech/stackable-odbc-trino
Issues similares
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 68/100
bytecodealliance/rustix#1703 ·
Los mantenedores suelen responder en 3 días
-
bug discussion
Dificultad 2/5 1-3 horas Aptitud para principiantes 70/100
medialab/xan#1201 · 2 comentarios ·
Los mantenedores suelen responder en 1 día
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 74/100
farion1231/cc-switch#8298 ·
Los mantenedores suelen responder en 1 día
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 74/100
Los mantenedores suelen responder en 1 día
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 68/100
ajeetdsouza/zoxide#1323 ·
Los mantenedores suelen responder en 1 día