A network security data transmission method based on privacy protection
By employing personalized privacy protection, quantum particle swarm optimization, and distributed key management, the balance between privacy protection and transmission efficiency in network security data transmission is resolved, thereby enhancing the security and reliability of data transmission and forming a comprehensive network security protection system.
Patent Information
- Application Number
- CN202610514264.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-04-17
- Publication Date
- 2026-06-30
AI Technical Summary
Existing network security data transmission technologies are ill-suited to the personalized privacy needs of different nodes. Transmission scheduling algorithms are prone to getting stuck in local optima, centralized key management has the risk of single point of failure, and there is a lack of end-to-end collaborative protection. This leads to an imbalance between privacy protection and data availability, increased transmission latency and energy consumption, and makes it difficult to meet the network security needs of all scenarios.
A personalized differential privacy protection mechanism combining attribute correlation learning is adopted, and data is processed by dynamically allocating privacy budget and Laplace noise; a multi-node transmission scheduling model is established and the quantum particle swarm optimization algorithm is used for scheduling; a distributed key management system is constructed and verified by using a tree structure and key priority allocation.
This approach achieves the optimization of transmission efficiency and energy consumption while ensuring data privacy, improves the credibility and anti-attack capabilities of data interaction, and forms a comprehensive network security protection system.
Smart Images

Figure CN122316759A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of data transmission technology, and in particular to a privacy-preserving network security data transmission method. Background Technology
[0002] With the rapid development of internet technology and the widespread adoption of digital applications, network data transmission has become the core carrier of information exchange, covering various scenarios such as government offices, enterprise operations, civilian communications, and the Internet of Vehicles. During the transmission of data across nodes and networks, security risks such as data leakage, tampering, and illegal theft are becoming increasingly prominent. Privacy protection has become a core requirement for secure data transmission. How to ensure efficient data transmission while accurately protecting sensitive user information and critical business data to prevent privacy leaks and misuse has become a critical issue that urgently needs to be addressed in the current cybersecurity field.
[0003] Existing network security data transmission technologies still have many limitations: First, privacy protection mechanisms mostly use fixed-strength encryption or simple noise perturbation, which are difficult to adapt to the personalized privacy needs of different nodes and are prone to imbalance between privacy protection and data availability. Second, transmission scheduling algorithms in complex multi-node networks are prone to getting stuck in local optima and cannot coordinately optimize transmission latency and energy consumption. The design philosophy of prioritizing security over efficiency further exacerbates transmission delay and device energy consumption. Third, data trusted verification relies on a centralized key management architecture, which has the risk of single point of failure, low efficiency in cross-network authentication, and is difficult to resist malicious attacks such as data tampering and double consumption. Moreover, it lacks a whole-process collaborative protection system of "privacy protection-transmission efficiency-trusted verification", which cannot meet the comprehensive needs of network security data transmission in all scenarios. Summary of the Invention
[0004] The present invention aims to provide a privacy-preserving network security data transmission method to solve the problems mentioned in the background art.
[0005] To achieve the above objectives, the present invention provides the following technical solution: A privacy-preserving network security data transmission method includes the following steps: S1. Data privacy preprocessing: For the sensitive attributes of network transmission data, a personalized differential privacy protection mechanism combining attribute correlation learning is constructed. By dynamically allocating the privacy budget and introducing Laplace noise, the original data is locally privatized to balance data privacy protection and usability. S2. Intelligent scheduling of transmission tasks: For scenarios with multiple network nodes and multiple transmission links, a scheduling model with transmission latency and energy consumption as optimization objectives is established, and a quantum particle swarm optimization algorithm with chaotic perturbation is used to solve the model to obtain the optimal transmission task scheduling strategy. S3. Trusted verification of transmitted data: Based on a pre-designed distributed key management scheme, the network is divided into several sub-regions and a tree-like key management structure is constructed. Through key priority allocation and cross-region node verification mechanism, trusted interaction and anti-attack protection of transmitted data are achieved.
[0006] Preferably, step S1 includes the following specific processing procedures: The Markov chain Monte Carlo algorithm is used to learn the attribute correlation of transmitted data and establish an attribute correlation model. By using the arithmetic progression decision tree privacy budget allocation method, privacy parameters are dynamically adjusted according to the individual privacy needs of network nodes. Data is privatized based on the Laplace noise perturbation mechanism, and the noise intensity is inversely proportional to the privacy budget. Design a data recovery strategy and extract the optimal recovery result by statistically analyzing the frequency distribution of private data.
[0007] Preferably, the privacy budget is expressed by a formula. Calculation, where For the first Personalized privacy budgets for each network node This represents the current decision tree height of the node. For the overall privacy budget, The total number of levels in the decision tree. The number of decision trees to be constructed; Privatization strategy through formula Sure, This represents the amount of data transmitted by this node.
[0008] Preferably, the differential privacy protection mechanism supports both continuous and discrete sensitive attributes, and converts attribute values into fixed-length binary strings through a hash function to achieve compatibility between attribute unique identification and privacy protection.
[0009] Preferably, step S2 includes the following specific processing procedures: A multi-network node-multi-transmission link scheduling model is established, with transmission delay and energy consumption as optimization objectives, and an adaptive function is constructed. The quantum particle swarm optimization algorithm is used for scheduling search, and the Logistic chaotic mapping equation is introduced to perform chaotic perturbation to avoid the algorithm getting trapped in local extrema. Design exchange and mutation operators for a fast elite non-dominated sorting genetic algorithm based on the crowding coefficient to increase particle swarm diversity and optimize scheduling decisions.
[0010] Preferably, the adaptive function is , in The total number of transmission tasks, For the first The fitness value for each transmission task is specifically: , in For the first The total latency of each transmission task Total energy consumption, The weighting parameter is used to adjust the latency and energy consumption, and satisfies the following conditions: .
[0011] Preferably, the Logistic chaotic mapping equation is: ,in The formula for the chaotic perturbation strategy is: , in This represents the position of the perturbed particle. For the first The best historical position of a particle To optimize parameters, and These represent the farthest and shortest communication distances between the transmission nodes, respectively.
[0012] Preferably, step S3 includes the following specific processing procedures: Construct a distributed key management system model based on blockchain oracles, dividing the network into several sub-networks to form a tree-structured acyclic graph; Design a key priority allocation strategy, determine the key priority by calculating the distance between the network node and the key distribution node, and select high-priority keys for pre-distribution; In the sub-network, nodes collaboratively maintain the blockchain oracle, and key data is uploaded level by level to the root node of the tree structure. When transmitting data across sub-networks, nodes authenticate themselves using key data from local or upper-layer oracles to protect against malicious attacks.
[0013] Preferably, the distance between the network node and the key distribution node is determined by the formula... calculate, For network node coordinates, Coordinates of the key distribution node; The cost optimization objective for key management is: , in The total cost of key management, For key transformation cost, Key allocation cost, For key storage costs, , , The corresponding cost control parameters, and satisfy the following conditions: .
[0014] Preferably, the method is applicable to various network environments such as enterprise networks, government networks, civilian internet, and vehicle networks, supports seamless data transmission between fixed terminals and mobile terminals, and is compatible with wired and wireless communication links.
[0015] The beneficial effects of this technical solution compared to existing technologies are as follows: (1) This invention constructs an end-to-end network security protection system covering the entire data lifecycle through a three-step collaborative mechanism: data privacy preprocessing, intelligent scheduling of transmission tasks, and trusted verification of transmitted data. At the data source level, personalized differential privacy protection combining attribute correlation learning is adopted. Through dynamic privacy budget allocation and Laplace noise perturbation, differentiated privacy protection for different nodes and different sensitive attributes is achieved, which not only prevents the leakage of sensitive information but also ensures the usability of data analysis. At the transmission process level, a scheduling model with latency and energy consumption as optimization objectives is established for multi-node and multi-link scenarios. The quantum particle swarm optimization algorithm with chaotic perturbation is used to solve the problem, which effectively avoids the problem of traditional algorithms being prone to getting trapped in local optima and achieves coordinated optimization of transmission efficiency and energy consumption. At the data verification level, the network is divided into sub-regions and a tree-like key structure is constructed based on a distributed key management scheme. Through key priority allocation and cross-region node verification mechanism, the risk of single point of failure in centralized architecture is eliminated, ensuring the trustworthiness and anti-attack capability of data interaction. The three steps are closely linked and work together to form a complete closed loop from source protection to trusted evidence storage, which improves the level of network security protection in all scenarios. Attached Figure Description
[0016] Figure 1 A flowchart illustrating a privacy-preserving network security data transmission method provided by this invention; Detailed Implementation
[0017] The present invention will now be described in further detail with reference to the accompanying drawings and embodiments: This invention provides a privacy-preserving network security data transmission method applicable to systems containing multiple network nodes (such as servers and terminal devices), edge computing nodes, and blockchain networks. The method comprises three core stages: data privacy preprocessing S1, intelligent scheduling of transmission tasks S2, and trusted verification of transmitted data S3.
[0018] S1 Data Privacy Preprocessing The goal of this phase is to perform privacy protection processing on the raw data locally at the data source node, while also ensuring data availability.
[0019] A Markov Chain Monte Carlo (MCMC) algorithm is employed to learn the attribute correlations of transmitted data and establish an attribute correlation model. Specifically, for network traffic datasets containing multi-dimensional attributes such as source IP, destination IP, timestamp, and packet size, the MCMC method iteratively estimates the joint probability distribution between attributes, thereby capturing the inherent correlations between attributes. This step helps preserve the statistical characteristics of the data in subsequent privacy-preserving processing, improving the accuracy of data recovery.
[0020] Based on the individual privacy needs of network nodes, privacy parameters are dynamically adjusted using an arithmetic decision tree privacy budget allocation method. Each node constructs... There are 10 decision trees, and the total number of levels in each decision tree is 10. For the first There are nodes, and their current height in the decision tree is [height]. Then its personalized privacy budget Calculate according to the formula: ,in, The overall privacy budget preset for the system, A smaller value indicates a higher level of privacy protection. This arithmetic progression method enables differentiated privacy protection across different data levels, meeting the personalized needs of nodes for data with varying degrees of sensitivity.
[0021] Personalized privacy budget based on calculations Generate privatization strategy As shown in the formula: ,in, This represents the amount of data transmitted in the current batch for this node. Privatization strategy. This represents the probability of retaining the original data value during data perturbation. This strategy is achieved by adding random noise following a Laplace distribution to the original data; the scale parameter of the noise is related to the privacy budget. Inversely proportional, that is, the smaller the privacy budget, the greater the noise added, and the stronger the privacy protection effect.
[0022] In practice, the aforementioned privacy protection mechanisms are supported for both continuous sensitive attributes (such as latency and bandwidth) and discrete sensitive attributes (such as protocol type and flag bits). For discrete attributes, a hash function can be used to map the attribute value to a fixed-length binary string to achieve compatibility between the unique identifier of the attribute and privacy protection.
[0023] A data recovery strategy is designed. After receiving a large amount of private data, the edge computing node statistically analyzes the frequency distribution of the private data at each location and selects the value with the highest frequency as the recovery result for that location, thus obtaining a perception result set that approximates the original data distribution. This recovery process does not require access to any node's original data, ensuring user privacy.
[0024] S2 intelligent scheduling of transmission tasks The goal of this phase is to optimize the scheduling decisions of transmission tasks in scenarios with multiple network nodes and multiple transmission links, so as to minimize overall transmission latency and energy consumption.
[0025] First, a multi-network node-multi-transmission link scheduling model is established. Assume there are p transmission tasks in the system, each task can be processed on a local node or offloaded to different edge computing nodes. The model optimizes transmission latency and energy consumption, and the adaptive function formula is as follows: ,in, For the first The fitness value of each transmission task is specifically given by the formula. Given, among which, For the first The total latency of each transmission task Total energy consumption, The parameters are used to adjust the weights of latency and energy consumption. By mapping latency and energy consumption to the [0,1] interval using the arctangent function, the difference in dimensions is eliminated, which facilitates multi-objective optimization.
[0026] The quantum particle swarm optimization algorithm is used to solve the above model. The algorithm initializes a swarm of particles, with each particle representing a possible scheduling scheme (i.e., the processing position of each task). The particle position update formula is based on the delta potential well model in quantum mechanics, and the formula is: ,in, For the first The particle in the first The position of the next iteration. This represents the optimal position in the history of an individual particle. To be the globally optimal position It is a random number. The coefficient of expansion / contraction is denoted by .
[0027] To prevent the algorithm from getting trapped in local optima, a Logistic chaotic mapping is introduced for perturbation. The Logistic mapping equation is as follows: , , .
[0028] When the particle swarm tends to converge, chaotic variables are utilized. The perturbation is applied to the particle's position, as shown in the formula: ,in, The new position after the disturbance. To optimize parameters, and These represent the farthest and shortest distances that the transmitting nodes can communicate with, respectively. By mapping the ergodicity of chaotic variables to the actual search space, the algorithm's ability to escape local optima is enhanced.
[0029] Meanwhile, to increase the diversity of the particle swarm, exchange and mutation operators are introduced into a fast elite non-dominated sorting genetic algorithm based on the crowding coefficient. In each iteration, the population is sorted according to the fitness and non-dominated relationship of the particles, with priority given to retaining solutions with larger crowding coefficients. New particles are generated through adaptive exchange and mutation operations, thereby maintaining the diversity of the population and improving the global search performance.
[0030] Through the above optimization algorithm, the optimal scheduling strategy that minimizes the fitness function is finally obtained, that is, which node each transmission task should be assigned to for processing, thereby minimizing the overall latency and energy consumption.
[0031] S3 Transmission Data Trust Verification The goal of this phase is to ensure that the processed data is trustworthy when transmitted to the blockchain network and can withstand common cyberattacks.
[0032] First, a distributed key management system model based on a blockchain oracle is constructed. The entire network is divided into several subnetworks, forming a tree-like acyclic graph. Each subnetwork serves as an independent key management domain, and all nodes within a subnetwork collaboratively maintain a blockchain oracle. In the tree structure, key data from lower-level subnetworks are uploaded to upper-level nodes level by level after consensus, ultimately converging at the root node to form a global key store.
[0033] During the key pre-distribution phase, a key priority allocation strategy is designed. The system pre-generates keys in a key container. A set of random keys are generated, and a virtual coordinate is assigned to each key. After network nodes are deployed, they obtain their own coordinates. and according to the formula Calculate the distance to each key. The smaller the distance, the closer the key is to the node geographically, and the higher its priority. Sort the keys by distance from smallest to largest and select the one with the highest priority. One key is stored in the local key ring, and the remaining keys are discarded. The preset number of keys to store for each node, and This distance-based priority selection strategy can increase the probability that neighboring nodes share the same key, thereby enhancing network connectivity.
[0034] When a node needs to transmit data across subnetworks, authentication is performed first. The node signs the data using its locally stored communication private key and sends its communication public key and digital signature to the target subnetwork. Nodes in the target subnetwork obtain the target node's public key through their local oracle or by querying an upper-layer oracle, and verify the validity of the signature. Simultaneously, they check historical transaction data on the blockchain to confirm whether the node has any malicious activity records. If verification passes, the node is allowed to access and communicate securely; if verification fails, the node is required to regenerate its key pair and reapply for access.
[0035] The total cost of key management includes key transformation costs. Key distribution cost and key storage costs To reduce system overhead, the sub-network partitioning needs to be optimized to minimize the total key management cost, as shown in the formula: ,in, These are cost control parameters that can be adjusted based on the actual network environment. By dynamically dividing the network into sub-networks and optimizing the key distribution strategy, computational, communication, and storage overhead can be effectively reduced.
[0036] The above descriptions are merely embodiments of the present invention, and common knowledge such as specific technical solutions and / or characteristics are not described in detail here. It should be noted that those skilled in the art can make various modifications and improvements without departing from the technical solutions of the present invention, and these should also be considered within the scope of protection of the present invention. These modifications and improvements will not affect the effectiveness of the implementation of the present invention or the practicality of the patent. The scope of protection claimed in this application should be determined by the content of its claims, and the specific embodiments described in the specification can be used to interpret the content of the claims.
Claims
1. A privacy-preserving network security data transmission method, characterized in that, Includes the following steps: S1. Data privacy preprocessing: For the sensitive attributes of network transmission data, a personalized differential privacy protection mechanism combining attribute correlation learning is constructed. By dynamically allocating the privacy budget and introducing Laplace noise, the original data is locally privatized to balance data privacy protection and usability. S2. Intelligent scheduling of transmission tasks: For scenarios with multiple network nodes and multiple transmission links, a scheduling model with transmission latency and energy consumption as optimization objectives is established, and a quantum particle swarm optimization algorithm with chaotic perturbation is used to solve the model to obtain the optimal transmission task scheduling strategy. S3. Trusted verification of transmitted data: Based on a pre-designed distributed key management scheme, the network is divided into several sub-regions and a tree-like key management structure is constructed. Through key priority allocation and cross-region node verification mechanism, trusted interaction and anti-attack protection of transmitted data are achieved.
2. The privacy-protected network security data transmission method as described in claim 1, characterized in that: Step S1 includes the following specific processing procedures: The Markov chain Monte Carlo algorithm is used to learn the attribute correlation of transmitted data and establish an attribute correlation model. By using the arithmetic progression decision tree privacy budget allocation method, privacy parameters are dynamically adjusted according to the individual privacy needs of network nodes. Data is privatized based on the Laplace noise perturbation mechanism, and the noise intensity is inversely proportional to the privacy budget. Design a data recovery strategy and extract the optimal recovery result by statistically analyzing the frequency distribution of private data.
3. The privacy-protected network security data transmission method as described in claim 2, characterized in that: The privacy budget is expressed by the formula Calculation, where For the first Personalized privacy budgets for each network node This represents the current decision tree height of the node. For the overall privacy budget, The total number of levels in the decision tree. The number of decision trees to be constructed; Privatization strategy through formula Sure, This represents the amount of data transmitted by this node.
4. The privacy-protected network security data transmission method as described in claim 2, characterized in that: The differential privacy protection mechanism supports both continuous and discrete sensitive attributes. It converts attribute values into fixed-length binary strings using a hash function, achieving compatibility between unique attribute identification and privacy protection.
5. A privacy-preserving network security data transmission method as described in claim 1, characterized in that: Step S2 includes the following specific processing procedures: A multi-network node-multi-transmission link scheduling model is established, with transmission delay and energy consumption as optimization objectives, and an adaptive function is constructed. The quantum particle swarm optimization algorithm is used for scheduling search, and the Logistic chaotic mapping equation is introduced to perform chaotic perturbation to avoid the algorithm getting trapped in local extrema. Design exchange and mutation operators for a fast elite non-dominated sorting genetic algorithm based on the crowding coefficient to increase particle swarm diversity and optimize scheduling decisions.
6. The privacy-protected network security data transmission method as described in claim 5, characterized in that: The fitness function is: , in The total number of transmission tasks, For the first The fitness value for each transmission task is specifically: , in For the first The total latency of each transmission task Total energy consumption, The weighting parameter is used to adjust the latency and energy consumption, and satisfies the following conditions: .
7. A privacy-preserving network security data transmission method as described in claim 5, characterized in that: The Logistic chaotic mapping equation is: ,in ; The formula for the chaotic perturbation strategy is: , in This represents the position of the perturbed particle. For the first The best historical position of a particle To optimize parameters, and These represent the farthest and shortest communication distances between the transmission nodes, respectively.
8. A privacy-preserving network security data transmission method as described in claim 1, characterized in that: Step S3 includes the following specific processing procedures: Construct a distributed key management system model based on blockchain oracles, dividing the network into several sub-networks to form a tree-structured acyclic graph; Design a key priority allocation strategy, determine the key priority by calculating the distance between the network node and the key distribution node, and select high-priority keys for pre-distribution; In the sub-network, nodes collaboratively maintain the blockchain oracle, and key data is uploaded level by level to the root node of the tree structure. When transmitting data across sub-networks, nodes authenticate themselves using key data from local or upper-layer oracles to protect against malicious attacks.
9. A privacy-preserving network security data transmission method as described in claim 8, characterized in that: The distance between the network node and the key distribution node is expressed by the formula... calculate, For network node coordinates, Coordinates of the key distribution node; The cost optimization objective for key management is: , in Total cost of key management For key transformation cost, Key allocation cost, For key storage costs, , , The corresponding cost control parameters, and satisfy the following conditions: .
10. A privacy-preserving network security data transmission method as described in any one of claims 1-9, characterized in that: The method is applicable to various network environments such as enterprise networks, government networks, civilian internet, and vehicle networks, supports seamless data transmission between fixed and mobile terminals, and is compatible with wired and wireless communication links.
