CVE-2026-133422 (GCVE-0-2026-133422)
Vulnerability from cvelistv5 – Published: 2026-11-20 07:33 – Updated: 2026-11-20 17:21
VLAI
EPSS
VEX
Title
Quadratic time unique_items list validation in Pydantic V1
Summary
Validating an untrusted list into a field constrained with unique_items=True with Pydantic V1 takes quadratic time: an input of a few hundred kilobytes takes seconds to validate.
The ConstrainedList.unique_items_validator validator (in pydantic/types.py) checks each item against all the following ones. For a list with no duplicates (the common, valid case), this results in a quadratic number of comparisons.
The issue was fixed in commit 6ec75e57f277a820ec583e601167f25fe8dc7c87. Users relying on the pydantic.v1 namespace in Pydantic V2 should upgrade to 2.14.2 or later.
Impact: denial of service through validation of untrusted input. Affected are applications validating untrusted lists into fields constrained with unique_items=True (using conlist() or Field()).
The fix only applies to lists of builtin scalar types (int, float, str, bytes, bool and None), for which duplicates can be detected in linear time. Lists of other types (e.g. models or dictionaries) are still checked in quadratic time, as their items aren't guaranteed to be hashable: bound their size using the max_items constraint.
Pydantic V2 models are not affected.
Severity
SSVC
Exploitation: none
Automatable: yes
Technical Impact: partial
CISA Coordinator · CISA-ADP (v2.0.3)
Decision recorded 2026-11-20 17:20 UTC
CWE
- CWE-407 - Inefficient Algorithmic Complexity
References
Impacted products
{
"containers": {
"adp": [
{
"metrics": [
{
"other": {
"content": {
"id": "CVE-2026-133422",
"options": [
{
"Exploitation": "none"
},
{
"Automatable": "yes"
},
{
"Technical Impact": "partial"
}
],
"role": "CISA Coordinator",
"timestamp": "2026-11-20T17:20:53.119210Z",
"version": "2.0.3"
},
"type": "ssvc"
}
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T17:21:01.909Z",
"orgId": "134c704f-9b21-4f2e-91b3-4a467353bcc0",
"shortName": "CISA-ADP"
},
"title": "CISA ADP Vulnrichment"
}
],
"cna": {
"affected": [
{
"collectionURL": "https://pypi.org",
"defaultStatus": "unaffected",
"packageName": "pydantic",
"product": "pydantic",
"repo": "https://github.com/pydantic/pydantic",
"vendor": "pydantic",
"versions": [
{
"lessThanOrEqual": "1.10.26",
"status": "affected",
"version": "1.9.0",
"versionType": "python"
}
]
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "iamibi"
}
],
"descriptions": [
{
"lang": "en",
"supportingMedia": [
{
"base64": false,
"type": "text/html",
"value": "\u003ch3\u003eSummary\u003c/h3\u003e\n\u003cp\u003eValidating an untrusted list into a field constrained with \u003ccode\u003eunique_items=True\u003c/code\u003e with Pydantic V1 takes quadratic time: an input of a few hundred kilobytes takes seconds to validate.\u003c/p\u003e\n\u003ch3\u003eDetails\u003c/h3\u003e\n\u003cp\u003eThe \u003ca href=\"https://github.com/pydantic/pydantic/blob/v1.10.26/pydantic/types.py#L612-L620\"\u003e\u003ccode\u003eConstrainedList.unique_items_validator\u003c/code\u003e\u003c/a\u003e validator (in \u003ccode\u003epydantic/types.py\u003c/code\u003e) checks each item against all the following ones:\u003c/p\u003e\n\u003cpre\u003e\u003ccode class=\"language-python\"\u003e@classmethod\ndef unique_items_validator(cls, v: \u0027Optional[List[T]]\u0027) -\u0026gt; \u0027Optional[List[T]]\u0027:\n if v is None:\n return None\n\n for i, value in enumerate(v, start=1):\n if value in v[i:]:\n raise errors.ListUniqueItemsError()\n\n return v\n\u003c/code\u003e\u003c/pre\u003e\n\u003cp\u003eFor a list with no duplicates (the common, valid case), this results in a quadratic number of comparisons.\u003c/p\u003e\n\u003cp\u003eThe issue was fixed in commit \u003ca href=\"https://github.com/pydantic/pydantic/commit/6ec75e57f277a820ec583e601167f25fe8dc7c87\"\u003e6ec75e57f277a820ec583e601167f25fe8dc7c87\u003c/a\u003e.\u003c/p\u003e\n\u003cp\u003eIf you are relying on the \u003ccode\u003epydantic.v1\u003c/code\u003e namespace in Pydantic V2, upgrade to \u003ca href=\"https://github.com/pydantic/pydantic/releases/tag/v2.14.2\"\u003eV2.14.2\u003c/a\u003e or later.\u003c/p\u003e\n\u003ch3\u003eImpact\u003c/h3\u003e\n\u003cp\u003eDenial of service through validation of untrusted input. Affected are applications validating untrusted lists into fields constrained with \u003ccode\u003eunique_items=True\u003c/code\u003e (using \u003ccode\u003econlist()\u003c/code\u003e or \u003ccode\u003eField()\u003c/code\u003e).\u003c/p\u003e\n\u003cp\u003eThe fix only applies to lists of builtin scalar types (\u003ccode\u003eint\u003c/code\u003e, \u003ccode\u003efloat\u003c/code\u003e, \u003ccode\u003estr\u003c/code\u003e, \u003ccode\u003ebytes\u003c/code\u003e, \u003ccode\u003ebool\u003c/code\u003e and \u003ccode\u003eNone\u003c/code\u003e), for which duplicates can be detected in linear time. Lists of other types (e.g. models or dictionaries) are still checked in quadratic time, as their items aren\u0027t guaranteed to be hashable: bound their size using the \u003ccode\u003emax_items\u003c/code\u003e constraint.\u003c/p\u003e\n\u003cp\u003ePydantic V2 models are not affected.\u003c/p\u003e"
}
],
"value": "Validating an untrusted list into a field constrained with unique_items=True with Pydantic V1 takes quadratic time: an input of a few hundred kilobytes takes seconds to validate.\n\nThe ConstrainedList.unique_items_validator validator (in pydantic/types.py) checks each item against all the following ones. For a list with no duplicates (the common, valid case), this results in a quadratic number of comparisons.\n\nThe issue was fixed in commit 6ec75e57f277a820ec583e601167f25fe8dc7c87. Users relying on the pydantic.v1 namespace in Pydantic V2 should upgrade to 2.14.2 or later.\n\nImpact: denial of service through validation of untrusted input. Affected are applications validating untrusted lists into fields constrained with unique_items=True (using conlist() or Field()).\n\nThe fix only applies to lists of builtin scalar types (int, float, str, bytes, bool and None), for which duplicates can be detected in linear time. Lists of other types (e.g. models or dictionaries) are still checked in quadratic time, as their items aren\u0027t guaranteed to be hashable: bound their size using the max_items constraint.\n\nPydantic V2 models are not affected."
}
],
"metrics": [
{
"cvssV4_0": {
"baseScore": 6.9,
"baseSeverity": "MEDIUM",
"vectorString": "CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N",
"version": "4.0"
}
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T07:33:35.498Z",
"orgId": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"shortName": "Pydantic"
},
"references": [
{
"tags": [
"vendor-advisory"
],
"url": "https://github.com/pydantic/pydantic/security/advisories/GHSA-49g6-96jj-f7r9"
},
{
"url": "https://github.com/pydantic/pydantic/blob/v1.10.26/pydantic/types.py#L612-L620"
},
{
"url": "https://github.com/pydantic/pydantic/commit/6ec75e57f277a820ec583e601167f25fe8dc7c87"
},
{
"url": "https://github.com/pydantic/pydantic/releases/tag/v2.14.2"
}
],
"source": {
"advisory": "GHSA-49g6-96jj-f7r9",
"discovery": "UNKNOWN"
},
"title": "Quadratic time unique_items list validation in Pydantic V1"
}
},
"cveMetadata": {
"assignerOrgId": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"assignerShortName": "Pydantic",
"cveId": "CVE-2026-133422",
"datePublished": "2026-11-20T07:33:35.498Z",
"dateReserved": "2026-11-19T19:33:36.828Z",
"dateUpdated": "2026-11-20T17:21:01.909Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2",
"vulnerability-lookup:meta": {
"epss": {
"cve": "CVE-2026-133422",
"date": "2026-11-22",
"epss": "0.00824",
"percentile": "0.58308"
},
"microsoft_vex": {
"current_release_date": "2026-11-20T18:06:45.000Z",
"cve": "CVE-2026-133422",
"id": "msrc_CVE-2026-133422",
"initial_release_date": "2026-11-20T18:06:45.000Z",
"product_status:under_investigation": "1",
"source": "Microsoft CSAF VEX",
"status": "final",
"title": "Quadratic time unique_items list validation in Pydantic V1",
"url": "https://msrc.microsoft.com/csaf/vex/2026/msrc_cve-2026-133422.json",
"version": "1"
},
"nvd": {
"cve": {
"affected": [
{
"affectedData": [
{
"collectionURL": "https://pypi.org",
"defaultStatus": "unaffected",
"packageName": "pydantic",
"product": "pydantic",
"repo": "https://github.com/pydantic/pydantic",
"vendor": "pydantic",
"versions": [
{
"lessThanOrEqual": "1.10.26",
"status": "affected",
"version": "1.9.0",
"versionType": "python"
}
]
}
],
"source": "7cec5f2f-3032-4006-8740-31f605ffab5f"
}
],
"cveTags": [],
"descriptions": [
{
"lang": "en",
"value": "Validating an untrusted list into a field constrained with unique_items=True with Pydantic V1 takes quadratic time: an input of a few hundred kilobytes takes seconds to validate.\n\nThe ConstrainedList.unique_items_validator validator (in pydantic/types.py) checks each item against all the following ones. For a list with no duplicates (the common, valid case), this results in a quadratic number of comparisons.\n\nThe issue was fixed in commit 6ec75e57f277a820ec583e601167f25fe8dc7c87. Users relying on the pydantic.v1 namespace in Pydantic V2 should upgrade to 2.14.2 or later.\n\nImpact: denial of service through validation of untrusted input. Affected are applications validating untrusted lists into fields constrained with unique_items=True (using conlist() or Field()).\n\nThe fix only applies to lists of builtin scalar types (int, float, str, bytes, bool and None), for which duplicates can be detected in linear time. Lists of other types (e.g. models or dictionaries) are still checked in quadratic time, as their items aren\u0027t guaranteed to be hashable: bound their size using the max_items constraint.\n\nPydantic V2 models are not affected."
}
],
"id": "CVE-2026-133422",
"lastModified": "2026-11-20T18:18:47.837",
"metrics": {
"cvssMetricV40": [
{
"cvssData": {
"Automatable": "NOT_DEFINED",
"Recovery": "NOT_DEFINED",
"Safety": "NOT_DEFINED",
"attackComplexity": "LOW",
"attackRequirements": "NONE",
"attackVector": "NETWORK",
"availabilityRequirement": "NOT_DEFINED",
"baseScore": 6.9,
"baseSeverity": "MEDIUM",
"confidentialityRequirement": "NOT_DEFINED",
"exploitMaturity": "NOT_DEFINED",
"integrityRequirement": "NOT_DEFINED",
"modifiedAttackComplexity": "NOT_DEFINED",
"modifiedAttackRequirements": "NOT_DEFINED",
"modifiedAttackVector": "NOT_DEFINED",
"modifiedPrivilegesRequired": "NOT_DEFINED",
"modifiedSubAvailabilityImpact": "NOT_DEFINED",
"modifiedSubConfidentialityImpact": "NOT_DEFINED",
"modifiedSubIntegrityImpact": "NOT_DEFINED",
"modifiedUserInteraction": "NOT_DEFINED",
"modifiedVulnAvailabilityImpact": "NOT_DEFINED",
"modifiedVulnConfidentialityImpact": "NOT_DEFINED",
"modifiedVulnIntegrityImpact": "NOT_DEFINED",
"privilegesRequired": "NONE",
"providerUrgency": "NOT_DEFINED",
"subAvailabilityImpact": "NONE",
"subConfidentialityImpact": "NONE",
"subIntegrityImpact": "NONE",
"userInteraction": "NONE",
"valueDensity": "NOT_DEFINED",
"vectorString": "CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N/E:X/CR:X/IR:X/AR:X/MAV:X/MAC:X/MAT:X/MPR:X/MUI:X/MVC:X/MVI:X/MVA:X/MSC:X/MSI:X/MSA:X/S:X/AU:X/R:X/V:X/RE:X/U:X",
"version": "4.0",
"vulnAvailabilityImpact": "LOW",
"vulnConfidentialityImpact": "NONE",
"vulnIntegrityImpact": "NONE",
"vulnerabilityResponseEffort": "NOT_DEFINED"
},
"source": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"type": "Secondary"
}
],
"ssvcV203": [
{
"source": "134c704f-9b21-4f2e-91b3-4a467353bcc0",
"ssvcData": {
"id": "CVE-2026-133422",
"options": [
{
"exploitation": "none"
},
{
"automatable": "yes"
},
{
"technicalImpact": "partial"
}
],
"role": "CISA Coordinator",
"timestamp": "2026-11-20T17:20:53.119210Z",
"version": "2.0.3"
}
}
]
},
"published": "2026-11-20T08:18:32.170",
"references": [
{
"source": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"url": "https://github.com/pydantic/pydantic/blob/v1.10.26/pydantic/types.py#L612-L620"
},
{
"source": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"url": "https://github.com/pydantic/pydantic/commit/6ec75e57f277a820ec583e601167f25fe8dc7c87"
},
{
"source": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"url": "https://github.com/pydantic/pydantic/releases/tag/v2.14.2"
},
{
"source": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"url": "https://github.com/pydantic/pydantic/security/advisories/GHSA-49g6-96jj-f7r9"
}
],
"sourceIdentifier": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"vulnStatus": "Received",
"weaknesses": [
{
"description": [
{
"lang": "en",
"value": "CWE-407"
}
],
"source": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"type": "Secondary"
}
]
}
},
"redhat_vex": {
"aggregate_severity": "Moderate",
"current_release_date": "2026-11-20T11:28:47+00:00",
"cve": "CVE-2026-133422",
"id": "CVE-2026-133422",
"initial_release_date": "2026-11-20T07:33:35.498000+00:00",
"product_status:known_affected": "133",
"source": "Red Hat CSAF VEX",
"status": "final",
"title": "pydantic: pydantic: Denial of Service via inefficient unique items validation",
"url": "https://security.access.redhat.com/data/csaf/v2/vex/2026/cve-2026-133422.json",
"version": "3"
},
"vulnrichment": {
"containers": {
"adp": [
{
"metrics": [
{
"other": {
"content": {
"id": "CVE-2026-133422",
"options": [
{
"Exploitation": "none"
},
{
"Automatable": "yes"
},
{
"Technical Impact": "partial"
}
],
"role": "CISA Coordinator",
"timestamp": "2026-11-20T17:20:53.119210Z",
"version": "2.0.3"
},
"type": "ssvc"
}
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T17:20:57.939Z",
"orgId": "134c704f-9b21-4f2e-91b3-4a467353bcc0",
"shortName": "CISA-ADP"
},
"title": "CISA ADP Vulnrichment"
}
],
"cna": {
"affected": [
{
"collectionURL": "https://pypi.org",
"defaultStatus": "unaffected",
"packageName": "pydantic",
"product": "pydantic",
"repo": "https://github.com/pydantic/pydantic",
"vendor": "pydantic",
"versions": [
{
"lessThanOrEqual": "1.10.26",
"status": "affected",
"version": "1.9.0",
"versionType": "python"
}
]
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "iamibi"
}
],
"descriptions": [
{
"lang": "en",
"supportingMedia": [
{
"base64": false,
"type": "text/html",
"value": "\u003ch3\u003eSummary\u003c/h3\u003e\n\u003cp\u003eValidating an untrusted list into a field constrained with \u003ccode\u003eunique_items=True\u003c/code\u003e with Pydantic V1 takes quadratic time: an input of a few hundred kilobytes takes seconds to validate.\u003c/p\u003e\n\u003ch3\u003eDetails\u003c/h3\u003e\n\u003cp\u003eThe \u003ca href=\"https://github.com/pydantic/pydantic/blob/v1.10.26/pydantic/types.py#L612-L620\"\u003e\u003ccode\u003eConstrainedList.unique_items_validator\u003c/code\u003e\u003c/a\u003e validator (in \u003ccode\u003epydantic/types.py\u003c/code\u003e) checks each item against all the following ones:\u003c/p\u003e\n\u003cpre\u003e\u003ccode class=\"language-python\"\u003e@classmethod\ndef unique_items_validator(cls, v: \u0027Optional[List[T]]\u0027) -\u0026gt; \u0027Optional[List[T]]\u0027:\n if v is None:\n return None\n\n for i, value in enumerate(v, start=1):\n if value in v[i:]:\n raise errors.ListUniqueItemsError()\n\n return v\n\u003c/code\u003e\u003c/pre\u003e\n\u003cp\u003eFor a list with no duplicates (the common, valid case), this results in a quadratic number of comparisons.\u003c/p\u003e\n\u003cp\u003eThe issue was fixed in commit \u003ca href=\"https://github.com/pydantic/pydantic/commit/6ec75e57f277a820ec583e601167f25fe8dc7c87\"\u003e6ec75e57f277a820ec583e601167f25fe8dc7c87\u003c/a\u003e.\u003c/p\u003e\n\u003cp\u003eIf you are relying on the \u003ccode\u003epydantic.v1\u003c/code\u003e namespace in Pydantic V2, upgrade to \u003ca href=\"https://github.com/pydantic/pydantic/releases/tag/v2.14.2\"\u003eV2.14.2\u003c/a\u003e or later.\u003c/p\u003e\n\u003ch3\u003eImpact\u003c/h3\u003e\n\u003cp\u003eDenial of service through validation of untrusted input. Affected are applications validating untrusted lists into fields constrained with \u003ccode\u003eunique_items=True\u003c/code\u003e (using \u003ccode\u003econlist()\u003c/code\u003e or \u003ccode\u003eField()\u003c/code\u003e).\u003c/p\u003e\n\u003cp\u003eThe fix only applies to lists of builtin scalar types (\u003ccode\u003eint\u003c/code\u003e, \u003ccode\u003efloat\u003c/code\u003e, \u003ccode\u003estr\u003c/code\u003e, \u003ccode\u003ebytes\u003c/code\u003e, \u003ccode\u003ebool\u003c/code\u003e and \u003ccode\u003eNone\u003c/code\u003e), for which duplicates can be detected in linear time. Lists of other types (e.g. models or dictionaries) are still checked in quadratic time, as their items aren\u0027t guaranteed to be hashable: bound their size using the \u003ccode\u003emax_items\u003c/code\u003e constraint.\u003c/p\u003e\n\u003cp\u003ePydantic V2 models are not affected.\u003c/p\u003e"
}
],
"value": "Validating an untrusted list into a field constrained with unique_items=True with Pydantic V1 takes quadratic time: an input of a few hundred kilobytes takes seconds to validate.\n\nThe ConstrainedList.unique_items_validator validator (in pydantic/types.py) checks each item against all the following ones. For a list with no duplicates (the common, valid case), this results in a quadratic number of comparisons.\n\nThe issue was fixed in commit 6ec75e57f277a820ec583e601167f25fe8dc7c87. Users relying on the pydantic.v1 namespace in Pydantic V2 should upgrade to 2.14.2 or later.\n\nImpact: denial of service through validation of untrusted input. Affected are applications validating untrusted lists into fields constrained with unique_items=True (using conlist() or Field()).\n\nThe fix only applies to lists of builtin scalar types (int, float, str, bytes, bool and None), for which duplicates can be detected in linear time. Lists of other types (e.g. models or dictionaries) are still checked in quadratic time, as their items aren\u0027t guaranteed to be hashable: bound their size using the max_items constraint.\n\nPydantic V2 models are not affected."
}
],
"metrics": [
{
"cvssV4_0": {
"baseScore": 6.9,
"baseSeverity": "MEDIUM",
"vectorString": "CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N",
"version": "4.0"
}
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-407",
"description": "CWE-407: Inefficient Algorithmic Complexity",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-11-20T07:33:35.498Z",
"orgId": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"shortName": "Pydantic"
},
"references": [
{
"tags": [
"vendor-advisory"
],
"url": "https://github.com/pydantic/pydantic/security/advisories/GHSA-49g6-96jj-f7r9"
},
{
"url": "https://github.com/pydantic/pydantic/blob/v1.10.26/pydantic/types.py#L612-L620"
},
{
"url": "https://github.com/pydantic/pydantic/commit/6ec75e57f277a820ec583e601167f25fe8dc7c87"
},
{
"url": "https://github.com/pydantic/pydantic/releases/tag/v2.14.2"
}
],
"source": {
"advisory": "GHSA-49g6-96jj-f7r9",
"discovery": "UNKNOWN"
},
"title": "Quadratic time unique_items list validation in Pydantic V1"
}
},
"cveMetadata": {
"assignerOrgId": "7cec5f2f-3032-4006-8740-31f605ffab5f",
"assignerShortName": "Pydantic",
"cveId": "CVE-2026-133422",
"datePublished": "2026-11-20T07:33:35.498Z",
"dateReserved": "2026-11-19T19:33:36.828Z",
"dateUpdated": "2026-11-20T17:21:01.909Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2"
}
}
}
Loading…
Loading…
Experimental. This forecast is provided for visualization only and may change without notice. Do not use it for operational decisions.
Forecast uses a logistic model when the trend is rising, or an exponential decay model when the trend is falling. Fitted via linearized least squares.
Sightings
| Author | Source | Type | Date | Other |
|---|
Nomenclature
- Seen: The vulnerability was mentioned, discussed, or observed by the user.
- Confirmed: The vulnerability has been validated from an analyst's perspective.
- Published Proof of Concept: A public proof of concept is available for this vulnerability.
- Exploited: The vulnerability was observed as exploited by the user who reported the sighting.
- Patched: The vulnerability was observed as successfully patched by the user who reported the sighting.
- Not exploited: The vulnerability was not observed as exploited by the user who reported the sighting.
- Not confirmed: The user expressed doubt about the validity of the vulnerability.
- Not patched: The vulnerability was not observed as successfully patched by the user who reported the sighting.
Loading…
Loading…
The MITRE ATT&CK techniques below are AI-generated suggestions, inferred from the description of the
vulnerability by the CIRCL/vulnerability-attack-technique-classification-roberta-base
model, served locally by ML-Gateway.
They have not been verified by an analyst and are provided for guidance only.
The approach is described in our paper Mapping CVEs to MITRE ATT&CK Techniques: A Curated Gold-Set Classifier and the Limits of LLM-Assisted Label Expansion.
Browse all ATT&CK techniques and the vulnerabilities related to each.
The approach is described in our paper Mapping CVEs to MITRE ATT&CK Techniques: A Curated Gold-Set Classifier and the Limits of LLM-Assisted Label Expansion.
Browse all ATT&CK techniques and the vulnerabilities related to each.
Loading…
Related by attack behaviour
Vulnerabilities whose description is nearest to this one in the vector space of the CIRCL/vulnerability-attack-technique-biencoder model. This is a similarity search over the bi-encoder space (plain cosine), not a classification, and it has no measured accuracy.
Loading…