CVE-2026-90246
In the Linux kernel, the following vulnerability has been resolved:
apparmor: fix integer overflow in verify_tags() bounds check
verify_tags() validates the tagset table unpacked from a policy blob. For each set it reads a count and checks that advancing the index by that count stays inside sets.table[]:
i, cnt and sets.size are all u32, so i+cnt is evaluated modulo 2^32. sets.table[] is filled by unpack_tagsets() with aa_unpack_u32(), so every entry is a raw unbounded 32-bit word taken from the policy blob, and verify_tags() is the function that is supposed to validate it. A count close to U32_MAX makes the sum wrap to a small value, the guard passes, and the inner loop then walks sets.table[++i] past the end of the kcalloc(size, sizeof(u32)) allocation.
Leer descripción completaMostrar menos
Note that sets.size is bounded by 65535, because unpack_tagsets() reads it with aa_unpack_array() as a u16, so the wrap cannot be reached by growing the table; it is reached purely through the attacker-supplied count.
With sets.size = 2 and sets.table = { 0, 0xffffffff }:
The walk continues until an out-of-bounds value happens to be >= hdrs.size or the access faults, so a crafted policy yields an out-of-bounds read on the policy load path (aa_replace_profiles -> aa_unpack -> unpack_policydb -> unpack_tags -> verify_tags). unpack_tags() runs before the perms and DFA tables are unpacked, so no other table needs to be well formed to reach it.
Policy load is gated by aa_may_manage_policy(), which checks CAP_MAC_ADMIN relative to the subject's own user namespace rather than the init user namespace, so with the default unprivileged_userns_apparmor_policy=1 the path is reachable from an unprivileged task in a matched-level nested namespace, not only by a globally privileged one.
Perform the addition in u64 so that it cannot wrap, restoring the intended i + cnt < sets.size guarantee.
Detalles técnicos trazas, registros y código del informe original
u32 cnt = tags->sets.table[i];
if (i+cnt >= tags->sets.size) {
i = 0: cnt = 0, guard 0 + 0 >= 2 is false, inner loop does not run
i = 1: cnt = 0xffffffff, guard (1 + 0xffffffff) mod 2^32 == 0 >= 2 is
false, so the guard is bypassed and the inner loop reads
sets.table[2] -- one element past a two element allocationCVSS
- Versión: 3.1
- Vector: CVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:N/A:H
- Puntuación base: 7.1
Probabilidad de explotación (EPSS)
- Probabilidad de explotación en los próximos 30 días: 0.17%
- Percentil entre todas las CVEs puntuadas: 5
- Fecha de la puntuación: 5/10/2026
EPSS (Exploit Prediction Scoring System, de FIRST) estima la probabilidad de que una vulnerabilidad sea explotada en 30 días. Complementa a CVSS (impacto) y a CISA KEV (explotación confirmada).
🎯 Técnicas ATT&CK
Cómo se explota esta vulnerabilidad y qué consigue el atacante, en el lenguaje de MITRE ATT&CK.
- Explotación
T1068Exploitation for Privilege Escalationprivilege escalation85 % - Impacto principal
T1005Data from Local Systemcollection75 %
Desbordamiento de enteros en verify_tags() permite lectura fuera de límites de memoria en kernel Linux. Requiere CAP_MAC_ADMIN en namespace de usuario local (AV:L, PR:L), permitiendo escalada y acceso a datos del kernel.
Inferido por nuestro agente de análisis a partir de la descripción oficial, el vector CVSS y la CWE, y comprobado por un supervisor. Puede contener errores.
🛡️ Mitigaciones ATT&CK que cubren estas técnicas
Tecnologías afectadas (1)
⚠ Inferidas por IA a partir de la descripción — NVD aún no ha analizado esta CVE; no son CPE verificados.
Referencias
JSON original (NVD)
Mostrar
{
"id": "CVE-2026-90246",
"cveTags": [],
"metrics": {
"cvssMetricV31": [
{
"type": "Secondary",
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"cvssData": {
"scope": "UNCHANGED",
"version": "3.1",
"baseScore": 7.1,
"attackVector": "LOCAL",
"baseSeverity": "HIGH",
"vectorString": "CVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:H/I:N/A:H",
"integrityImpact": "NONE",
"userInteraction": "NONE",
"attackComplexity": "LOW",
"availabilityImpact": "HIGH",
"privilegesRequired": "LOW",
"confidentialityImpact": "HIGH"
},
"impactScore": 5.2,
"exploitabilityScore": 1.8
}
]
},
"affected": [
{
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"affectedData": [
{
"repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
"vendor": "Linux",
"product": "Linux",
"versions": [
{
"status": "affected",
"version": "3d28e2397af7a89ac3de33c686ed404cda59b5d5",
"lessThan": "ef79a405f83993f0fda5efde371d98433f7d7a47",
"versionType": "git"
},
{
"status": "affected",
"version": "3d28e2397af7a89ac3de33c686ed404cda59b5d5",
"lessThan": "465946d3c560c0137e6a180ba054dddc4d049f5a",
"versionType": "git"
}
],
"programFiles": [
"security/apparmor/policy_unpack.c"
],
"defaultStatus": "unaffected"
},
{
"repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
"vendor": "Linux",
"product": "Linux",
"versions": [
{
"status": "affected",
"version": "7.0"
},
{
"status": "unaffected",
"version": "0",
"lessThan": "7.0",
"versionType": "semver"
},
{
"status": "unaffected",
"version": "7.2.6",
"versionType": "semver",
"lessThanOrEqual": "7.2.*"
},
{
"status": "unaffected",
"version": "7.3-rc1",
"versionType": "original_commit_for_fix",
"lessThanOrEqual": "*"
}
],
"programFiles": [
"security/apparmor/policy_unpack.c"
],
"defaultStatus": "affected"
}
]
}
],
"published": "2026-09-17T17:17:20.677",
"references": [
{
"url": "https://git.kernel.org/stable/c/465946d3c560c0137e6a180ba054dddc4d049f5a",
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67"
},
{
"url": "https://git.kernel.org/stable/c/ef79a405f83993f0fda5efde371d98433f7d7a47",
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67"
}
],
"vulnStatus": "Received",
"descriptions": [
{
"lang": "en",
"value": "In the Linux kernel, the following vulnerability has been resolved:\n\napparmor: fix integer overflow in verify_tags() bounds check\n\nverify_tags() validates the tagset table unpacked from a policy blob.\nFor each set it reads a count and checks that advancing the index by\nthat count stays inside sets.table[]:\n\n\tu32 cnt = tags->sets.table[i];\n\n\tif (i+cnt >= tags->sets.size) {\n\ni, cnt and sets.size are all u32, so i+cnt is evaluated modulo 2^32.\nsets.table[] is filled by unpack_tagsets() with aa_unpack_u32(), so\nevery entry is a raw unbounded 32-bit word taken from the policy blob,\nand verify_tags() is the function that is supposed to validate it. A\ncount close to U32_MAX makes the sum wrap to a small value, the guard\npasses, and the inner loop then walks sets.table[++i] past the end of\nthe kcalloc(size, sizeof(u32)) allocation.\n\nNote that sets.size is bounded by 65535, because unpack_tagsets() reads\nit with aa_unpack_array() as a u16, so the wrap cannot be reached by\ngrowing the table; it is reached purely through the attacker-supplied\ncount.\n\nWith sets.size = 2 and sets.table = { 0, 0xffffffff }:\n\n i = 0: cnt = 0, guard 0 + 0 >= 2 is false, inner loop does not run\n i = 1: cnt = 0xffffffff, guard (1 + 0xffffffff) mod 2^32 == 0 >= 2 is\n false, so the guard is bypassed and the inner loop reads\n sets.table[2] -- one element past a two element allocation\n\nThe walk continues until an out-of-bounds value happens to be >=\nhdrs.size or the access faults, so a crafted policy yields an\nout-of-bounds read on the policy load path\n(aa_replace_profiles -> aa_unpack -> unpack_policydb -> unpack_tags ->\nverify_tags). unpack_tags() runs before the perms and DFA tables are\nunpacked, so no other table needs to be well formed to reach it.\n\nPolicy load is gated by aa_may_manage_policy(), which checks\nCAP_MAC_ADMIN relative to the subject's own user namespace rather than\nthe init user namespace, so with the default\nunprivileged_userns_apparmor_policy=1 the path is reachable from an\nunprivileged task in a matched-level nested namespace, not only by a\nglobally privileged one.\n\nPerform the addition in u64 so that it cannot wrap, restoring the\nintended i + cnt < sets.size guarantee."
}
],
"lastModified": "2026-09-18T18:17:50.873",
"sourceIdentifier": "416baaa9-dc9f-4396-8d5f-8c081fb06d67"
}