Honey spot deployment optimization method

By formulating a honey point deployment strategy based on the attacker's scanning strategy, using exponential distribution, random phase equalization and edge distribution strategies, the honey point deployment is optimized, which solves the problem of low resource utilization efficiency and improves the probability of honey point capture attacks and resource utilization efficiency.

CN119051894AActive Publication Date: 2024-11-29GUANGZHOU UNIVERSITY

Patent Information

Application Number
CN202411025217.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-29
Publication Date
2024-11-29
Estimated Expiration
2044-07-29

AI Technical Summary

Technical Problem

The existing honey point deployment plan fails to fully consider the attacker's diversified methods and strategies, resulting in honey point over-deployment in low-risk areas, low resource utilization efficiency, and the probability of capturing attacks is also reduced.

Method used

Develop honey dot deployment strategy based on the attacker's scanning strategy, deploy honey dots using exponential distribution, random phase equalization and edge distribution strategies, and optimize the number of honey dots through deduplication processing and marginal utility calculation to improve the capture probability and Resource utilization efficiency.

Benefits of technology

Effectively cover the network to be defended, improve the probability of honey point capture attacks, optimize the number of honey point deployments, improve resource utilization efficiency, and ensure the capture success rate.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119051894A_ABST
    Figure CN119051894A_ABST
Patent Text Reader

Abstract

The invention provides a honey point deployment optimization method, and relates to the technical field of network security. The honey point optimal deployment method comprises the following steps: making a honey point deployment strategy based on a scanning strategy of an attacker, deploying K initial honey points at different IP addresses of a to-be-defended network based on the deployment strategy, and obtaining the total number of effective capture times of the K initial honey points; and deleting all the initial honey points, newly adding optimized honey points in the network to be defended one by one based on the deployment strategy, and calculating the marginal utility of the newly added optimized honey points and determining the newly added number of the optimized honey points based on the number of IP addresses in the network to be defended and the number of effective capture times. According to the method, the honey point deployment strategy is formulated by researching diversified attack means, so that the attack capture rate is improved, resource waste is avoided, and the honey point marginal utility analysis method is provided to realize evaluation and optimization of the honey point deployment number.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of network security technology, and in particular to a honey spot deployment optimization method. Background Art

[0002] In the current network security field, a honeypot is a deception system that uses fake hosts, network services or information as bait to lure attackers to attack it. Traditional honeypots are mainly divided into two types: low-interaction and high-interaction. Low-interaction honeypots have limited trapping capabilities and are difficult to provide effective and comprehensive attack information. High-interaction honeypots are difficult to deploy in a wide range of business networks due to the high resource investment and deployment difficulties, and cannot effectively cover all potential attack surfaces.

[0003] A honey spot is a security tool that lures attackers. When an attacker visits a honey spot, the honey spot will issue an alarm notification. A honey spot does not need to implement all the functions of the protected host. It only needs to be similar to the protected host in terms of service type and interaction process. Compared with honeypots, this lightweight honey spot technology not only avoids excessive resource investment, but also shows a lower false alarm rate in passive detection of attacks. However, the existing honey spot technology deployment scheme does not fully consider the diverse methods and strategies of attackers. It only adopts a random deployment strategy, which may lead to excessive deployment of honey spots in some low-risk areas, making some honey spots redundant, reducing resource utilization efficiency, and the probability of capturing attacks, thereby wasting limited honey spot resources. Therefore, it is urgent to provide a solution to improve the above problems. Summary of the invention

[0004] The purpose of the present invention is to provide a honey spot deployment optimization method, which improves the problems of low attack probability and resource utilization efficiency of the honey spot random deployment method in the prior art.

[0005] The present invention provides a method for optimizing honey spot deployment, which adopts the following technical solution:

[0006] Formulate a deployment strategy for the honey spots based on the attacker's scanning strategy, and deploy K initial honey spots at different IP addresses of the network to be defended based on the deployment strategy, obtain the total number of times all the initial honey spots in the network to be defended are attacked and scanned, and obtain the number of effective captures after deduplication of scans from the same attack source;

[0007] Delete all the initial sweet spots in the network to be defended, add optimized sweet spots one by one in the network to be defended based on the deployment strategy, and calculate the marginal utility of the newly added optimized sweet spots one by one based on the number of IP addresses of deployable sweet spots in the network to be defended and the number of effective capture times, and determine the new number of optimized sweet spots based on the marginal utility.

[0008] The honey spot deployment optimization method as described above, wherein, in the process of formulating the deployment strategy of the honey spot based on the attacker's scanning strategy, the deployment strategy includes an exponential distribution strategy for range attack scanning, a random phase averaging strategy for random attack scanning, and an edge distribution strategy for address resolution protocol attack scanning.

[0009] The above-mentioned honey spot deployment optimization method, wherein, based on the random phase equalization strategy, K1 initial honey spots are respectively deployed at different IP addresses of the network to be defended, comprises:

[0010] Based on the number of all IP addresses in the network to be defended and the number of initial honey spots K1 that need to be deployed, determine that the difference in IP addresses between the K1 initial honey spots in the random phase equalization strategy is δ;

[0011] Generate the random phase d0∈(0, δ] of the first initial honey point in the random phase equalization strategy, and calculate the IP address d to be deployed of the initial honey point in the random phase equalization strategy i =d0+(i-1)×δ, i∈[1, K1];

[0012] When the ith IP address to be deployed is occupied, the ith IP address to be deployed is randomly changed to the closest IP address in the address interval of ((i-1)×δ, i×δ]; when all IP addresses in the address interval of ((i-1)×δ, i×δ] are occupied, the ith IP address to be deployed is randomly changed to the IP address of other deployable honey spots in the network to be defended;

[0013] The initial honey spots are respectively deployed on K1 IP addresses to be deployed, where K1≤K.

[0014] The above-mentioned honey spot deployment optimization method, wherein, based on the exponential distribution strategy, K2 initial honey spots are respectively deployed at different IP addresses of the network to be defended, comprises:

[0015] In the network to be defended, IP addresses that satisfy the exponential distribution and can be deployed with honey spots are randomly sampled around the IP address to be defended to obtain exponential IP addresses, K2 IP addresses to be deployed are selected based on the distance from the IP address to be defended and the minimum, and the initial honey spots are deployed on the K2 IP addresses to be deployed respectively, where K2≤K.

[0016] In the honey spot deployment optimization method as described above, a starting IP address or an ending IP address is selected as the IP address to be deployed, and an initial honey spot is deployed on the IP address to be deployed.

[0017] The honey spot deployment optimization method as described above, wherein, when deduplicating scans of the same attack source to obtain the effective capture number, includes: the initial honey spot obtains the attack source information when scanned, and deduplicating scans of the same attack source to obtain the effective capture number of the initial honey spot.

[0018] The above-mentioned method for optimizing the deployment of honey spots, wherein, in the process of adding optimized honey spots one by one, includes: determining the priority of the IP address when adding the optimized honey spot based on the number of captures of the IP address where the initial honey spot is located.

[0019] In the above-mentioned method for optimizing the deployment of honey spots, calculating the marginal utility of the newly added optimized honey spots includes:

[0020] Calculating a first probability that the attacker is not captured when attacking the network to be defended before the optimization of the honey spot addition; calculating a second probability that the attacker is not captured when attacking the network to be defended after the optimization of the honey spot addition;

[0021] Calculating the marginal utility of the newly added optimized honey spot based on the first probability and the second probability;

[0022] In the above-mentioned honey spot deployment optimization method, in the process of calculating the probability of not being captured, the calculation is performed according to the following formula:

[0023]

[0024] Where n is the number of IP addresses that can be used to deploy honey spots in the network to be defended, k is the number of newly added optimized honey spots, h is the number of effective capture times, and p k is the probability that the attack of the kth newly added optimization honey spot is not captured.

[0025] The above-mentioned method for optimizing the deployment of sweet spots, wherein the process of determining the number of newly added sweet spots for optimization includes: when the marginal utility is less than a preset threshold, stopping adding the sweet spots for optimization.

[0026] The beneficial effects of the honey spot deployment optimization method proposed in the present invention are:

[0027] 1. The honey spot deployment strategy of the present invention adopts exponential distribution, random phase uniform distribution, and edge distribution, which can make the honey spots cover the network to be defended more comprehensively, effectively utilize the attacker's scanning strategy, and improve the probability of capturing the attack.

[0028] 2. The marginal utility of the honey spots of the present invention calculates the change in the probability of attacking and not being captured before and after each honey spot is added, which can effectively evaluate and optimize the number of honey spot deployments, while ensuring the capture success rate and improving resource utilization efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 A flow chart of a honey spot deployment optimization solution provided by an embodiment of the present invention;

[0030] Figure 2 A structural diagram of a honey spot deployment strategy provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0031] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention. Unless otherwise defined, the technical terms or scientific terms used herein should be understood by people with general skills in the field to which the present invention belongs. "Including" and similar words used in this article mean that the elements or objects appearing before the word include the elements or objects listed after the word and their equivalents, without excluding other elements or objects.

[0032] An embodiment of the present invention provides a method for optimizing honey spot deployment, including:

[0033] S1. Formulate a deployment strategy for the honey points based on the attacker's scanning strategy, and deploy K initial honey points at different IP addresses of the network to be defended based on the deployment strategy;

[0034] S2, obtaining the total number of times all the initial honey spots in the network to be defended are attacked and scanned, and obtaining the number of valid captures after deduplication of scans from the same attack source;

[0035] S3. Delete all the initial sweet spots in the network to be defended, add optimized sweet spots one by one in the network to be defended based on the deployment strategy, and calculate the marginal utility of the newly added optimized sweet spots one by one based on the number of IP addresses of deployable sweet spots in the network to be defended and the number of effective capture times, and determine the new number of optimized sweet spots based on the marginal utility.

[0036] In some embodiments, see Figure 1 ,After collecting the attacker's scanning strategy, a deployment strategy for the honey spot is formulated based on the attacker's scanning strategy. After deploying the initial honey spot based on the deployment strategy, the effective capture times are obtained; the initial honey spot is deleted, the marginal utility of the optimized honey spot is added and calculated, and the number of newly added optimized honey spots is determined.

[0037] In some embodiments, the process of executing step S1 includes:

[0038] Step S1.1, formulate a deployment strategy of the honey spot based on the attacker's scanning strategy;

[0039] Step S1.2: Based on the deployment strategy, K initial honey spots are deployed at different IP addresses of the network to be defended.

[0040] For details, see Figure 2 , when executing step S1.1, formulating a deployment strategy of a honey spot based on the attacker's scanning strategy, including:

[0041] Collect the attacker's scanning strategies based on the literature. The obtained scanning strategies include random scanning, range scanning, address resolution protocol scanning, brute force scanning, etc.

[0042] The deployment strategies for honey spots include the random phase equalization strategy for random attack scanning, the exponential distribution strategy for range attack scanning, and the edge distribution strategy for address resolution protocol attack scanning.

[0043] Specifically, when executing step S1.2, based on the deployment strategy, the K initial honey spots are respectively deployed at different IP addresses of the network to be defended, including:

[0044] Step S1.2.1, deploy K1 initial honey spots at different IP addresses of the network to be defended based on the random phase equi-division strategy;

[0045] Step S1.2.2, deploy K2 initial honey spots at different IP addresses of the network to be defended based on the exponential distribution strategy;

[0046] Step S1.2.3: Based on the edge distribution strategy, deploy an initial honeypot at different IP addresses of the network to be defended.

[0047] Specifically, executing step S1.2.1, when K1 initial honey spots are deployed at different IP addresses of the network to be defended based on the random phase equalization strategy, includes:

[0048] Based on the number of all IP addresses in the network to be defended and the number K1 of the initial honey spots to be deployed, determining that the difference in IP addresses between the K1 initial honey spots in the random phase equalization strategy is 6;

[0049] Generate the random phase d0∈(0, δ] of the first initial honey point in the random phase equalization strategy, and calculate the IP address d to be deployed of the initial honey point in the random phase equalization strategy i =d0+(i-1)×δ, i∈[1, K1].

[0050] Furthermore, when the i-th IP address to be deployed is occupied, the i-th IP address to be deployed is randomly changed to the closest IP address in the address interval of ((i-1)×δ, i×δ]; when all IP addresses in the address interval of ((i-1)×δ, i×δ] are occupied, the i-th IP address to be deployed is randomly changed to the IP address of other deployable honey spots in the network to be defended.

[0051] Further, the initial honey spots are respectively deployed on K1 IP addresses to be deployed, where K1≤K.

[0052] Specifically, executing step S1.2.2, when K2 initial honey spots are deployed at different IP addresses of the network to be defended based on the exponential distribution strategy, includes:

[0053] In the network to be defended, IP addresses that satisfy the exponential distribution and can deploy honey spots around the IP address to be defended are randomly sampled to obtain exponential IP addresses, and K2 IP addresses to be deployed in the exponential distribution strategy are selected based on the distance from the IP address to be defended and the minimum.

[0054] Furthermore, the initial honey spots are deployed on the K2 IP addresses to be deployed respectively, where K2≤K.

[0055] Specifically, executing step S1.2.3, when deploying an initial honey point at different IP addresses of the network to be defended based on the edge distribution strategy, includes:

[0056] Select the start IP address or the end IP address as the IP address to be deployed, and deploy the initial honey spot on the IP address to be deployed.

[0057] In fact, after compromising a host, the attacker will obtain information about active hosts on the network by querying the ARP cache of the target network, and determine whether the attacker uses the ARP scanning attack method by checking whether the honey spot deployed in step S1.2.3 captures the attack.

[0058] In fact, the network to be defended may be divided into multiple network segments, each of which contains a continuous IP address. Perhaps only some of the network segments in the network to be defended need to deploy honey spots for defense.

[0059] In some embodiments, when executing step S2, it includes:

[0060] The initial honey spot obtains the attack source information when it is scanned, and deduplicates the attack scans of the same attack source to obtain the effective capture times of the initial honey spot.

[0061] In fact, when an attacker interacts with a honey spot, relevant information that can be collected includes the IP address of the attack source, attack tools and techniques, the time and frequency of the attack, the attacker's operational behavior, etc.

[0062] In some embodiments, the process of executing step S3 includes:

[0063] Step S3.1, deleting all the initial honey spots in the network to be defended;

[0064] Step S3.2, adding optimized honey spots one by one in the network to be defended based on the deployment strategy, and calculating the marginal utility of the newly added optimized honey spots one by one based on the number of IP addresses where honey spots can be deployed in the network to be defended and the number of effective capture times;

[0065] Step S3.3: Determine the number of new optimized honey spots based on the marginal utility.

[0066] Specifically, the process of executing step S3.2 includes:

[0067] Step S3.2.1, adding optimized honey points one by one in the network to be defended based on the deployment strategy;

[0068] Step S3.2.2, calculating the marginal utility of the newly added optimized honey spots one by one.

[0069] Specifically, when executing step S3.2.1, adding optimized honey points one by one in the network to be defended based on the deployment strategy includes:

[0070] In addition to the newly added optimization honey spots that must be deployed for the starting IP address or the ending IP address, the priority of the IP address when adding the optimization honey spots is determined based on the capture times of the IP address where the initial honey spot is located.

[0071] Specifically, when executing step S3.2.2, the marginal utility of the newly added optimization honey spots is calculated one by one, including:

[0072] A first probability that an attacker is not captured when attacking the network to be defended before the optimization honey spot is added is calculated; a second probability that an attacker is not captured when attacking the network to be defended after the optimization honey spot is added is calculated; and based on the difference between the first probability and the second probability, the marginal utility of the newly added optimization honey spot is obtained.

[0073] Specifically, in the process of calculating the probability of an attack not being caught, the calculation formula is:

[0074]

[0075] Where n is the number of IP addresses that can be used to deploy honey spots in the network to be defended, k is the number of newly added optimized honey spots, h is the number of effective capture times, and p is the number of newly added optimized honey spots. k is the probability that the attack of the kth newly added optimization honey spot is not captured.

[0076] Specifically, the process of executing step S3.3 includes: when the marginal utility of the newly added optimization honey spot is less than a preset threshold, stopping adding the optimization honey spot.

[0077] In practice, the preset threshold may be 0.1.

Claims

1. A honey spot deployment optimization method, It is characterized in that The following steps are involved: Formulate a deployment strategy for the honey spots based on the attacker's scanning strategy, and deploy K initial honey spots at different IP addresses of the network to be defended based on the deployment strategy, obtain the total number of times all the initial honey spots in the network to be defended are attacked and scanned, and obtain the number of effective captures after deduplication of scans from the same attack source; Delete all the initial sweet spots in the network to be defended, add optimized sweet spots one by one in the network to be defended based on the deployment strategy, and calculate the marginal utility of the newly added optimized sweet spots one by one based on the number of IP addresses of deployable sweet spots in the network to be defended and the number of effective capture times, and determine the new number of optimized sweet spots based on the marginal utility.

2. A method for optimizing honey spot deployment according to claim 1, It is characterized in that In the process of formulating the deployment strategy of the honey point based on the attacker's scanning strategy, the deployment strategy includes a random phase equalization strategy for random attack scanning, an exponential distribution strategy for range attack scanning, and an edge distribution strategy for address resolution protocol attack scanning.

3. A method for optimizing honey spot deployment according to claim 2, It is characterized in that Based on the random phase equipartition strategy, K 1 When the initial honey points are deployed at different IP addresses of the network to be defended, it includes: Based on the number of all IP addresses in the network to be defended and the number of initial honey spots K that need to be deployed 1 , determine the K in the random phase equalization strategy 1 The difference between the IP addresses of the initial honey spots is 6; Generate the random phase d of the first initial honey point in the random phase equalization strategy 0 ∈(0, δ], calculate the IP address d to be deployed of the initial honey point in the random phase equalization strategy i =d 0 +(i-1)×δ,i∈[1,K 1 ]; When the ith IP address to be deployed is occupied, the ith IP address to be deployed is randomly changed to the closest IP address in the address interval of ((i-1)×δ, i×δ]; when all IP addresses in the address interval of ((i-1)×δ, i×δ] are occupied, the ith IP address to be deployed is randomly changed to the IP address of other deployable honey spots in the network to be defended; K 1 The initial honey spots are respectively deployed on the IP addresses to be deployed, where K 1 ≤K.

4. A method for optimizing honey spot deployment according to claim 2, It is characterized in that Based on the exponential distribution strategy, K 2 When the initial honey points are deployed at different IP addresses of the network to be defended, it includes: In the network to be defended, IP addresses that meet the exponential distribution and can deploy honey spots around the IP address to be defended are randomly sampled to obtain exponential IP addresses, and K in the exponential distribution strategy is selected based on the distance from the IP address to be defended and the minimum 2 IP addresses to be deployed, and in the K 2 The initial honey points are deployed on the IP addresses to be deployed, where K 2 ≤K.

5. A method for optimizing honey spot deployment according to any one of claims 3 to 4, It is characterized in that Select the starting IP address or the ending IP address as the IP address to be deployed, and deploy the initial honey spot on the IP address to be deployed.

6. A method for optimizing honey spot deployment according to claim 1, It is characterized in that When deduplicating scans of the same attack source to obtain the effective capture times, it includes: the initial honey spot obtains the attack source information when scanned, and deduplicating the attack scans of the same attack source to obtain the effective capture times of the initial honey spot.

7. A method for optimizing honey spot deployment according to claim 1, It is characterized in that In the process of adding optimized honey spots one by one, the priority of the IP address when adding the optimized honey spots is determined based on the number of captures of the IP address where the initial honey spot is located.

8. A method for optimizing honey spot deployment according to claim 1, It is characterized in that Calculate the marginal utility of the newly added optimization honey spot, including: Calculating a first probability that the attacker is not captured when attacking the network to be defended before the optimization of the honey spot addition; Calculating a second probability that the attacker is not captured when attacking the network to be defended after the optimization of the honeypoint addition; Based on the first probability and the second probability, the marginal utility of the newly added optimization sweet spot is calculated.

9. A method for optimizing honey spot deployment according to claim 8, It is characterized in that When calculating the probability of an attack not being caught, the following formula is used for calculation: Where n is the number of IP addresses that can be used to deploy honey spots in the network to be defended, k is the number of newly added optimized honey spots, h is the number of effective capture times, and p k is the probability that the attack of the kth newly added optimization honey spot is not captured.

10. A method for optimizing honey spot deployment according to claim 1, It is characterized in that In the process of determining the newly added number of the optimization sweet spots, when the marginal utility is less than a preset threshold, the optimization sweet spots are stopped from being added.

Citation Information

Patent Citations

  • Network defense method and device

    CN115694976A

  • Safety exploration reinforcement learning method based on honeypot and pseudo honeypot deployment

    CN117459289A

  • Adaptive honey point deployment method based on attack graph

    CN118101332A

  • Live deployment of deception systems

    US10986129B1

  • Lifelong learning based intelligent, diverse, agile, and robust system for network attack detection

    US20210243226A1

Cited By

  • Honeypot IP dynamic configuration method based on model predictive control

    CN119383021A

  • Attacker capturing method based on vulnerability counterfeiting

    CN120498823A

  • A method for detecting attackers based on vulnerability forgery

    CN120498823B

  • Honey spot deployment optimization method and device, electronic equipment and storage medium

    CN120639507A