CVE Vulnerabilities


Improper Restriction of Operations within the Bounds of a Memory Buffer

Published: Oct 06, 2007 | Modified: Jul 29, 2017
CVSS 3.x
CVSS 2.x
9.3 HIGH

Multiple stack-based buffer overflows in Borland InterBase LI through, and WI through, allow remote attackers to execute arbitrary code via (1) a long service attach request on TCP port 3050 to the (a) SVC_attach or (b) INET_connect function, (2) a long create request on TCP port 3050 to the (c) isc_create_database or (d) jrd8_create_database function, (3) a long attach request on TCP port 3050 to the (e) isc_attach_database or (f) PWD_db_aliased function, or unspecified vectors involving the (4) jrd8_attach_database or (5) expand_filename2 function.


The product performs operations on a memory buffer, but it can read from or write to a memory location that is outside of the intended boundary of the buffer.

Affected Software

Name Vendor Start Version End Version
Interbase Borland_software li_8.0.0.54 li_8.0.0.54
Interbase Borland_software wi-v7.5.0.129 wi-v7.5.0.129
Interbase Borland_software wi-v6.0.1.6 wi-v6.0.1.6
Interbase Borland_software wi-v5.1.1.680 wi-v5.1.1.680
Interbase Borland_software wi-v8.0.0.123 wi-v8.0.0.123
Interbase Borland_software wi-v5.5.0.742 wi-v5.5.0.742
Interbase Borland_software wi_5.1.1.680 wi_5.1.1.680
Interbase Borland_software wi-v6.0.0.627 wi-v6.0.0.627
Interbase Borland_software li_8.0.0.253 li_8.0.0.253
Interbase Borland_software wi-v7.0.1.1 wi-v7.0.1.1
Interbase Borland_software wi_8.1.0.257 wi_8.1.0.257
Interbase Borland_software wi-v6.0.1.0 wi-v6.0.1.0
Interbase Borland_software wi-v6.5.0.28 wi-v6.5.0.28
Interbase Borland_software wi-v7.5.1.80 wi-v7.5.1.80
Interbase Borland_software wi-o6.0.2.0 wi-o6.0.2.0
Interbase Borland_software wi-o6.0.1.6 wi-o6.0.1.6
Interbase Borland_software li_8.0.0.53 li_8.0.0.53

Extended Description

Certain languages allow direct addressing of memory locations and do not automatically ensure that these locations are valid for the memory buffer that is being referenced. This can cause read or write operations to be performed on memory locations that may be associated with other variables, data structures, or internal program data. As a result, an attacker may be able to execute arbitrary code, alter the intended control flow, read sensitive information, or cause the system to crash.

Potential Mitigations

  • Use a language that does not allow this weakness to occur or provides constructs that make this weakness easier to avoid.

  • For example, many languages that perform their own memory management, such as Java and Perl, are not subject to buffer overflows. Other languages, such as Ada and C#, typically provide overflow protection, but the protection can be disabled by the programmer.

  • Be wary that a language’s interface to native code may still be subject to overflows, even if the language itself is theoretically safe.

  • Use a vetted library or framework that does not allow this weakness to occur or provides constructs that make this weakness easier to avoid.

  • Examples include the Safe C String Library (SafeStr) by Messier and Viega [REF-57], and the Strsafe.h library from Microsoft [REF-56]. These libraries provide safer versions of overflow-prone string-handling functions.

  • 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.

  • Consider adhering to the following rules when allocating and managing an application’s memory:

  • 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].

  • Use a CPU and operating system that offers Data Execution Protection (using hardware NX or XD bits) or the equivalent techniques that simulate this feature in software, such as PaX [REF-60] [REF-61]. These techniques ensure that any instruction executed is exclusively at a memory address that is part of the code segment.

  • For more information on these techniques see D3-PSEP (Process Segment Execution Prevention) from D3FEND [REF-1336].