CVE-2025-32032

The Apollo Router Core is a configurable, high-performance graph router written in Rust to run a federated supergraph that uses Apollo Federation 2. A vulnerability in Apollo Router allowed queries with deeply nested and reused named fragments to be prohibitively expensive to query plan, specifically due to internal optimizations being frequently bypassed. The query planner includes an optimization that significantly speeds up planning for applicable GraphQL selections. However, queries with deeply nested and reused named fragments can generate many selections where this optimization does not apply, leading to significantly longer planning times. Because the query planner does not enforce a timeout, a small number of such queries can exhaust router's thread pool, rendering it inoperable. This could lead to excessive resource consumption and denial of service. This has been remediated in apollo-router versions 1.61.2 and 2.1.1.

CVSS v3 7.5 HIGH

7.5^/10

CVSS v3 : HIGH

Vector :

Exploitability : 3.9 / Impact : 3.6

Attack Vector NETWORK

Attack Complexity LOW

Privileges Required NONE

User Interaction NONE

Confidentiality Impact NONE

Integrity Impact NONE

Availability Impact HIGH

Scope UNCHANGED

References

Link	Resource
https://github.com/apollographql/router/commit/ab6675a63174715ea6ff50881fc957831d4e9564
https://github.com/apollographql/router/commit/bba032e183b861348a466d3123c7137a1ae18952
https://github.com/apollographql/router/security/advisories/GHSA-94hh-jmq8-2fgp

Configurations

No configuration.

History

No history.

Information

Published : 2025-04-07 21:15

Updated : 2025-04-08 18:13

NVD link : CVE-2025-32032

Mitre link : CVE-2025-32032

CVE.ORG link : CVE-2025-32032

JSON object : View

Products Affected

No product.

CWE

CWE-770

Allocation of Resources Without Limits or Throttling

{"id": "CVE-2025-32032", "cveTags": [], "metrics": {"cvssMetricV31": [{"type": "Secondary", "source": "security-advisories@github.com", "cvssData": {"scope": "UNCHANGED", "version": "3.1", "baseScore": 7.5, "attackVector": "NETWORK", "baseSeverity": "HIGH", "vectorString": "CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H", "integrityImpact": "NONE", "userInteraction": "NONE", "attackComplexity": "LOW", "availabilityImpact": "HIGH", "privilegesRequired": "NONE", "confidentialityImpact": "NONE"}, "impactScore": 3.6, "exploitabilityScore": 3.9}]}, "published": "2025-04-07T21:15:43.363", "references": [{"url": "https://github.com/apollographql/router/commit/ab6675a63174715ea6ff50881fc957831d4e9564", "source": "security-advisories@github.com"}, {"url": "https://github.com/apollographql/router/commit/bba032e183b861348a466d3123c7137a1ae18952", "source": "security-advisories@github.com"}, {"url": "https://github.com/apollographql/router/security/advisories/GHSA-94hh-jmq8-2fgp", "source": "security-advisories@github.com"}], "vulnStatus": "Awaiting Analysis", "weaknesses": [{"type": "Secondary", "source": "security-advisories@github.com", "description": [{"lang": "en", "value": "CWE-770"}]}], "descriptions": [{"lang": "en", "value": "The Apollo Router Core is a configurable, high-performance graph router written in Rust to run a federated supergraph that uses Apollo Federation 2. A vulnerability in Apollo Router allowed queries with deeply nested and reused named fragments to be prohibitively expensive to query plan, specifically due to internal optimizations being frequently bypassed. The query planner includes an optimization that significantly speeds up planning for applicable GraphQL selections. However, queries with deeply nested and reused named fragments can generate many selections where this optimization does not apply, leading to significantly longer planning times. Because the query planner does not enforce a timeout, a small number of such queries can exhaust router's thread pool, rendering it inoperable. This could lead to excessive resource consumption and denial of service. This has been remediated in apollo-router versions 1.61.2 and 2.1.1."}, {"lang": "es", "value": "Apollo Router Core es un enrutador de grafos configurable y de alto rendimiento, escrito en Rust para ejecutar un supergrafo federado que utiliza Apollo Federation 2. Una vulnerabilidad en Apollo Router hac\u00eda que la planificaci\u00f3n de consultas con fragmentos con nombre profundamente anidados y reutilizados fuera prohibitivamente costosa, especialmente debido a que las optimizaciones internas se omit\u00edan con frecuencia. El planificador de consultas incluye una optimizaci\u00f3n que acelera significativamente la planificaci\u00f3n de las selecciones GraphQL aplicables. Sin embargo, las consultas con fragmentos con nombre profundamente anidados y reutilizados pueden generar muchas selecciones donde esta optimizaci\u00f3n no aplica, lo que resulta en tiempos de planificaci\u00f3n significativamente m\u00e1s largos. Dado que el planificador de consultas no impone un tiempo de espera, un peque\u00f1o n\u00famero de estas consultas puede agotar el grupo de subprocesos del enrutador, dej\u00e1ndolo inoperativo. Esto podr\u00eda provocar un consumo excesivo de recursos y denegaci\u00f3n de servicio. Esto se ha solucionado en las versiones 1.61.2 y 2.1.1 de apollo-router."}], "lastModified": "2025-04-08T18:13:53.347", "sourceIdentifier": "security-advisories@github.com"}