992
Reference Description
https://www.cve.org/CVERecord?id=CVE-1999-0513
CVE-1999-1379 DNS query with spoofed source address causes more traffic to be returned to
spoofed address than was sent by the attacker.
https://www.cve.org/CVERecord?id=CVE-1999-1379
CVE-2000-0041 Large datagrams are sent in response to malformed datagrams.
https://www.cve.org/CVERecord?id=CVE-2000-0041
CVE-1999-1066 Game server sends a large amount.
https://www.cve.org/CVERecord?id=CVE-1999-1066
CVE-2013-5211 composite: NTP feature generates large responses (high amplification factor)
with spoofed UDP source addresses.
https://www.cve.org/CVERecord?id=CVE-2013-5211
MemberOf Relationships
This MemberOf relationships table shows additional CWE Catgeories and Views that reference this
weakness as a member. This information is often useful in understanding where a weakness fits
within the context of external information sources.
Nature Type ID Name Page
MemberOf 884 CWE Cross-section 884 2567
MemberOf 977 SFP Secondary Cluster: Design 888 2407
MemberOf 1382 ICS Operations (& Maintenance): Emerging Energy
Technologies
1358 2517
MemberOf 1416 Comprehensive Categorization: Resource Lifecycle
Management
1400 2545
Notes
Relationship
This can be resultant from weaknesses that simplify spoofing attacks.
Theoretical
Network amplification, when performed with spoofing, is normally a multi-channel attack from
attacker (acting as user) to amplifier, and amplifier to victim.
Taxonomy Mappings
Mapped Taxonomy Name Node ID Fit Mapped Node Name
PLOVER Network Amplification
CWE-407: Inefficient Algorithmic Complexity
Weakness ID : 407
Structure : Simple
Abstraction : Class
Description
An algorithm in a product has an inefficient worst-case computational complexity that may be
detrimental to system performance and can be triggered by an attacker, typically using crafted
manipulations that ensure that the worst case is being reached.
Relationships
The table(s) below shows the weaknesses and high level categories that are related to this
weakness. These relationships are defined as ChildOf, ParentOf, MemberOr and give insight to
similar items that may exist at higher and lower levels of abstraction. In addition, relationships such
as PeerOf and CanAlsoBe are defined to show similar weaknesses that may want to be explored.
CWE Version 4.14
CWE-407: Inefficient Algorithmic Complexity
CWE-407: Inefficient Algorithmic Complexity