ID CVE-2018-6922
Summary One of the data structures that holds TCP segments in all versions of FreeBSD prior to 11.2-RELEASE-p1, 11.1-RELEASE-p12, and 10.4-RELEASE-p10 uses an inefficient algorithm to reassemble the data. This causes the CPU time spent on segment processing to grow linearly with the number of segments in the reassembly queue. An attacker who has the ability to send TCP traffic to a victim system can degrade the victim system's network performance and/or consume excessive CPU by exploiting the inefficiency of TCP reassembly handling, with relatively small bandwidth cost.
References
Vulnerable Configurations
  • cpe:2.3:o:freebsd:freebsd:10.4:-:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:-:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:10.4:p1:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:p1:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:10.4:p3:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:p3:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:10.4:p4:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:p4:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:10.4:p5:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:p5:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:10.4:p6:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:p6:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:10.4:p7:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:p7:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:10.4:p8:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:p8:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:10.4:p9:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:10.4:p9:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:-:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:-:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:p1:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:p1:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:p11:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:p11:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:p2:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:p2:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:p4:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:p4:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:p5:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:p5:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:p6:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:p6:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:p7:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:p7:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.1:p9:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.1:p9:*:*:*:*:*:*
  • cpe:2.3:o:freebsd:freebsd:11.2:-:*:*:*:*:*:*
    cpe:2.3:o:freebsd:freebsd:11.2:-:*:*:*:*:*:*
CVSS
Base: 5.0 (as of 09-10-2019 - 23:42)
Impact:
Exploitability:
CWE CWE-400
CAPEC
  • XML Entity Expansion
    An attacker submits an XML document to a target application where the XML document uses nested entity expansion to produce an excessively large output XML. XML allows the definition of macro-like structures that can be used to simplify the creation of complex structures. However, this capability can be abused to create excessive demands on a processor's CPU and memory. A small number of nested expansions can result in an exponential growth in demands on memory.
  • Regular Expression Exponential Blowup
    An adversary may execute an attack on a program that uses a poor Regular Expression(Regex) implementation by choosing input that results in an extreme situation for the Regex. A typical extreme situation operates at exponential time compared to the input size. This is due to most implementations using a Nondeterministic Finite Automaton(NFA) state machine to be built by the Regex algorithm since NFA allows backtracking and thus more complex regular expressions. The algorithm builds a finite state machine and based on the input transitions through all the states until the end of the input is reached. NFA engines may evaluate each character in the input string multiple times during the backtracking. The algorithm tries each path through the NFA one by one until a match is found; the malicious input is crafted so every path is tried which results in a failure. Exploitation of the Regex results in programs hanging or taking a very long time to complete. These attacks may target various layers of the Internet due to regular expressions being used in validation.
  • XML Ping of the Death
    An attacker initiates a resource depletion attack where a large number of small XML messages are delivered at a sufficiently rapid rate to cause a denial of service or crash of the target. Transactions such as repetitive SOAP transactions can deplete resources faster than a simple flooding attack because of the additional resources used by the SOAP protocol and the resources necessary to process SOAP messages. The transactions used are immaterial as long as they cause resource utilization on the target. In other words, this is a normal flooding attack augmented by using messages that will require extra processing on the target.
Access
VectorComplexityAuthentication
NETWORK LOW NONE
Impact
ConfidentialityIntegrityAvailability
NONE NONE PARTIAL
cvss-vector via4 AV:N/AC:L/Au:N/C:N/I:N/A:P
refmap via4
bid 105058
confirm
freebsd FreeBSD-SA-18:08
sectrack 1041425
Last major update 09-10-2019 - 23:42
Published 09-08-2018 - 18:29
Last modified 09-10-2019 - 23:42
Back to Top