CVE Vulnerabilities

CVE-2026-11610

Heap-based Buffer Overflow

Published: Jul 07, 2026 | Modified: Jul 08, 2026
CVSS 3.x
N/A
Source:
NVD
CVSS 2.x
RedHat/V2
RedHat/V3
8.8 IMPORTANT
CVSS:3.1/AV:N/AC:L/PR:L/UI:N/S:U/C:H/I:H/A:H
Ubuntu
MEDIUM
root.io logo minimus.io logo echo.ai logo

A heap buffer overflow flaw was found in the SASL I/O layer of 389 Directory Server (389-ds-base). After a successful SASL bind with integrity protection (SSF > 0), an authenticated attacker can send a specially crafted oversized LDAP UNBIND packet that is copied into a 512-byte heap receive buffer without a bounds check in sasl_io_recv() in sasl_io.c. This allows up to approximately 2 megabytes of attacker-controlled data to overflow the buffer, causing a denial of service (server crash). In FreeIPA and Red Hat Identity Management deployments, any domain user with a valid Kerberos ticket, any enrolled host, or any service account can trigger this vulnerability over the network after authenticating via GSSAPI. The vulnerable code path has existed since approximately 2013 (389-ds-base 1.3.2) and was not addressed by the CVE-2025-14905 fix, which patched a separate heap overflow in schema.c only.

Weakness

A heap overflow condition is a buffer overflow, where the buffer that can be overwritten is allocated in the heap portion of memory, generally meaning that the buffer was allocated using a routine such as malloc().

Affected Software

NameVendorStart VersionEnd Version
Red Hat Directory Server 11.5 E4S for RHEL 8RedHatredhat-ds:11-8060020260702180044.0ca98e7e*
Red Hat Directory Server 11.7 E4S for RHEL 8RedHatredhat-ds:11-8080020260702180836.f969626e*
Red Hat Directory Server 11.9 for RHEL 8RedHatredhat-ds:11-8100020260702145313.37ed7c03*
Red Hat Directory Server 12.2 E4S for RHEL 9RedHatredhat-ds:12-9020020260703060155.1674d574*
Red Hat Directory Server 12.4 E4S for RHEL 9RedHatredhat-ds:12-9040020260703055735.1674d574*
Red Hat Enterprise Linux 10RedHat389-ds-base-0:3.2.0-8.el10_2*
Red Hat Enterprise Linux 10.0 Extended Update SupportRedHat389-ds-base-0:3.0.6-19.el10_0*
Red Hat Enterprise Linux 7 Extended Lifecycle SupportRedHat389-ds-base-0:1.3.11.1-13.el7_9*
Red Hat Enterprise Linux 8RedHat389-ds:1.4-8100020260626120929.25e700aa*
Red Hat Enterprise Linux 8.4 Advanced Mission Critical Update SupportRedHat389-ds:1.4-8040020260629123121.96015a92*
Red Hat Enterprise Linux 8.4 Extended Update Support Long-Life Add-OnRedHat389-ds:1.4-8040020260629123121.96015a92*
Red Hat Enterprise Linux 8.6 Advanced Mission Critical Update SupportRedHat389-ds:1.4-8060020260626130540.824efc52*
Red Hat Enterprise Linux 8.6 Extended Update Support Long-Life Add-OnRedHat389-ds:1.4-8060020260626130540.824efc52*
Red Hat Enterprise Linux 8.8 Telecommunications Update ServiceRedHat389-ds:1.4-8080020260630025241.6dbb3803*
Red Hat Enterprise Linux 8.8 Update Services for SAP SolutionsRedHat389-ds:1.4-8080020260630025241.6dbb3803*
Red Hat Enterprise Linux 9RedHat389-ds-base-0:2.8.0-8.el9_8*
Red Hat Enterprise Linux 9.2 Update Services for SAP SolutionsRedHat389-ds-base-0:2.2.4-19.el9_2*
Red Hat Enterprise Linux 9.4 Update Services for SAP SolutionsRedHat389-ds-base-0:2.4.5-26.el9_4*
Red Hat Enterprise Linux 9.6 Extended Update SupportRedHat389-ds-base-0:2.6.1-22.el9_6*
Red Hat Directory Server 13.2RedHatdirsrv/dirsrv-container-rhel10:1783452100*
389-ds-baseUbuntuquesting*

Potential Mitigations

  • Use automatic buffer overflow detection mechanisms that are offered by certain compilers or compiler extensions. Examples include: the Microsoft Visual Studio /GS flag, Fedora/Red Hat FORTIFY_SOURCE GCC flag, StackGuard, and ProPolice, which provide various mechanisms including canary-based detection and range/index checking.
  • D3-SFCV (Stack Frame Canary Validation) from D3FEND [REF-1334] discusses canary-based detection in detail.
  • Run or compile the software using features or extensions that randomly arrange the positions of a program’s executable and libraries in memory. Because this makes the addresses unpredictable, it can prevent an attacker from reliably jumping to exploitable code.
  • Examples include Address Space Layout Randomization (ASLR) [REF-58] [REF-60] and Position-Independent Executables (PIE) [REF-64]. Imported modules may be similarly realigned if their default memory addresses conflict with other modules, in a process known as “rebasing” (for Windows) and “prelinking” (for Linux) [REF-1332] using randomly generated addresses. ASLR for libraries cannot be used in conjunction with prelink since it would require relocating the libraries at run-time, defeating the whole purpose of prelinking.
  • For more information on these techniques see D3-SAOR (Segment Address Offset Randomization) from D3FEND [REF-1335].

References