Cyber Resilience

CVE-2024-1062

Memory Safety in Redhat Directory Server 11.7 … 12.0

Memory Safety
Published
12 February 2024
Modified
17 June 2026
Patch / advisory
View advisory
CVSS Score v3.1 5.5
Click a component to see what it means
Raw vectorCVSS:3.1/AV:L/AC:L/PR:L/UI:N/S:U/C:N/I:N/A:H
EPSS Score 0.0030 23th percentile
Risk Priority 42 floored blend · peak EPSS

Summary

CVE-2024-1062 is a medium-severity Heap-based Buffer Overflow (CWE-122) vulnerability in Redhat Directory Server. Its CVSS base score is 5.5 (Medium).

Operationally, exploitation aligns with the MITRE ATT&CK technique Exploitation for Privilege Escalation (T1068); ranked at the 23th percentile by exploit likelihood (below the median); it is not currently listed in the CISA KEV catalog.

The strongest mitigations our analysis identified map to SA-11 (Developer Testing and Evaluation) and SI-10 (Information Input Validation) — see the control section below for these in your framework.

EU & UK References

Vulnerability Data

A heap overflow flaw was found in 389-ds-base. This issue leads to a denial of service when writing a value larger than 256 chars in log_entry_attr.

CWE(s)
CWE-122

Related Threats

MITRE ATT&CK Enterprise Techniques

T1068 Exploitation for Privilege Escalation Privilege Escalation
Adversaries may exploit software vulnerabilities in an attempt to elevate privileges.
attack.mitre.org →
T1190 Exploit Public-Facing Application Initial Access
Adversaries may attempt to exploit a weakness in an Internet-facing host or system to initially access a network.
attack.mitre.org →
T1203 Exploitation for Client Execution Execution
Adversaries may exploit software vulnerabilities in client applications to execute code.
attack.mitre.org →
T1210 Exploitation of Remote Services Lateral Movement
Adversaries may exploit remote services to gain unauthorized access to internal systems once inside of a network.
attack.mitre.org →
T1212 Exploitation for Credential Access Credential Access
Adversaries may exploit software vulnerabilities in an attempt to collect credentials.
attack.mitre.org →
Derived from this CVE’s CWE(s) via the direct CWE→ATT&CK cross-walk.

CVEs Like This One

CVE-2026-14940Same product: Redhat 389 Directory Server
CVE-2026-5201Same product: Redhat Enterprise Linux
CVE-2023-0494Same product: Fedoraproject Fedora
CVE-2023-43787Same product: Fedoraproject Fedora
CVE-2023-4806Same product: Fedoraproject Fedora
CVE-2023-3899Same product: Fedoraproject Fedora
CVE-2023-51795Same product: Fedoraproject Fedora
CVE-2024-3209Same product: Fedoraproject Fedora
CVE-2023-49528Same product: Fedoraproject Fedora
CVE-2026-12610Same product: Redhat Enterprise Linux

Affected Assets

redhat
389 directory server
≤ 2.2.0
redhat
directory server
11.7, 11.8, 12.0, all versions
fedoraproject
fedora
39, 40, 41
redhat
enterprise linux
8.0
redhat
enterprise linux eus
8.6, 8.8, 9.2
redhat
enterprise linux for arm 64 eus
8.6, 8.8, 9.2
redhat
enterprise linux for ibm z systems
9.2
redhat
enterprise linux for ibm z systems eus
8.8
redhat
enterprise linux for power little endian eus
8.8, 9.2
redhat
enterprise linux server aus
8.6, 9.2
+3 more product configuration(s) — see NVD for full list

Mitigating Controls

Control response

Prevent
Stop it (NIST 800-53)

—

Detect
Catch it (NIST detect / respond)

—

Harden
Shrink the surface (DISA STIG)

—

Validate
Prove the fix (OWASP ASVS)
  • V1.4.1

Mitigating Controls (NIST 800-53 r5) AI

SA-11 Developer Testing and Evaluation good match

Developer testing and evaluation (including fuzzing and memory-error detectors) can discover heap overflows after they have been coded.

SI-10 Information Input Validation good match

Input validation enforces bounds checking on data written to heap buffers, directly stopping the overflow condition from being introduced.

SA-8 Security and Privacy Engineering Principles partial match

Security engineering principles require use of memory-safe constructs and bounds-checked allocation routines that avoid introducing heap overflows.

SI-16 Memory Protection partial match

Memory-protection mechanisms limit the ability of a heap overflow to execute attacker-controlled code or corrupt adjacent structures.

Mitigating Controls (NIST CSF 2.0) AI

Derived directly from the weakness types (CWEs) cited in the NVD entry via our AI-authored CWE→CSF cross-walk (authority under review) — links open the control.

PR.PS-06 full match
prevents

Secure-development practices directly require bounds checking and safe memory handling that prevent heap overflows.

ID.RA-01 partial match
prevents

Vulnerability scanning and recording can discover heap-overflow flaws but does not prevent their introduction in code.

PR.PS-02 partial match
prevents

Timely patching removes known heap-overflow instances after they exist.

Mitigating Controls (ISO/IEC 27001:2022 Annex A) AI

Derived directly from the weakness types (CWEs) cited in the NVD entry via our AI-authored CWE→ISO cross-walk (authority under review) — links open the control.

A.8.29 Security testing in development and acceptance mostly match
finds

Security testing in development and acceptance can detect heap overflows before release.

A.8.25 Secure development life cycle partial match
prevents

Secure development lifecycle mandates practices that reduce the likelihood of introducing heap overflows.

A.8.26 Application security requirements partial match
prevents

Application security requirements can specify bounds-checking and safe memory APIs that mitigate heap overflows.

A.8.27 Secure system architecture and engineering principles partial match
prevents

Secure architecture and engineering principles include memory-safety and input-validation controls that address heap overflows.

A.8.28 Secure coding partial match
prevents

Secure coding standards directly prescribe techniques (safe functions, bounds checks) that prevent heap-based buffer overflows.

A.8.32 Change management none match
none

Change management ensures controlled deployment of fixes for discovered heap-overflow vulnerabilities.

References