A method and system for managing a network attack blacklist using dynamic redirection
Through the dynamic redirected network attack blacklist management method, the problem of the decline in query efficiency and increase in false alarm rate during dynamic expansion of the network attack blacklist in the existing technology is solved, and the stable false alarm rate and query efficiency are achieved, and the adaptability is achieved. Strongly sexually managed cyberattacks blacklist.
Patent Information
- Application Number
- CN202411059960.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-05
- Publication Date
- 2024-11-01
- Estimated Expiration
- 2044-08-05
AI Technical Summary
In the prior art, the approximate member query method of the cyberattack blacklist will lead to a decrease in query efficiency and an increase in false positive rate during the dynamic expansion process, affecting the real-time identification and blocking capabilities of the cyberattack defense system.
Adopt dynamic redirection of network attack blacklist management method, by initializing the blacklist and blacklist feature table, determine whether to insert or move it into a new blacklist based on the value of the tag, and adjust the blacklist feature table during the expansion process. , ensure query efficiency and accuracy.
It realizes the maintenance of stable false alarm rate and query efficiency during dynamic expansion, ensures the adaptability and accuracy of the network attack blacklist, and avoids the problems of extended query response time and increased false alarm rate.
Smart Images

Figure CN118590318B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of computer technology, and in particular to a method and system for managing a network attack blacklist with dynamic redirection. Background Art
[0002] A network attack blacklist is a list that records known or suspected network attackers, attack sources, or malicious behaviors. Its function is to help the network attack defense system record network attack items that have been detected by the defense system, and identify and block network attack items that have been detected in incoming network traffic, thereby achieving high-performance network security defense.
[0003] At present, the existing network attack blacklist technologies mainly include rule-based blacklists, feature-based blacklists, and behavior analysis-based blacklists. Rule-based blacklists mainly rely on predefined rules, such as IP addresses, domain names, etc., to identify and block known network attack entries. Feature-based blacklists use feature matching technologies, such as regular expressions and string matching, to detect and filter network traffic. Behavior analysis-based blacklists identify and block abnormal behaviors and potential attacks by monitoring and analyzing the behavior patterns of network traffic. Although the existing network attack blacklist technology provides network security protection to a certain extent, traditional network attack blacklist management methods often have problems such as low efficiency, difficulty in dealing with large-scale network attack entries, and large memory usage.
[0004] Approximate Membership Queries (AMQ) is a data structure, also known as a filter, that can represent a set in a compact space and can estimate whether an element is a member of the set. This method has high query efficiency and can perform membership queries in constant time regardless of the size of the set. There are multiple advantages in applying the approximate membership query method to network attack blacklist management. First, the AMQ method can efficiently identify known network attack entries (such as network attackers or malicious behaviors), and the query speed can be kept in constant time regardless of the size of the network attack blacklist, thereby greatly improving the real-time and accuracy of network security defense. Second, the AMQ method uses a compact data structure with low memory usage, which can significantly reduce hardware costs and improve the scalability of the system. In addition, the AMQ method can also support the update and deletion of the network attack blacklist, and it takes effect immediately: new network attack entries can be added to the network attack blacklist at any time, and invalid network attack entries can be deleted from the network attack blacklist in a timely manner. Using the approximate membership query method for network attack blacklist management can provide a more efficient, flexible and economical solution for network security and effectively deal with increasingly complex network security threats.
[0005] As the network attack defense system detects, the size and content of the network attack blacklist will continue to change. When new network attack entries continue to appear, the network attack blacklist based on the approximate member query method will face the problem of increased false positive rate due to the storage of network attack entries that exceed its own storage capacity. This will cause a large number of normal network entries in the network to be reported as existing in the network attack blacklist, affecting normal network services. Therefore, it is necessary to flexibly expand and adjust the approximate member query data structure used by the network attack blacklist to adapt to the changes in the network attack blacklist.
[0006] However, the current dynamic expansion method may lead to a decrease in query efficiency and an increase in false alarm rate, especially during the expansion process, the time consumed by element query gradually increases, and the false alarm rate will also increase accordingly. For the network attack blacklist, this may mean that during the network attack blacklist update process, the network attack defense system may face longer query response time and more query false alarms, thereby reducing the real-time identification and blocking capabilities of potential network attacks. Summary of the invention
[0007] Therefore, the technical problem to be solved by the present invention is to overcome the problem that the approximate member query method of the network attack blacklist in the prior art will cause the query efficiency to decrease and the false alarm rate to increase during the dynamic expansion process.
[0008] In order to solve the above technical problems, the present invention provides a method for managing a network attack blacklist by dynamic redirection, comprising:
[0009] Initialize the blacklist, including building the blacklist and blacklist feature table;
[0010] Obtain network attacks and perform target operations; the target operations include: inserting network attacks into a blacklist, querying network attacks in a blacklist, and deleting network attacks from a blacklist;
[0011] When inserting a network attack into a blacklist, if the blacklist corresponding to the network attack cannot insert a new network attack, the blacklist corresponding to the network attack is used as the original blacklist and dynamically expanded, including:
[0012] Get the number of extensions t of the original blacklist and add a new blacklist;
[0013] For each label in the original blacklist, determine whether to insert the label into the new blacklist based on the value of the label's t-th bit; if the value of the label's t-th bit is 0, keep the label in the original blacklist; if the value of the label's t-th bit is 1, move the label to the new blacklist;
[0014] After the label is moved, the number of extensions of the original blacklist is increased by 1, and the entries currently mapped to the original blacklist in the blacklist feature table are obtained; if the number of entries is greater than 1, half of the entries are pointed to the new blacklist; otherwise, a new blacklist feature table is expanded and half of the entries are assigned to point to the new blacklist.
[0015] Preferably, when the original blacklist is dynamically expanded, the label movement operation is implemented through multi-threading.
[0016] Preferably, the initialization blacklist includes:
[0017] Build multiple blacklists;
[0018] Constructing a blacklist feature table, wherein the blacklist feature table includes a plurality of entries for completing the mapping of network attacks to blacklists;
[0019] The blacklist feature table is initialized, and multiple entries in the blacklist feature table are evenly divided into the same number of copies as the number of blacklist entries, and each copy of the entry stores a blacklist number of the blacklist.
[0020] Preferably, inserting the network attack into the blacklist comprises:
[0021] Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist;
[0022] Insert the network attack into the blacklist corresponding to the real entry.
[0023] Preferably, the length of the network attack label is ,in Blacklist corresponding to the network attack The number of expansions, z is a parameter calculated based on the expected false alarm rate.
[0024] Preferably, the parameter z calculated according to the expected false alarm rate is:
[0025] ;
[0026] in, is the expected false alarm rate.
[0027] Preferably, querying the blacklist for network attacks includes:
[0028] Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist;
[0029] The network attack is searched in the blacklist corresponding to the real entry. If the label of the network attack is stored in the blacklist corresponding to the real entry, the network attack is reported to exist, otherwise, the network attack is reported to not exist.
[0030] Preferably, deleting network attacks from the blacklist includes:
[0031] Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist;
[0032] Find and delete the network attack in the blacklist corresponding to the real entry.
[0033] Preferably, the entry to which the network attack is mapped is found in the blacklist feature table according to the label of the network attack, and then the real entry is calculated according to the index of the entry and the maximum number of extensions of the blacklist, and the calculation formula is:
[0034] ;
[0035] in, is the index of the real entry, Label for network attacks, According to the label The index of the entry to which the network attack is mapped in the blacklist feature table. is the initial number of entries for each blacklist, For label Length, The maximum number of blacklist extensions.
[0036] The present invention also provides a dynamically redirected network attack blacklist management system, comprising:
[0037] An initialization module is used to initialize the blacklist, including building the blacklist and the blacklist feature table;
[0038] An operation module, used to obtain network attacks and perform target operations; the target operations include: inserting network attacks into a blacklist, querying network attacks in a blacklist, and deleting network attacks from a blacklist;
[0039] The dynamic extension module is used to insert a network attack into the blacklist. If the blacklist corresponding to the network attack cannot insert a new network attack, the blacklist corresponding to the network attack is used as the original blacklist for dynamic extension, including:
[0040] Get the number of extensions t of the original blacklist and add a new blacklist;
[0041] For each label in the original blacklist, determine whether to insert the label into the new blacklist based on the value of the label's t-th bit; if the value of the label's t-th bit is 0, keep the label in the original blacklist; if the value of the label's t-th bit is 1, move the label to the new blacklist;
[0042] After the label is moved, the number of extensions of the original blacklist is increased by 1, and the entries currently mapped to the original blacklist in the blacklist feature table are obtained; if the number of entries is greater than 1, half of the entries are pointed to the new blacklist; otherwise, a new blacklist feature table is expanded and half of the entries are assigned to point to the new blacklist.
[0043] The above technical solution of the present invention has the following beneficial effects compared with the prior art:
[0044] The method for managing a network attack blacklist with dynamic redirection described in the present invention determines whether the label of the network attack stored in the blacklist needs to be moved to a new blacklist based on the number of times the blacklist is extended, and then divides half of the entries in the blacklist feature table mapped to the extended blacklist into the new blacklist, thereby dynamically adjusting the size of the blacklist to accommodate the storage of network attack sets of different sizes, and when the blacklist is dynamically extended, it can ensure that other operations performed by the user on the blacklist are not affected. Therefore, compared with other blacklist extension methods, it will not cause the problems of decreased query efficiency and increased false alarm rate.
[0045] Furthermore, since some bits of the label are used during the expansion process, the false alarm rate increases, and the length of the network attack label stored in the present invention increases with the number of blacklist expansions, which can maintain a stable false alarm rate. In addition, after obtaining the entries mapped to the network attack in the blacklist feature table, the real entries are calculated again based on the maximum number of blacklist expansions, thereby obtaining the real blacklist corresponding to the network attack, which improves the accuracy of the network attack mapping in the blacklist and reduces the false alarm rate. BRIEF DESCRIPTION OF THE DRAWINGS
[0046] In order to make the content of the present invention more clearly understood, the present invention is further described in detail below according to specific embodiments of the present invention in conjunction with the accompanying drawings, wherein:
[0047] Figure 1 It is a flow chart of a method for managing a network attack blacklist with dynamic redirection according to the present invention;
[0048] Figure 2 It is a flowchart for initializing the blacklist;
[0049] Figure 3 It is a flowchart for inserting a cyber attack into a blacklist;
[0050] Figure 4It is a flowchart for the dynamic expansion of the blacklist;
[0051] Figure 5 It is a flowchart for searching the blacklist for network attacks;
[0052] Figure 6 It is a flowchart for removing network attacks from blacklist. DETAILED DESCRIPTION
[0053] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments so that those skilled in the art can better understand the present invention and implement it, but the embodiments are not intended to limit the present invention.
[0054] Reference Figure 1 As shown, the present invention provides a method for managing a network attack blacklist with dynamic redirection, comprising:
[0055] Initialize the blacklist, including building the blacklist and blacklist feature table;
[0056] Obtain network attacks and perform target operations; the target operations include: inserting network attacks into a blacklist, querying network attacks in a blacklist, and deleting network attacks from a blacklist;
[0057] When inserting a network attack into a blacklist, if the blacklist corresponding to the network attack can no longer insert a new network attack, the blacklist corresponding to the network attack is dynamically expanded.
[0058] Reference Figure 2 As shown, the initialization of the blacklist includes: constructing multiple blacklists and a blacklist feature table, and initializing the blacklist feature table; the blacklist feature table is used to complete the mapping of network attacks to blacklists. Specifically, it includes the following steps:
[0059] S101. Construct multiple blacklists. The number of blacklists is N , multiple blacklists form a blacklist set ; Each blacklist includes A bucket includes slots, each slot is used to store a label of a network attack.
[0060] S102. Construct a blacklist feature table , the blacklist feature table is used to complete the mapping of network attacks to blacklists, so that network attacks can complete related operations in the corresponding blacklists. In this embodiment, the blacklist feature table is an array, including M entries, each entry is used to store the blacklist number of the blacklist.
[0061] S103, initializing the blacklist feature table, including: M The items are divided evenly into N Store them in order N The blacklist number of a blacklist, that is, for each blacklist , both have common entries point to this blacklist, where .
[0062] Reference Figure 3 As shown, the steps of inserting a network attack into a blacklist include:
[0063] S201, New Network Attacks Mapped to the blacklist feature table, network attack is obtained The corresponding blacklist extension times t, this step is a false mapping. Since some bits of the label are used during the extension process, the false alarm rate increases, so this embodiment uses hash mapping to map the new network attack Mapped to a label of length z+t , where z is the expected false alarm rate The calculated parameters are calculated as follows:
[0064] ;
[0065] Therefore, the number of elements n corresponding to different label lengths is:
[0066] ;
[0067] Since n is a geometric progression with a common ratio of 2, the average false positive rate of all blacklists is Approximately equal to the expected false alarm rate , so that the false alarm rate remains at a stable level.
[0068] S202, based on network attacks Tags , find the network attack in the blacklist feature table Mapped to entry , this step is the real mapping; index The calculation formula is:
[0069] ;
[0070] in, It can be any random hash function.
[0071] Furthermore, with the dynamic expansion of the blacklist, network attacks Mapped entries It may not be the entry that it actually corresponds to, so it is necessary to calculate the network attack based on the maximum number of extensions of the blacklist. The real index , the real index The specific calculation formula is:
[0072] ;
[0073] in, is the initial number of entries for each blacklist, For label Length, The maximum number of blacklist extensions.
[0074] S203, Network Attack Insert into real entry The corresponding blacklist includes:
[0075] Two candidate buckets are found in the blacklist and , the formula is:
[0076] ;
[0077] ;
[0078] Among them, H can be any hash function with good randomness.
[0079] Inserting a network attack When and Find an empty slot in the network and store the network attack Tags If no empty slot is found, a label is randomly selected from any candidate bucket to start the eviction operation, so that the evicted label is relocated and stored in another candidate bucket, and then the network attack Tags The relocation process is performed until an empty slot is found or the number of evictions exceeds a predefined threshold.
[0080] For example, if you choose to expel The labels of the network attacks y stored in , then another candidate bucket of network attack y is It can be calculated.
[0081] Based on the above embodiment, after calculating the entries mapped by the network attack in the blacklist feature table, the real entries mapped by the network attack are calculated based on the maximum number of expansions of the blacklist, so that the blacklist corresponding to the network attack can be located more accurately, thereby improving the accuracy of mapping the network attack in the blacklist and reducing the false alarm rate.
[0082] As the number of added network attacks increases, when a new network attack is inserted, the blacklist corresponding to the network attack cannot insert new network attacks, so the blacklist needs to be dynamically expanded. Figure 4 As shown, the specific steps include:
[0083] S301. Assume that the blacklist to be extended is , add a new blacklist , get the blacklist Number of expansions .
[0084] S302. Blacklist For each label in The value of the bit selects whether to insert it into the new blacklist If the label is If the value of the bit is 0, the tag is kept in the blacklist. If the label is If the value of the bit is 1, the tag is moved to the new blacklist middle.
[0085] The operation of moving the label in this step is implemented through multi-threading, which will not cause blocking exceptions of other operations in the data structure.
[0086] S303, after the label is moved, the blacklist Number of expansions Increase by 1 and get the current mapping to the blacklist Number of entries ;if If greater than 1, entries pointing to the new blacklist ; Otherwise, expand a new blacklist feature table and assign half of the entries to point to the new blacklist .
[0087] Due to the number of blacklist extensions Increase by 1, so the subsequent addition to the blacklist and blacklist When a network attack is inserted in, the mapped label length also increases by 1.
[0088] Reference Figure 5As shown, the specific steps of querying the blacklist for network attacks include:
[0089] S401, network attacks through hash mapping Mapping to labels , according to the label Find network attacks in the blacklist signature table Mapped to entry ,index The specific calculation formula is:
[0090] ;
[0091] Among them, H can be any hash function with good randomness.
[0092] Furthermore, the real index is calculated based on the maximum number of extensions of the blacklist. , the real index The specific calculation formula is:
[0093] ;
[0094] in, is the initial number of entries for each blacklist, For the label Length, The maximum number of blacklist extensions.
[0095] S402, in the real entry Search for network attacks in the corresponding blacklist , specifically including:
[0096] In the real entry Two candidate buckets are found in the corresponding blacklist and , the formula is:
[0097] ;
[0098] ;
[0099] Among them, H can be any hash function with good randomness.
[0100] In the candidate bucket and Check if there is a slot storing a network attack Tags , if not found, report a network attack Not present; otherwise, report a network attack exist.
[0101] Reference Figure 6 As shown, the specific steps of deleting the network attack from the blacklist include:
[0102] S501, network attacks through hash mapping Mapping to labels , according to the label Find network attacks in the blacklist signature table Mapped to entry ,index The specific calculation formula is:
[0103] ;
[0104] Among them, H can be any hash function with good randomness.
[0105] Furthermore, the real index is calculated based on the maximum number of extensions of the blacklist. , the real index The specific calculation formula is:
[0106] ;
[0107] in, is the initial number of entries for each blacklist, For the label Length, The maximum number of blacklist extensions.
[0108] S502, in the real entry Find and delete network attacks from the corresponding blacklist , specifically including:
[0109] In the real entry Two candidate buckets are found in the corresponding blacklist and , the formula is:
[0110] ;
[0111] ;
[0112] Among them, H can be any hash function with good randomness.
[0113] In the candidate bucket and Find storage network attacks in Tags slot and empty it.
[0114] In summary, the dynamically redirected network attack blacklist management method described in the present invention realizes the expansion of the blacklist level based on the approximate member query method, can dynamically adjust the size of the blacklist to adapt to the storage of network attack sets of different sizes, and when adjusting the blacklist size, can ensure that other operations performed by the user on the network attack blacklist are not affected. Therefore, compared with other blacklist expansion methods, it will not cause the problems of decreased query efficiency and increased false alarm rate.
[0115] Based on the above-mentioned method for managing a network attack blacklist by dynamic redirection, this embodiment further provides a management system for a network attack blacklist by dynamic redirection, including:
[0116] An initialization module is used to initialize the blacklist, including building the blacklist and the blacklist feature table;
[0117] An operation module, used to obtain network attacks and perform target operations; the target operations include: inserting network attacks into a blacklist, querying network attacks in a blacklist, and deleting network attacks from a blacklist;
[0118] The dynamic extension module is used to insert a network attack into the blacklist. If the blacklist corresponding to the network attack cannot insert a new network attack, the blacklist corresponding to the network attack is used as the original blacklist for dynamic extension, including:
[0119] Get the number of extensions t of the original blacklist and add a new blacklist;
[0120] For each label in the original blacklist, determine whether to insert the label into the new blacklist based on the value of the label's t-th bit; if the value of the label's t-th bit is 0, keep the label in the original blacklist; if the value of the label's t-th bit is 1, move the label to the new blacklist;
[0121] After the label is moved, the number of extensions of the original blacklist is increased by 1, and the entries currently mapped to the original blacklist in the blacklist feature table are obtained; if the number of entries is greater than 1, half of the entries are pointed to the new blacklist; otherwise, a new blacklist feature table is expanded and half of the entries are assigned to point to the new blacklist.
[0122] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.
[0123] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0124] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0125] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0126] Obviously, the above embodiments are merely examples for the purpose of clear explanation and are not intended to limit the implementation methods. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the implementation methods here. The obvious changes or modifications derived therefrom are still within the scope of protection of the present invention.
Claims
1. A network attack blacklist management method with dynamic redirection, It is characterized in that include: Initialize the blacklist, including building the blacklist and blacklist feature table; Get network attacks and perform targeted operations; The target operations include: inserting a network attack into a blacklist, querying a network attack in a blacklist, and deleting a network attack in a blacklist; The inserting of network attacks into the blacklist includes: Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist; Insert the network attack into the blacklist corresponding to the real entry; The querying of the network attack in the blacklist includes: Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist; Search for network attacks in the blacklist corresponding to the real entry. If the blacklist corresponding to the real entry stores the label of the network attack, report the existence of the network attack. Otherwise, report that the network attack does not exist; Deleting the network attack from the blacklist includes: Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist; Find and delete the network attack in the blacklist corresponding to the real entry; When inserting a network attack into a blacklist, if the blacklist corresponding to the network attack cannot insert a new network attack, the blacklist corresponding to the network attack is used as the original blacklist and dynamically expanded, including: Get the number of extensions t of the original blacklist and add a new blacklist; For each label in the original blacklist, determine whether to insert the label into the new blacklist based on the value of the label's t-th bit; if the value of the label's t-th bit is 0, then the label is The label remains in the original blacklist; if the value of the label's tth bit is 1, the label is moved to the new blacklist; After the label is moved, the number of extensions of the original blacklist is increased by 1, and the entries currently mapped to the original blacklist in the blacklist feature table are obtained; if the number of entries is greater than 1, half of the entries are pointed to the new blacklist; otherwise, a new blacklist feature table is expanded and half of the entries are assigned to point to the new blacklist.
2. According to the method for managing a network attack blacklist by dynamic redirection according to claim 1, It is characterized in that When the blacklist is dynamically expanded, the label movement operation is implemented through multi-threading.
3. According to the method for managing a network attack blacklist by dynamic redirection described in claim 1, It is characterized in that The initialization blacklist includes: Build multiple blacklists; Constructing a blacklist feature table, wherein the blacklist feature table includes a plurality of entries for completing the mapping of network attacks to blacklists; The blacklist feature table is initialized, and multiple entries in the blacklist feature table are evenly divided into the same number of copies as the number of blacklist entries, and each copy of the entry stores a blacklist number of the blacklist.
4. A method for managing a network attack blacklist by dynamic redirection according to claim 1, It is characterized in that The length of the network attack label is z+t i , where t i Blacklist s corresponding to the network attack i The number of expansions, z is a parameter calculated based on the expected false alarm rate.
5. A method for managing a network attack blacklist by dynamic redirection according to claim 1, It is characterized in that The parameter z calculated based on the expected false alarm rate is: z=log(1 / fpr e ) Among them, fpr e is the expected false alarm rate.
6. A method for managing a network attack blacklist by dynamic redirection according to claim 1, It is characterized in that According to the label of the network attack, find the entry mapped to the network attack in the blacklist feature table, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist. The calculation formula is: in, is the index of the real entry, fp is the label of the network attack, index is the index of the entry mapped to the network attack in the blacklist feature table according to the label fp, l is the initial number of entries in each blacklist, f is the length of the label fp, and t max The maximum number of blacklist extensions.
7. A network attack blacklist management system with dynamic redirection, It is characterized in that include: An initialization module is used to initialize the blacklist, including building the blacklist and the blacklist feature table; Operation module, used to obtain network attacks and perform target operations; The target operations include: inserting a network attack into a blacklist, querying a network attack in a blacklist, and deleting a network attack in a blacklist; The inserting of network attacks into the blacklist includes: Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist; Insert the network attack into the blacklist corresponding to the real entry; The querying of the network attack in the blacklist includes: Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist; Search the blacklist corresponding to the real entry for the network attack. If the blacklist corresponding to the real entry stores the label of the network attack, report that the network attack exists; otherwise, report that the network attack does not exist. Deleting the network attack from the blacklist includes: Map the network attack to a label through hash mapping, find the entry mapped to the network attack in the blacklist feature table according to the label of the network attack, and then calculate the real entry according to the index of the entry and the maximum number of extensions of the blacklist; Find and delete the network attack in the blacklist corresponding to the real entry; The dynamic extension module is used for inserting a network attack into a blacklist. If the blacklist corresponding to the network attack cannot insert a new network attack, the blacklist corresponding to the network attack is used as the original blacklist for dynamic extension, including: obtaining the extension times t of the original blacklist and adding a new blacklist; For each label in the original blacklist, determine whether to insert the label into the new blacklist according to the value of the label's t-th bit; if the value of the label's t-th bit is 0, keep the label in the original blacklist; if the value of the label's t-th bit is 1, move the label to the new blacklist; the label movement operation is implemented through multi-threading; after the label is moved, the number of extensions of the original blacklist is increased by 1, and the entries currently mapped to the original blacklist in the blacklist feature table are obtained; if the number of entries is greater than 1, half of the entries are pointed to the new blacklist; otherwise, a new blacklist feature table is expanded, and half of the entries are assigned to point to the new blacklist.
