CVE Vulnerabilities

CVE-2020-1711

Heap-based Buffer Overflow

Published: Feb 11, 2020 | Modified: Nov 21, 2024
CVSS 3.x
6
MEDIUM
Source:
NVD
CVSS:3.1/AV:N/AC:H/PR:L/UI:N/S:C/C:L/I:L/A:L
CVSS 2.x
6 MEDIUM
AV:N/AC:M/Au:S/C:P/I:P/A:P
RedHat/V2
RedHat/V3
6 IMPORTANT
CVSS:3.1/AV:N/AC:H/PR:L/UI:N/S:C/C:L/I:L/A:L
Ubuntu
MEDIUM
root.io logo minimus.io logo echo.ai logo

An out-of-bounds heap buffer access flaw was found in the way the iSCSI Block driver in QEMU versions 2.12.0 before 4.2.1 handled a response coming from an iSCSI server while checking the status of a Logical Address Block (LBA) in an iscsi_co_block_status() routine. A remote user could use this flaw to crash the QEMU process, resulting in a denial of service or potential execution of arbitrary code with privileges of the QEMU process on the host.

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
QemuQemu2.12.0 (including)4.2.1 (excluding)
Advanced Virtualization for RHEL 8.1.1RedHatvirt:8.1-8010120200215151946.5db1954d*
Advanced Virtualization for RHEL 8.1.1RedHatvirt-devel:8.1-8010120200215151946.5db1954d*
Red Hat Enterprise Linux 7RedHatqemu-kvm-ma-10:2.12.0-44.el7*
Red Hat Enterprise Linux 7.5 Extended Update SupportRedHatqemu-kvm-ma-10:2.10.0-21.el7_5.5*
Red Hat Enterprise Linux 7.6 Extended Update SupportRedHatqemu-kvm-ma-10:2.12.0-18.el7_6.5*
Red Hat Enterprise Linux 7.7 Extended Update SupportRedHatqemu-kvm-ma-10:2.12.0-33.el7_7.3*
Red Hat Enterprise Linux 8RedHatvirt-devel:rhel-8010020200304114113.c27ad7f8*
Red Hat Enterprise Linux 8RedHatvirt:rhel-8010020200304114113.c27ad7f8*
Red Hat Enterprise Linux 8.0 Update Services for SAP SolutionsRedHatvirt:rhel-8000020200331183759.f8e95b4e*
Red Hat OpenStack Platform 10.0 (Newton)RedHatqemu-kvm-rhev-10:2.12.0-33.el7_7.10*
Red Hat OpenStack Platform 13.0 (Queens)RedHatqemu-kvm-rhev-10:2.12.0-44.el7*
Red Hat OpenStack Platform 13.0 (Queens) for RHEL 7.6 EUSRedHatqemu-kvm-rhev-10:2.12.0-18.el7_6.9*
Red Hat Virtualization 4 for Red Hat Enterprise Linux 7RedHatqemu-kvm-rhev-10:2.12.0-44.el7*
Red Hat Virtualization Engine 4.2RedHatqemu-kvm-rhev-10:2.12.0-18.el7_6.9*
Red Hat Virtualization Engine 4.3RedHatqemu-kvm-rhev-10:2.12.0-44.el7*
QemuUbuntubionic*
QemuUbuntudevel*
QemuUbuntueoan*
QemuUbuntuesm-infra-legacy/trusty*
QemuUbuntuesm-infra/bionic*
QemuUbuntuesm-infra/focal*
QemuUbuntuesm-infra/xenial*
QemuUbuntufocal*
QemuUbuntugroovy*
QemuUbuntuhirsute*
QemuUbuntuimpish*
QemuUbuntujammy*
QemuUbuntukinetic*
QemuUbuntulunar*
QemuUbuntumantic*
QemuUbuntunoble*
QemuUbuntuoracular*
QemuUbuntuplucky*
QemuUbuntuquesting*
QemuUbuntutrusty*
QemuUbuntutrusty/esm*
QemuUbuntuxenial*
Qemu-kvmUbuntuprecise/esm*

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