Network data security encryption transmission method and system

Abstract

The invention relates to the field of network security, in particular to a network data security encryption transmission method and system, a sending end responds to an encryption transmission instruction, divides and encodes original data into a plurality of data fragments, and sends the fragments to a plurality of pre-selected intermediate nodes for storage; and the transmission destination address of the data fragment is the intermediate node instead of the receiving end. And after transmission configuration information is sent to a receiving end, when a trigger request sent by the receiving end is received, indicating each intermediate node storing the corresponding data fragment to simultaneously send the stored data fragment to the receiving end in a preset time window. After the receiving end receives the data fragments in the preset time window, original data are restored according to the corresponding decoding mode, the recombination result is returned to the sending end, and the sending end completes the encryption transmission according to the recombination result. The data is dispersed and stored in the intermediate node and is synchronously recovered after being triggered, so that the risk that the data is continuously transmitted on a single link and is easily intercepted and captured integrally is reduced.

Description

Technical Field

[0001] This application relates to the field of network security technology, and in particular to a method and system for secure encrypted transmission of network data. Background Technology

[0002] Data security during network transmission is receiving increasing attention. Existing secure data transmission methods typically employ end-to-end encrypted communication. The sending end encrypts the original data and transmits the ciphertext directly to the receiving end via a single communication link. The receiving end then decrypts and restores the data upon receiving the complete message. This end-to-end encryption method carries the risk of centralized data exposure. In traditional transmission models, a complete encrypted data stream is continuously transmitted from the sending end to the receiving end via a single communication link. An attacker who can access this link and continuously monitor it has the opportunity to capture the entire encrypted data stream. Although the data itself is encrypted, with the continuous improvement of computing power and the evolution of cryptanalysis methods, even if the encrypted data is completely intercepted, it still faces the risk of being cracked. Furthermore, continuous data streams have relatively stable traffic characteristics. Attackers may use traffic analysis techniques to identify the transmission behavior of high-value data without decryption, and then launch targeted attacks.

[0003] Secondly, in real-world network environments, attackers may not only eavesdrop on transmission links but also continuously monitor the traffic of potential data receivers. When a receiver receives data within a specific time window, the listening status of its network ports and the characteristics of the arriving data traffic can be captured by attackers. For example, by monitoring the communication behavior of a target IP over a long period, attackers may discover regular patterns such as open ports and sudden bursts of data packets at specific times, thus identifying that IP as a recipient of valuable data. Even if the data during transmission is protected through encryption or distributed storage, the receiver's explicit behavior during the data retrieval phase may still expose its identity and location, leading to subsequent targeted attacks. Therefore, while ensuring the security of data transmission, reducing the risk of the receiver's behavioral characteristics being identified during the data retrieval phase is also a pressing issue that needs to be addressed. Summary of the Invention

[0004] To address one or more problems in the prior art, the main objective of this application is to provide a method and system for secure encrypted transmission of network data.

[0005] To achieve the above-mentioned objectives, this application proposes a method for secure encrypted transmission of network data, the method comprising: In response to the received data encryption transmission command, the original data is segmented and encoded to generate multiple data fragments, and each data fragment is assigned a unique identifier; Each data segment is sent to multiple pre-selected intermediate nodes for storage; wherein each intermediate node stores only a portion of the data segment, and the destination address of any data segment is the intermediate node rather than the receiving end; Send transmission configuration information to the receiving end. The transmission configuration information includes unique identifiers corresponding to multiple data segments. The transmission configuration information is used by the receiving end when reassembling the data. Upon receiving a trigger request sent by the receiving end when it is necessary to restore the original data, in response to the trigger request, each intermediate node storing the corresponding data segment is instructed to send the stored data segment to the receiving end within a predetermined time window. The receiver receives the data reconstruction result returned by the receiving end, wherein the reconstruction result is obtained by the receiving end restoring the original data according to the decoding method corresponding to the encoding process after receiving the data segment within the predetermined time window; Based on the data reconstruction results, the encrypted transmission of the original data is completed.

[0006] This application also provides a network data secure encrypted transmission system, including: The acquisition and generation module is used to respond to the acquired data encryption transmission command, segment and encode the original data, generate multiple data fragments, and assign a unique identifier to each data fragment; The first sending module is used to send each data segment to a plurality of pre-selected intermediate nodes for storage; wherein each intermediate node only stores a portion of the data segment, and the destination address of any data segment is the intermediate node rather than the receiving end; The second sending module is used to send transmission configuration information to the receiving end. The transmission configuration information includes unique identifiers corresponding to multiple data segments. The transmission configuration information is used by the receiving end when reassembling the data. The first receiving module is configured to, upon receiving a trigger request sent by the receiving end when it is necessary to recover the original data, respond to the trigger request by instructing each intermediate node storing the corresponding data fragment to send the stored data fragment to the receiving end within a predetermined time window. The second receiving module is used to receive the data reconstruction result returned by the receiving end, wherein the reconstruction result is obtained by the receiving end restoring the original data according to the decoding method corresponding to the encoding process after receiving the data segment within the predetermined time window; The transmission determination module is used to complete the encrypted transmission of the original data based on the data reconstruction result.

[0007] This application also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of any of the methods described above.

[0008] This application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any of the methods described above.

[0009] The network data security encryption transmission method and system of this application addresses the shortcomings of traditional end-to-end continuous transmission, such as easy interception of data, obvious traffic characteristics, and concentrated risks at intermediate nodes, by constructing a transmission mode of distributed storage, silent waiting, and synchronous collection. Specifically, the sending end first divides and encodes the original data into multiple data fragments, making it impossible to reconstruct complete information from any single fragment. These fragments are then sent to multiple pre-selected intermediate nodes in the network for storage, with each fragment's transmission destination address being an intermediate node rather than the final receiving end, thus avoiding concentrated exposure of data on a single link. When the receiving end needs to obtain data, it activates the sending end by sending a trigger request. The sending end instructs each intermediate node to simultaneously and explosively send the stored data fragments to the receiving end within a predetermined time window, compressing the time window for continuous monitoring and capture. After collecting a sufficient number of data fragments within the window, the receiving end decodes and reconstructs the original data, returning the result to the sending end to complete the transmission. This method, through its spatiotemporal separation design, makes it difficult for attackers to obtain complete data by breaching a single node, and also makes it difficult to identify communication behavior through traffic analysis, thus improving the concealment and anti-attack capabilities during data transmission. Attached Figure Description

[0010] Figure 1 This is a flowchart illustrating a network data secure encrypted transmission method according to an embodiment of this application; Figure 2 This is a flowchart illustrating a network data secure encrypted transmission method according to an embodiment of this application; Figure 3 This is a schematic block diagram of a network data security encryption transmission system according to an embodiment of this application; Figure 4 This is a schematic block diagram of the structure of a computer device according to an embodiment of this application; Figure 5 This is a schematic diagram of the time window for a network data secure encrypted transmission method according to an embodiment of this application.

[0011] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0012] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0013] Reference Figure 1 This application provides a method for secure encrypted transmission of network data, the method comprising: S1. In response to the received data encryption transmission command, the original data is segmented and encoded to generate multiple data fragments, and each data fragment is assigned a unique identifier. S2. Each data segment is sent to multiple pre-selected intermediate nodes for storage; wherein each intermediate node stores only a portion of the data segment, and the destination address of any data segment is the intermediate node rather than the receiving end; S3. Send transmission configuration information to the receiving end. The transmission configuration information includes unique identifiers corresponding to multiple data segments. The transmission configuration information is used by the receiving end when reassembling the data. S4. Upon receiving a trigger request sent by the receiving end when it is necessary to restore the original data, in response to the trigger request, instruct each intermediate node storing the corresponding data segment to send the stored data segment to the receiving end within a predetermined time window. S5. Receive the data reconstruction result returned by the receiving end, wherein the reconstruction result is obtained by the receiving end restoring the original data according to the decoding method corresponding to the encoding process after receiving the data segment within the predetermined time window; S6. Based on the data reconstruction result, complete the encrypted transmission of the original data.

[0014] As described in steps S1-S3 above, when the sending end needs to transmit a copy of original data to the receiving end, it obtains a data encryption transmission instruction. This instruction can be triggered by user operation or automatically generated by the upper-layer application. After receiving the instruction, the sending end segments the original data into multiple smaller data blocks. Based on this, encoding techniques are used to further process these data blocks, generating multiple data fragments. Encoding can be done in various ways, such as network coding, erasure coding, or secret sharing, with the aim of introducing a certain amount of redundant information into the original data so that the receiving end only needs to collect a portion of the data fragments to reconstruct the complete original data. Each data fragment is assigned a unique identifier, which can be a hash value generated based on the data content or a sequence number assigned by the sending end, used to distinguish different data fragments and different fragments corresponding to the same original data. In step S2, the sending end selects multiple intermediate nodes with storage capabilities from the network according to a pre-determined node selection strategy. These intermediate nodes can be routers, switches, cache servers, or content delivery network edge nodes in the network. The sender distributes multiple data fragments generated by S1 to these intermediate nodes. Each intermediate node receives and stores only a portion of the data fragments, not all of them. It's important to emphasize that during this transmission, the network destination address of the data fragments is the IP address of the intermediate node, not the address of the final receiver. This means that the data does not flow directly to the receiver during the initial transmission but is distributed across different locations in the network. After receiving the data fragments, the intermediate nodes store them in their local cache and enter a silent storage state. In this state, the intermediate nodes do not actively transmit these data fragments or expose the fact that they store them. Because the destination address of the data fragments is the intermediate node, not the receiver, even if an attacker intercepts the data packets during transmission, they cannot directly determine the final destination of the data, increasing the difficulty of tracing. After distributing the data fragments, the S3 sender sends a transmission configuration message to the receiver. This configuration message contains parameters necessary for the receiver to subsequently reassemble the data, such as the session identifier corresponding to this transmission, the total number of data fragments, the minimum number of fragments required for decoding, and the distribution information of each intermediate node. This information can be sent via a separate secure channel or embedded in subsequent communications. Before triggering data reclamation, the receiving end needs sufficient information to correctly collect and reassemble data from intermediate nodes. The receiving end obtains the "map" and "key" for data reassembly, preparing for the reclamation process, while a shared understanding of the transmission is established between the sending and receiving ends.

[0015] As described in steps S4-S6 above, when the receiving end needs to obtain the raw data, it generates a trigger request and sends it out over the network. This trigger request can be a specific UDP multicast packet or ICMP packet, containing information such as the session identifier of the data to be recovered. After receiving this trigger request, the sending end identifies which transmission task needs to be activated based on the session identifier carried in the request. Subsequently, the sending end generates a trigger instruction and sends it to each intermediate node that stores the corresponding data segment of this transmission. The trigger instruction includes a parameter of a predetermined time window, instructing the intermediate nodes to simultaneously send their stored data segments to the receiving end within the specified time window. This predetermined time window can be an extremely short period of time, such as microseconds or milliseconds, with the aim of concentrating the sending behavior of all intermediate nodes within the same short time slice. Step S4 introduces an "on-demand triggering" and "synchronous sending" mechanism. The data segment is silently stored on the intermediate nodes for a long time and is only activated for sending after receiving a valid trigger instruction. Because the data is in an invisible state for most of the time and is only exposed to the network within a very short predetermined time window, the probability of being continuously monitored and captured is reduced. Simultaneously, multiple intermediate nodes send data, enabling data aggregation to be completed in a very short time, reducing the data exposure time on the link. After the S5 intermediate node sends data segments to the receiving end within a predetermined time window, the receiving end continuously listens for and collects all arriving data segments within that time window. Once the receiving end has collected a sufficient number of data segments, it uses the decoding algorithm corresponding to the S1 encoding process to decode and reassemble these data segments, restoring the original data. Subsequently, the receiving end returns the reassembled result to the sending end. This reassembled result indicates whether the data was successfully restored; if it failed, it can also include the reason for the failure or an identifier of missing segments. The S6 sending end performs the corresponding completion operation based on the data reassembled result received from S5. If the reassembled result indicates successful data restoration, the sending end confirms that the encrypted transmission task has been successfully completed and can clear the local cache or record a log. If the reassembled result indicates failure, the sending end can decide whether to re-initiate the transmission or take other remedial measures based on the reason for the failure.

[0016] As described above, by constructing a transmission mode of distributed storage, silent waiting, and synchronous data collection, this method solves the shortcomings of traditional end-to-end continuous transmission, such as the ease with which data can be intercepted as a whole, obvious traffic characteristics, and concentrated risks at intermediate nodes. Specifically, the sending end first divides and encodes the original data into multiple data fragments, making it impossible to reconstruct the complete information from any single fragment. These fragments are then sent to multiple pre-selected intermediate nodes in the network for storage, with each fragment's destination address being an intermediate node rather than the final receiving end, thus avoiding concentrated exposure of data on a single link. When the receiving end needs to retrieve data, it activates the sending end by sending a trigger request. The sending end then instructs each intermediate node to simultaneously and explosively send the stored data fragments to the receiving end within a predetermined time window, compressing the time window for continuous monitoring and capture. After collecting a sufficient number of data fragments within the window, the receiving end decodes and reconstructs the original data, returning the result to the sending end to complete the transmission. This method, through its spatiotemporal separation design, makes it difficult for attackers to obtain complete data by breaching a single node, and also makes it difficult to identify communication behavior through traffic analysis, thus improving the stealth and anti-attack capabilities during data transmission.

[0017] In one embodiment, the step of sending each data fragment to a pre-selected plurality of intermediate nodes for storage includes: Obtain the current network topology information, the autonomous system affiliation information of each node, geographical location information, and network information of the operator to which the node belongs; Based on the topology information, nodes at different levels in the network are identified, and based on the identification results, candidate node combinations located on the same physical link are excluded from the candidate intermediate nodes. Based on the autonomous domain affiliation information, the candidate intermediate nodes are classified according to their respective autonomous domains, and the selected intermediate nodes are distributed in at least two different autonomous domains. Based on the geographical location information, the geographical distance between each candidate node is calculated, and the selected intermediate nodes are distributed among nodes in different geographical regions. Based on the operator network information, the candidate intermediate nodes are classified according to their respective operators, and the selected intermediate nodes are distributed in at least two different operator networks. Based on the selected candidate nodes, multiple intermediate nodes are selected as storage nodes, and different intermediate nodes are assigned to multiple data segments corresponding to the same original data, so that each intermediate node stores only one data segment, and all data segments corresponding to the same original data are distributed and stored in intermediate nodes with different network locations. For each data segment, a network transmission path is planned from the sender to the corresponding intermediate node, ensuring that the transmission paths of different data segments do not have overlapping nodes at the physical link layer and routing layer.

[0018] As mentioned above, before selecting intermediate nodes, the sending end in step one first obtains comprehensive network environment information. Topology information describes the connection relationships between various devices in the network, including the connection methods of physical links, the routing of network layers, and the distribution of nodes at different levels. Autonomous System (AS) affiliation information refers to the AS number to which each node belongs; an AS is a collection of networks managed by a single organization in the Internet. Geographic location information includes physical coordinates such as the country, city, and data center location of the node. Carrier network information refers to the Internet service provider to which the node belongs, such as different carrier networks like China Telecom, China Unicom, and China Mobile. This information can be obtained through various methods, including network measurement tools, routing table queries, third-party databases, or interaction with network management systems. In step two, based on the obtained topology information, the sending end analyzes the hierarchical position of each node in the network, such as core layer nodes, aggregation layer nodes, and access layer nodes, and whether there are shared physical link resources between nodes. The term "same physical link" refers to two or more nodes sharing the same optical fiber, the same cable, or the same switching equipment at the physical layer. If two candidate nodes are located on the same physical link, then when an attacker listens to or attacks that physical link, data fragments stored on both nodes may be obtained simultaneously. Therefore, the sending end needs to exclude node combinations located on the same physical link from the candidate node set to ensure that the finally selected nodes are physically isolated. The principle is a physical layer isolation design. This prevents the risk of multiple data fragments being leaked simultaneously due to the breach of a single physical link, achieving physical layer dispersion of data storage. Step 3: The sending end groups the candidate nodes according to the autonomous system information to which each node belongs. An autonomous system is the management boundary at the Internet routing layer. Nodes within the same autonomous system are usually managed by the same organization and share the same routing policies and security domains. If all selected intermediate nodes are concentrated in the same autonomous system, then once an attacker penetrates the administrative authority of that autonomous system or deploys monitoring points within that autonomous system, they may obtain multiple data fragments simultaneously. Therefore, the selected intermediate nodes are distributed in at least two different autonomous systems to ensure that data fragments cross different routing management boundaries. The principle is a distributed design at the routing management layer. Even if an attacker controls a particular autonomous system, obtaining a complete set of data fragments is difficult, raising the attack threshold. Step four involves the sending end assessing the geographical dispersion of the nodes based on their location information. Geographical regions can be divided at different levels, such as cities, provinces, and countries. If all selected intermediate nodes are concentrated in the same geographical region, then when a natural disaster, power outage, or regional network blockade occurs in that region, all data fragments may become unavailable simultaneously; furthermore, if an attacker deploys physical eavesdropping devices in that region, they may also capture multiple fragments simultaneously.Therefore, the multiple intermediate nodes selected in this embodiment are distributed across nodes in different geographical regions, achieving geographical dispersion. Step 5: The sending end groups the candidate nodes according to the operator network information to which the nodes belong. Interconnection between different operator networks usually requires specific interconnection nodes, and the network management and monitoring capabilities within each operator are independent of each other. If all nodes are concentrated within the same operator network, an attacker may monitor the entire transmission process through the operator's internal traffic monitoring system. Therefore, the selected multiple intermediate nodes are distributed across at least two different operator networks, achieving operator-level dispersion. The principle is operator-level isolation design. Step 6: After screening through the aforementioned multiple dimensions, the sending end finally determines the multiple intermediate nodes used in this transmission from the candidate nodes that meet the conditions. When allocating data segments, the sending end ensures that each intermediate node stores only one data segment, and all data segments corresponding to the same original data are allocated to intermediate nodes with different network locations. The so-called different network locations mean that these nodes have sufficient differences in the aforementioned topology, autonomous system, geography, operator, and other dimensions. By implementing the principle of distributed storage onto each data segment, attackers can prevent the recovery of the original data even if they control multiple nodes, as long as these nodes do not simultaneously cover a sufficient number of segments. Step seven focuses not only on the distribution of storage nodes but also on the distribution of data paths during transmission. When sending data segments to various intermediate nodes, the sender plans an independent network transmission path for each segment and ensures that the transmission paths of different segments do not share nodes at the physical link layer and routing layer. This means that the transmission paths of two segments will not pass through the same router or the same physical link, thereby avoiding the simultaneous leakage of multiple segments due to the compromise of an intermediate routing node during transmission. The principle is the isolation design of the transmission path. This extends distributed protection from the storage stage to the transmission stage, achieving end-to-end path isolation from the time the data leaves the sender to the time it arrives at the intermediate node, further reducing the risk of concentrated exposure of data during transmission.

[0019] Reference Figure 2 In one embodiment, the method further includes: S51. If no data reassembly result is received within the preset waiting time threshold, obtain the failure reason information. S52. Determine the data segments that need to be supplemented based on the failure reason information, and re-encode the data segments that need to be supplemented. S53. Based on the result of the re-encoding process, resend to the new intermediate node for storage and update the transmission configuration information at the receiving end; S54. Re-execute the steps of triggering and receiving data reconstruction results until a successful data reconstruction result is received.

[0020] As described in the steps above, after instructing the intermediate nodes to send data segments to the receiver, the S51 sending end does not wait indefinitely for feedback from the receiver. The sending end starts a timer and sets a waiting time threshold. This threshold needs to consider the normal latency of network transmission, the time consumed by the intermediate nodes sending data, and the decoding processing time of the receiver; it can be set slightly greater than the sum of these times. If the sending end does not receive the data reassembly result from the receiver within the preset waiting time threshold, it determines that an anomaly may have occurred in this data recovery process. At this time, it obtains the failure reason information. The failure reason information can come from various sources, such as a brief error report that the receiver may send under abnormal circumstances, the status information returned by the intermediate nodes after sending data, or the link connectivity detection results obtained by the sending end itself through network probing. Specifically, the failure reason information may include which data segments were not successfully acknowledged by the receiver, which intermediate nodes did not send data as expected, or whether there is severe packet loss or latency on the network link. The principle lies in establishing a timeout judgment mechanism and a fault information collection mechanism. After obtaining the failure reason information, the S52 sending end parses and analyzes the information. The failure reason information may explicitly indicate which data segments were not successfully received by the receiver; for example, the receiver may provide a unique identifier for the missing segment. It may also indirectly indicate that some intermediate nodes have malfunctioned, such as a node failing to send data within the specified time or a data packet being lost in the network. Based on this information, the sender can precisely locate which data segments need to be supplemented. Data segments requiring supplementation fall into two categories: those already confirmed as not successfully received by the receiver, and those originally stored on malfunctioning intermediate nodes, which may be offline or have corrupted data, making them unable to be sent normally in subsequent retries. After identifying the data segments requiring supplementation, the sender does not simply copy the original data segments; instead, it re-encodes these supplementary data. Re-encoding can use the same encoding algorithm as in step one, but generates entirely new encoded segments. These new segments are mathematically equivalent to the original data, but differ in data content and identifiers. After re-encoding (S53), the sender needs to select new storage nodes for these new data segments. When selecting new intermediate nodes, the sending end can reuse the aforementioned multi-dimensional distributed selection strategy to choose nodes that meet the distribution requirements from the remaining available nodes as supplementary storage nodes. It should be noted that these new nodes should, as far as possible, differ from the original intermediate nodes in dimensions such as topology, autonomous system, geography, and carrier to maintain the overall distributed storage effect. After sending new data fragments to the new node for storage, the sending end also needs to promptly update the receiving end's transmission configuration information.The updated configuration information needs to reflect the newly added data segments and their corresponding unique identifiers, the distribution information of the new nodes, and, if necessary, the removal of information on expired old nodes. This is to ensure that the receiving end can correctly know where to obtain the complete set of data segments during subsequent triggering processes. The principle is to dynamically maintain the storage resource pool and synchronize configuration information. This gives the system self-healing capabilities, enabling it to automatically replace failed storage nodes. After completing the storage and configuration update of the new node in S54, the sending end returns to the trigger waiting state. When the receiving end sends a trigger request again, the sending end will instruct all intermediate nodes, including the new node, to send data segments to the receiving end within a predetermined time window. It then waits again for the data reassembly result from the receiving end. If the reassembly result is successfully received this time, the process ends. If it still fails, the sending end can repeat S52 to S54, setting a maximum number of retries. When the maximum number of retries is reached and the transmission still fails, the sending end will determine that the transmission has ultimately failed and report the error to the upper-layer application.

[0021] In one embodiment, the step of instructing each intermediate node storing the corresponding data segment to send the stored data segment to the receiving end within a predetermined time window includes: Obtain the clock attribute information of each intermediate node; Based on the clock attribute information, the clock accuracy level of each intermediate node is divided, and the clock reliability level of each node is determined. The clock reliability level is used to characterize the expected deviation range between the node clock and the receiving clock. Based on the receiving capability of the receiver and the clock reliability level of each intermediate node, the width of the reference time window is determined, and a personalized transmission time offset is calculated for each intermediate node. A trigger command is generated for each intermediate node, including personalized transmission parameters such as a reference transmission time, a transmission time offset calculated for that node, and an allowable transmission jitter range. Trigger commands for different personalized transmission parameters are sent to the corresponding intermediate nodes respectively. Intermediate nodes with high clock precision send data in a concentrated manner within the reference time window, while intermediate nodes with low clock precision send data earlier or later according to the transmission time offset. However, all data segments sent by intermediate nodes arrive within the continuous listening window of the receiving end.

[0022] As described above, in step one, before generating trigger commands for each intermediate node, the sending end obtains the clock attribute information of each node. Clock attribute information refers to various parameters that reflect the clock operating status of the intermediate nodes. Specifically, it can include the type of clock synchronization protocol currently used by the node, such as whether it supports Network Time Protocol (NTP), Precision Time Protocol (PTP), or whether it relies on a local crystal oscillator for timing. It can also include the timestamp of the node's most recent clock synchronization with the time server; the longer the time since the last synchronization, the greater the potential clock drift. Furthermore, historical clock deviation data recorded by the node, the clock drift rate, and the reachability of the time server in the node's network environment all fall under the category of clock attribute information. This information can be collected through interaction between the sending end and the intermediate nodes during the data distribution phase, or it can be registered and reported when the intermediate node joins the system. This step aims to solve the clock synchronization problem when multiple nodes send simultaneously, requiring a clear understanding of the clock status of each node. Different intermediate nodes may be deployed in different network environments and use different hardware devices, inevitably resulting in differences in their clock accuracy and stability. If all nodes are required to send data simultaneously without differentiation, nodes with lower clock accuracy may send data earlier or later due to discrepancies between their own time and the actual time, preventing the receiver from collecting all data within the expected time window. Step two involves the sending end obtaining the clock attribute information of each intermediate node, analyzing and processing this information, and classifying the nodes into different clock accuracy levels. Clock reliability level is a comprehensive indicator used to characterize the expected deviation range between the node's clock and the receiver's clock. For example, nodes deployed within a data center that periodically synchronize with a high-precision time server via the PTP protocol can be rated as high, with an expected deviation range likely within microseconds. Nodes deployed on the edge network that rely only on occasional NTP synchronization or entirely on local crystal oscillators can be rated as medium or low, with expected deviation ranges potentially in milliseconds or even larger. This classification can employ a three-level, five-level, or continuous scoring system, depending on the system's accuracy requirements and the actual distribution of nodes. Transforming the ambiguous clock skew problem into quantifiable metric levels provides a basis for adopting different scheduling strategies for nodes of different levels. Through this classification, the sender can clearly identify which nodes are reliable and can be precisely controlled, and which nodes are unreliable and require special handling. Step three: After determining the clock reliability level of each node, the sender begins planning and calculating time windows. First, the receiver's receiving capacity needs to be considered, i.e., limitations in network interface bandwidth, packet processing speed, buffer size, etc. If the receiver's processing capacity is limited, even if all nodes send simultaneously, packet loss may occur due to excessive instantaneous traffic.Therefore, the sending end needs to determine a baseline time window width by considering factors such as the receiving end's receiving capability, the number of nodes, and the size of data segments. This baseline window is used for nodes with high clock precision, allowing them to transmit within this window. Subsequently, the sending end calculates a personalized transmission time offset for each intermediate node. For nodes with high clock precision, the offset can be set to zero or a very small value, allowing them to transmit within the baseline window. For nodes with medium clock precision, the sending end calculates an advance or delay offset based on their expected deviation range, ensuring that even if the node's own clock has some deviation, the actual arrival time of its transmitted data packets at the receiving end falls within the receiving end's overall listening window. For nodes with low clock precision, the offset may need to be set larger to ensure that their transmission behavior is correctly compensated. The principle is personalized scheduling and deviation compensation. It no longer requires all nodes to be absolutely synchronized in physical time; compensation is achieved through algorithms. Nodes with high clock precision undertake the task of concentrated transmission within the baseline window, ensuring that most data arrives in the shortest possible time; nodes with low clock precision avoid transmission time misalignment caused by their own clock inaccuracies by transmitting earlier or later. Step Four: Based on the calculation results from the previous steps, the sending end generates an independent trigger command for each intermediate node. Each trigger command contains customized sending parameters for that node. These parameters include the base sending time, which is the reference time point for the entire synchronous sending task; the sending time offset calculated for that node, indicating how much earlier or later the node should start sending based on the base time; and the allowed sending jitter range, a fault-tolerance parameter that allows the node to have a small range of fluctuations around a specified time point to accommodate minor delays caused by operating system scheduling and network stack processing. These parameters together constitute the sending schedule for each node. Step Five: Finally, the sending end sends the previously generated customized trigger commands to the corresponding intermediate nodes through a secure channel. Each node only receives its own command and cannot know the sending parameters of other nodes. When the scheduled time arrives, nodes with high clock precision send within the base window according to the base time, nodes with medium clock precision send slightly earlier according to the calculated offset, and nodes with low clock precision send appropriately later. Since the sending end has performed compensation calculations based on the characteristics of each node, the data fragments sent by all nodes will ultimately arrive within the receiving end's continuous listening window as much as possible. The receiving end only needs to set a continuous listening window large enough to cover the arrival times of all nodes to collect all data fragments completely.

[0023] It's worth noting the clock synchronization challenges faced by the concept of a "pre-defined time window" in practical deployment. Ideally, all intermediate nodes should transmit data simultaneously within the same microsecond-level time window to minimize data exposure time on the link. However, in real-world network environments, there are significant differences in hardware conditions, network environments, and time synchronization capabilities among different nodes. Requiring all nodes to achieve microsecond-level synchronization accuracy is unrealistic, and deploying high-precision time synchronization hardware for all nodes would incur substantial costs. Ignoring these differences and simply requiring all nodes to transmit at the same time will inevitably lead to timing misalignments in nodes with low clock precision, preventing the receiver from collecting all data within the pre-defined narrow window and causing transmission failure. This embodiment, through hierarchical management and personalized compensation of different nodes, allows nodes lacking high-precision clocks to participate in synchronized transmission without becoming a bottleneck in the system. Nodes with high clock precision are responsible for transmitting data in a concentrated manner within the reference window, ensuring that most data arrives in the shortest possible time. Nodes with low clock precision compensate for the offset, so although the transmission time is slightly earlier or later, their data can still be completely received by the receiver within a slightly wider continuous listening window.

[0024] refer to Figure 5This embodiment illustrates how four intermediate nodes achieve data convergence within the receiver's continuous listening window using personalized transmission time offsets. In this embodiment, before generating a trigger command, the sender first obtains the clock attribute information of nodes A, B, C, and D. Analysis reveals that nodes A and D have high clock accuracy, with minimal deviation from the receiver's expected clock, and are classified as high-confidence. Node B has medium clock accuracy, and node C has low clock accuracy. Further measurements reveal that node B's clock is too fast; its local time is ahead of the actual time. If it is required to transmit at the reference time, it will actually transmit data before the actual time, causing the data to arrive prematurely. Node C's clock is too slow; its local time is behind the actual time. If it is required to transmit at the reference time, it will actually transmit data after the actual time, causing the data to arrive late. Based on this analysis, the sender determines a reference time window width and calculates a personalized transmission time offset for each node. Nodes A and D, being high-precision nodes, have negligible clock deviations, so their transmission time offsets are set to zero. They begin transmitting data at the reference time and complete transmission within the reference time window. Node B, with a faster clock, needs to wait slightly to compensate for its tendency to transmit early; therefore, its calculated transmission time offset is delayed transmission, meaning node B begins transmitting data after the reference time. Node C, with a slower clock, needs to transmit slightly earlier to compensate for its tendency to transmit late; therefore, its calculated transmission time offset is advanced transmission, meaning node C begins transmitting data before the reference time. Looking at the timeline, data from nodes A and D arrive at the receiver within the reference time window. Data from node C arrives slightly earlier due to its early transmission, and data from node B arrives slightly later due to its delayed transmission. However, because the sender has precisely compensated for the clock deviation direction of each node, all these data segments ultimately fall within the continuous listening window set by the receiver. The receiver continuously listens from an earlier time point to a later time point, collecting all data segments from the four nodes within this continuous time period. In summary, this embodiment obtains the clock deviation direction of each node and assigns personalized transmission time offsets that are earlier or later to different nodes. This ensures that high-precision nodes can transmit in a concentrated manner within the narrowest reference window to shorten data exposure time, while directional compensation ensures that data from nodes with clock speed issues can still be completely collected by the receiver, thus achieving a balance between transmission efficiency and node compatibility.

[0025] In one embodiment, each time a new data encryption transmission command is received, multiple intermediate nodes to be used in this transmission are determined by randomization from a set of candidate intermediate nodes that meet preset network dispersion requirements. Each time a trigger request is received from the receiving end, the predetermined time window parameters for this transmission are generated through randomization. The predetermined time window parameters are carried in the trigger command and sent to each intermediate node.

[0026] As described above, in step one, when the sending end receives a new encrypted data transmission command, it does not reuse the intermediate nodes selected in the previous transmission, nor does it select nodes according to a fixed pattern. Instead, the sending end first filters from a pre-built set of candidate intermediate nodes. All nodes in this candidate set already meet the multi-dimensional network dispersion requirements, meaning they have sufficient differences in topology, autonomous system affiliation, geographical location, and operator network. Based on this dispersion requirement, the sending end further uses randomization to determine which nodes to use in this transmission. The randomization can be implemented using a cryptographically secure pseudo-random number generator, combined with entropy sources such as the current timestamp and transmission session identifier, to generate random selection results, ensuring that the node combination selected each time is statistically unpredictable. The principle is to break the determinism and regularity of node selection. Even if an attacker gains knowledge of the composition of the candidate node set through long-term observation, they cannot predict which nodes the sending end will choose to store data fragments in each specific transmission. Attackers find it difficult to predict the storage location of subsequent transmissions by analyzing the node distribution of historical transmissions, and it is also difficult to accumulate data fragments from multiple transmissions by long-term surveillance of certain fixed nodes. Step Two: When the receiving end needs to recover data and sends a trigger request, the sending end, when preparing the trigger command, will not use a fixed time window parameter. Regardless of the size of the time window used in the previous transmission, and regardless of the historical distribution pattern of the time windows, the sending end will randomly generate a new set of time window parameters for this transmission. This set of parameters can include the start time of the window, the duration of the window, and even finer micro-time slot divisions within the window. The randomization method also relies on a secure, encrypted random number source to ensure that the time window parameters generated each time are evenly distributed within the value range and are unpredictable. For example, timed transmissions and fixed durations are examples of this regularity, which is precisely the basis for attackers to conduct targeted eavesdropping. By randomizing the time window parameters for each transmission, the recovery times of different transmissions present an unpredictable distribution on the timeline. Attackers find it difficult to infer the possible time period of the next transmission based on the time characteristics of previous transmissions, making it difficult to deploy eavesdropping devices in a targeted manner. Step Three: The sending end embeds the predetermined time window parameters randomly generated in Step Two into the trigger command, and then sends these commands to the intermediate nodes that store the corresponding data segments of this transmission. Each intermediate node parses the time window parameter from the received instructions and sends data to the receiving end strictly according to the time window indicated by this parameter. Since the time window parameter for each transmission is independently and randomly generated, the sending behavior of the intermediate node in different transmissions exhibits completely different patterns in the time dimension. The principle is to truly implement randomized decisions.Even if an attacker can monitor the sending behavior of an intermediate node in a particular transmission, they cannot apply this behavior pattern to other transmissions because each sending time window is entirely new and unrelated. Furthermore, the intermediate node itself does not retain any potentially correlated state information between different transmissions.

[0027] In this embodiment, because the data is distributed across multiple intermediate nodes and is only retrieved within a very short time window, it is difficult for an attacker to successfully intercept complete data in a single transmission. However, if an attacker possesses long-term observation capabilities, they can continuously monitor and analyze multiple transmissions between the same sender and receiver. Even if each transmission itself is secure, the potential patterns between these transmissions could become a breakthrough point. For example, if each transmission selects roughly the same few intermediate nodes, the attacker can gradually lock onto these nodes and implement penetration; if the time window for each transmission is concentrated within a fixed period, the attacker can focus on deploying monitoring resources during this period. Over time, by accumulating data and observing patterns, the attacker may gradually reveal the system's operating mode, thereby finding a way to break through. Therefore, this embodiment introduces a dual randomization mechanism, making each transmission appear as a completely new and independent event to the attacker. The randomization of node selection makes it difficult for the attacker to predict the storage location of subsequent transmissions based on historical transmissions, while the randomization of the time window parameters makes it difficult for the attacker to predict the retrieval time of subsequent transmissions based on historical transmissions.

[0028] In one embodiment, before the step of sending transmission configuration information to the receiving end, the method further includes: Generate transmission configuration information including real listening window parameters and fake listening window parameters; the real listening window parameters are used to instruct the receiving end to listen to the data port within the predetermined time window; the fake listening window parameters are used to instruct the receiving end to listen to the data port in other time windows outside the predetermined time window; Send the transmission configuration information of the real listening window parameters and the fake listening window parameters to the receiving end.

[0029] As mentioned above, before sending transmission configuration information to the receiver, the sending end first generates configuration information containing two different types of window parameters. One type is the real listening window parameter, which corresponds to a predetermined time window and indicates to the receiver that data segments will actually arrive within a specific time period, requiring careful listening and reception. The other type is the spoof listening window parameter, which instructs the receiver to perform listening operations within other time windows, but during these time windows, no real data segments will arrive. The start time, duration, and repetition count of the spoof listening window can be generated randomly, making them exhibit a distribution on the timeline similar to the real window but without any discernible pattern. A set of listening instructions containing interference information is designed for the receiver. If the receiver is only told to listen within the real window, its listening behavior will exhibit a single point-in-time characteristic, which is very obvious when attackers conduct full network traffic monitoring. By mixing spoof window parameters into the configuration information, the subsequent listening behavior to be performed by the receiver becomes richer and more complex in the time dimension. The receiving end no longer opens its port at a fixed time, but instead performs the same port listening operation at multiple randomly distributed time points. Secondly, the sending end sends configuration information containing both real and fake window parameters to the receiving end via a secure channel. Upon receiving the configuration information, the receiving end executes the corresponding operations according to the instructions in the information. During the time period indicated by the real window parameters, the receiving end opens the specified port and listens attentively, preparing to receive incoming data segments. During the time period indicated by the fake window parameters, the receiving end also opens the same port and performs listening operations, but no data arrives at this time, or even if unexpected data packets arrive, they are merely ordinary network noise or irrelevant data sent by other systems. When performing fake window listening, the receiving end's behavior pattern is completely consistent with that of performing real window listening, including the port's open state, the running state of the listening program, and the data packet reception and processing flow—all maintain the same behavior. When an attacker continuously monitors the receiving end, they will observe the receiving end repeatedly performing port listening operations at multiple different time points. These listening behaviors appear completely identical from the outside, making it impossible to distinguish which are genuine data arrivals and which are idle fake listening. The receiver's actual receiving behavior is perfectly concealed within multiple fake listening activities. An attacker, through long-term monitoring, might discover that the receiver frequently opens ports for listening, but because each listen could be fake, they cannot determine which listen actually carries data transmission.

[0030] It's worth noting that while the receiving end is often considered a secure endpoint during data transmission, it can become the weakest link in the specific scenario addressed in this solution. When intermediate nodes send bursts of data segments to the receiving end within a predetermined time window, the receiving end needs to open designated ports and receive a large number of data packets within that window. This receiving behavior itself leaves obvious traces at the network layer. If an attacker deploys traffic monitoring sensors across the network, they might not focus on the encrypted data content, but rather observe which IP addresses suddenly experience a surge of data packets at which times. When an IP's traffic suddenly spikes from near zero to an explosive level at a certain moment, that IP will be identified as the receiver of high-value data. Even if the data itself is encrypted and the attacker cannot decrypt the content, the receiving end's network location and identity are exposed. Once exposed, the receiving end may subsequently suffer targeted denial-of-service attacks, penetration attacks, or physical location attacks, leading to the failure of the entire communication or even more serious consequences. To address this risk, this embodiment adds a layer of active obfuscation protection when sending transmission configuration information to the receiving end. When generating configuration information, the sending end doesn't simply instruct the receiving end to listen within the actual time window. Instead, it simultaneously generates a large number of spoofed listening window parameters and sends these to the receiving end. The actual listening window parameters instruct the receiving end to open the port and diligently receive data within the predetermined time window, while the spoofed listening window parameters instruct the receiving end to perform the exact same port listening operation in other randomly generated time windows. Upon receiving this configuration information, the receiving end will repeatedly open the same port at multiple time points as instructed, with only a few time points actually receiving data, while most time points are simply idle.

[0031] In one embodiment, after the step of sending the transmission configuration information of the real listening window parameters and the fake listening window parameters to the receiving end, the method further includes: Generate decoy data packets with the same network protocol type and port number as the multiple data segments transmitted in this operation; The decoy data packet is sent to the receiving end, and the decoy data packet is controlled to arrive at the receiving end within each time window indicated by the fake listening window parameter.

[0032] As described above, after sending the configuration information to the receiver in step one, the sending end does not remain silent but generates a batch of special decoy data packets. These decoy data packets maintain consistency with the real data segments in terms of protocol type; for example, if the real data segment uses the UDP protocol, then the decoy data packets also use the UDP protocol. Regarding port numbers, the decoy data packets use the same target port as the real data segment, i.e., the port that the receiver is listening on. More importantly, the traffic characteristics of the decoy data packets need to match those of the real data segments, including packet size distribution, transmission rate, and time intervals between packets, all of which should simulate the transmission pattern of real data as closely as possible. The sending end can determine the generation rules for the decoy data packets by analyzing the characteristic parameters of the real data segment being transmitted or based on historical transmission statistics. The principle is to prepare realistic traffic content for the fake listening window. If the fake window is only being idly listened to by the receiver without any data packets arriving, then attackers can easily discover which windows are empty and only specific windows have data packets arriving by monitoring network traffic. This significantly reduces the obfuscation effect of the fake window. By generating decoy packets with characteristics similar to real data, data traffic is present within the false window, making it difficult for attackers to distinguish between real and false windows using the simple metric of "whether data arrives." Step two involves the sender precisely controlling the timing of these packets' transmission to ensure they arrive at the receiver on time within each false listening window. This requires the sender to have timing scheduling capabilities, calculating the transmission time of each decoy packet in advance based on the start and duration of the false window, and compensating for network transmission delays. Decoy packets can be sent directly from the sender or forwarded through other relay nodes controlled by the sender to avoid all decoy traffic originating from the same source IP and being identified. Within the false window, decoy packets continuously arrive at the receiver at a rate and pattern similar to real data fragments. The receiver receives these decoy packets as if they were real data; however, because the decoy packets may carry specific markers or the receiver may already know their decoy identity, the receiver can identify and discard them after receipt, without affecting subsequent real data decoding.

[0033] In one feasible embodiment, generating decoy data packets with the same network protocol type and port number as the multiple data segments transmitted in this instance includes: Obtain the traffic characteristic parameters of the actual data segments transmitted in this transaction; the traffic characteristic parameters include at least one of the following: data packet size distribution, data packet transmission rate, and data packet time interval pattern. Based on the traffic characteristic parameters, decoy data packets are generated, wherein the size, transmission rate, and time interval of the decoy data packets fall within the same statistical distribution range as the real data segments.

[0034] As mentioned above, before generating decoy packets, the sender first needs to perform feature analysis on the real data segments to be sent in this transmission to obtain their traffic characteristic parameters. These parameters specifically include packet size distribution, i.e., how the size of each packet is distributed when the real data segment is sent—whether it is concentrated at a fixed size or fluctuates within a certain range. It also includes packet sending rate, i.e., the number of packets sent per unit time—whether it is sent uniformly or exhibits sudden changes. Furthermore, it includes packet time interval pattern, i.e., whether the time interval between two adjacent packets is fixed, random, or exhibits a certain statistical regularity. These characteristic parameters can be obtained through pre-analysis of the encoding results and sending plan of the real data segments, or they can be statistically analyzed in real time during the transmission process. The sender can record these parameters as a reference template for subsequently generating decoy packets. To ensure that the decoy packets can truly confuse the attacker, the traffic characteristics of the decoy must be as similar as possible to the real data. If the decoy packets simply send some fixed-size packets periodically, even if they arrive within the false window, the attacker can easily detect a significant difference between the two by comparing the traffic patterns of the real and false windows. Real-world data traffic often exhibits specific statistical distributions. For example, the size of data packets for certain applications tends to be concentrated within a specific range, and certain encoding methods can cause periodic fluctuations in packet intervals. These subtle characteristics can become the basis for attackers' identification. Therefore, obtaining the traffic characteristic parameters of real-world data is a prerequisite for generating high-quality decoys. The technical effect is that it provides a precise reference benchmark for subsequent decoy generation, ensuring that the decoy packets are highly consistent with the real data in terms of traffic characteristics. Step two: The sending end begins to generate decoy packets in batches based on the traffic characteristic parameters obtained in step one. During the generation process, the sending end ensures that the size of the decoy packets follows the same distribution pattern as the real data. For example, if the size of real data packets is uniformly distributed between 100 and 200 bytes, then the size of the decoy packets should also be randomly generated within this range according to the same probability distribution. If the sending rate of real data packets is 100 packets per second, then the sending rate of decoy packets should also be controlled at around 100 packets per second, allowing for some normal fluctuations. If the time interval of real data packets follows a specific statistical distribution, such as an exponential or normal distribution, then the time interval of the decoy packets should also be sampled from the same distribution. Decoy packets generated in this way are statistically indistinguishable from real data fragments in terms of traffic characteristics. Even if an attacker captures the decoy traffic within the false window and performs in-depth statistical analysis, it is difficult to detect any significant differences between this traffic and real traffic.If decoy packets exhibit systematic deviations from real data in characteristics such as size, rate, and interval, attackers can easily use machine learning or statistical testing to sift through massive amounts of network traffic to identify those anomalous data streams and thus pinpoint the real window. By ensuring that all observable characteristics of the decoy packets fall within the same statistical distribution range as the real data, the possibility of attackers identifying them through traffic analysis is effectively eliminated.

[0035] Reference Figure 3 This application also provides a network data secure encrypted transmission system, including: The acquisition and generation module 1 is used to respond to the acquired data encryption transmission command, segment and encode the original data, generate multiple data fragments, and assign a unique identifier to each data fragment; The first sending module 2 is used to send each data segment to a plurality of pre-selected intermediate nodes for storage; wherein each intermediate node only stores a portion of the data segment, and the destination address of any data segment is the intermediate node rather than the receiving end; The second sending module 3 is used to send transmission configuration information to the receiving end. The transmission configuration information includes unique identifiers corresponding to multiple data segments. The transmission configuration information is used by the receiving end when reassembling the data. The first receiving module 4 is used to, upon receiving a trigger request sent by the receiving end when it is necessary to restore the original data, respond to the trigger request and instruct each intermediate node storing the corresponding data segment to send the stored data segment to the receiving end within a predetermined time window. The second receiving module 5 is used to receive the data reconstruction result returned by the receiving end, wherein the reconstruction result is obtained by the receiving end restoring the original data according to the decoding method corresponding to the encoding process after receiving the data segment within the predetermined time window; The transmission determination module 6 is used to complete the encrypted transmission of the original data based on the data reconstruction result.

[0036] As described above, it is understood that each component of the network data security encryption transmission system proposed in this application can realize the function of any of the network data security encryption transmission methods described above, and the specific structure will not be described in detail.

[0037] Reference Figure 4 This application also provides a computer device, which may be a server, and its internal structure may be as follows: Figure 4As shown, the computer device includes a processor, memory, network interface, and database connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and database. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The database stores monitoring data and other data. The network interface is used for communication with external terminals via a network connection. When the computer program is executed by the processor, it implements a method for secure encrypted transmission of network data.

[0038] The processor described above executes the network data secure encrypted transmission method, comprising: responding to a received data encryption transmission instruction, segmenting and encoding the original data to generate multiple data fragments, and assigning a unique identifier to each data fragment; sending each data fragment to multiple pre-selected intermediate nodes for storage; wherein each intermediate node stores only a portion of the data fragments, and the transmission destination address of any data fragment is the intermediate node rather than the receiving end; sending transmission configuration information to the receiving end for use by the receiving end when reassembling the data; upon receiving a trigger request sent by the receiving end when it needs to restore the original data, responding to the trigger request, instructing each intermediate node storing the corresponding data fragment to send the stored data fragment to the receiving end within a predetermined time window; receiving the data reassembly result returned by the receiving end, wherein the reassembly result is obtained by the receiving end after receiving the data fragment within the predetermined time window and restoring the original data according to the decoding method corresponding to the encoding process; and completing the encrypted transmission of the original data based on the data reassembly result.

[0039] One embodiment of this application also provides a computer-readable storage medium storing a computer program thereon. When the computer program is executed by a processor, it implements a method for secure encrypted transmission of network data, including the following steps: in response to a received data encryption transmission instruction, segmenting and encoding the original data to generate multiple data fragments, and assigning a unique identifier to each data fragment; sending each data fragment to multiple pre-selected intermediate nodes for storage; wherein each intermediate node stores only a portion of the data fragments, and the transmission destination address of any data fragment is the intermediate node rather than the receiving end; sending transmission configuration information to the receiving end for use by the receiving end when reassembling the data; upon receiving a trigger request sent by the receiving end when it needs to restore the original data, in response to the trigger request, instructing each intermediate node storing the corresponding data fragment to send the stored data fragment to the receiving end within a predetermined time window; receiving the data reassembly result returned by the receiving end, wherein the reassembly result is obtained by the receiving end after receiving the data fragment within the predetermined time window and restoring the original data according to the decoding method corresponding to the encoding process; and completing the encrypted transmission of the original data based on the data reassembly result.

[0040] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in this application and in the embodiments can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual-speed SDRAM (SSRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), RAMbus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0041] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, apparatus, article, or method. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, apparatus, article, or method that includes that element.

[0042] The above description is only a preferred embodiment of this application and does not limit the patent scope of this application. Any equivalent structural or procedural changes made based on the content of this application's specification and drawings, or direct or indirect applications in other related technical fields, are similarly included within the patent protection scope of this application.

Claims

1. A method for secure encrypted transmission of network data, characterized in that, The method includes: In response to the received data encryption transmission command, the original data is segmented and encoded to generate multiple data fragments, and each data fragment is assigned a unique identifier; Each data segment is sent to multiple pre-selected intermediate nodes for storage; wherein each intermediate node stores only a portion of the data segment, and the destination address of any data segment is the intermediate node rather than the receiving end; Send transmission configuration information to the receiving end. The transmission configuration information includes unique identifiers corresponding to multiple data segments. The transmission configuration information is used by the receiving end when reassembling the data. Upon receiving a trigger request sent by the receiving end when it is necessary to restore the original data, in response to the trigger request, each intermediate node storing the corresponding data segment is instructed to send the stored data segment to the receiving end within a predetermined time window. The receiver receives the data reconstruction result returned by the receiving end, wherein the reconstruction result is obtained by the receiving end restoring the original data according to the decoding method corresponding to the encoding process after receiving the data segment within the predetermined time window; Based on the data reconstruction results, the encrypted transmission of the original data is completed.

2. The network data secure encrypted transmission method according to claim 1, characterized in that, The step of sending each data segment to multiple pre-selected intermediate nodes for storage includes: Obtain the current network topology information, the autonomous system affiliation information of each node, geographical location information, and network information of the operator to which the node belongs; Based on the topology information, nodes at different levels in the network are identified, and based on the identification results, candidate node combinations located on the same physical link are excluded from the candidate intermediate nodes. Based on the autonomous domain affiliation information, the candidate intermediate nodes are classified according to their respective autonomous domains, and the selected intermediate nodes are distributed in at least two different autonomous domains. Based on the geographical location information, the geographical distance between each candidate node is calculated, and the selected intermediate nodes are distributed among nodes in different geographical regions. Based on the operator network information, the candidate intermediate nodes are classified according to their respective operators, and the selected intermediate nodes are distributed in at least two different operator networks. Based on the selected candidate nodes, multiple intermediate nodes are selected as storage nodes, and different intermediate nodes are assigned to multiple data segments corresponding to the same original data, so that each intermediate node stores only one data segment, and all data segments corresponding to the same original data are distributed and stored in intermediate nodes with different network locations. For each data segment, a network transmission path is planned from the sender to the corresponding intermediate node, ensuring that the transmission paths of different data segments do not have overlapping nodes at the physical link layer and routing layer.

3. The network data secure encrypted transmission method according to claim 1, characterized in that, Prior to the step of receiving the data reconstruction result returned by the receiving end, the method further includes: If no data reassembly result is received within the preset waiting time threshold, obtain the failure reason information; Based on the failure reason information, determine the data segments that need to be supplemented, and re-encode the data segments that need to be supplemented. Based on the result of the re-encoding process, the data is resent to a new intermediate node for storage, and the transmission configuration information at the receiving end is updated. Repeat the steps of triggering and receiving data reconstruction results until a successful data reconstruction result is received.

4. The network data secure encrypted transmission method according to claim 1, characterized in that, The step of instructing each intermediate node storing the corresponding data segment to send the stored data segment to the receiving end within a predetermined time window includes: Obtain the clock attribute information of each intermediate node; Based on the clock attribute information, the clock accuracy level of each intermediate node is divided, and the clock reliability level of each node is determined. The clock reliability level is used to characterize the expected deviation range between the node clock and the receiving clock. Based on the receiving capability of the receiver and the clock reliability level of each intermediate node, the width of the reference time window is determined, and a personalized transmission time offset is calculated for each intermediate node. A trigger command is generated for each intermediate node, including personalized transmission parameters such as a reference transmission time, a transmission time offset calculated for the node, and an allowable transmission jitter range. Trigger commands for different personalized transmission parameters are sent to the corresponding intermediate nodes respectively. Intermediate nodes with high clock precision send data in a concentrated manner within the reference time window, while intermediate nodes with low clock precision send data earlier or later according to the transmission time offset. However, all data segments sent by intermediate nodes arrive within the continuous listening window of the receiving end.

5. The network data secure encrypted transmission method according to claim 1, characterized in that, The method further includes: In each response to a new data encryption transmission command, several intermediate nodes to be used in this transmission are determined by random selection from a set of candidate intermediate nodes that meet the preset network dispersion requirements. Each time a trigger request is received from the receiving end, the predetermined time window parameters for this transmission are generated through randomization. The predetermined time window parameters are carried in the trigger command and sent to each intermediate node.

6. The network data secure encrypted transmission method according to claim 1, characterized in that, Before the step of sending transmission configuration information to the receiving end, the method further includes: Generate transmission configuration information including real listening window parameters and fake listening window parameters; the real listening window parameters are used to instruct the receiving end to listen to the data port within the predetermined time window; the fake listening window parameters are used to instruct the receiving end to listen to the data port in other time windows outside the predetermined time window; Send the transmission configuration information corresponding to the real listening window parameters and the fake listening window parameters to the receiving end.

7. The network data secure encrypted transmission method according to claim 6, characterized in that, After the step of sending the transmission configuration information of the real listening window parameters and the fake listening window parameters to the receiving end, the method further includes: Generate decoy data packets with the same network protocol type and port number as the multiple data segments transmitted in this operation; The decoy data packet is sent to the receiving end, and the decoy data packet is controlled to arrive at the receiving end within each time window indicated by the fake listening window parameter.

8. A network data secure encrypted transmission system, characterized in that, include: The acquisition and generation module is used to respond to the acquired data encryption transmission command, segment and encode the original data, generate multiple data fragments, and assign a unique identifier to each data fragment; The first sending module is used to send each data segment to a plurality of pre-selected intermediate nodes for storage; wherein each intermediate node only stores a portion of the data segment, and the destination address of any data segment is the intermediate node rather than the receiving end; The second sending module is used to send transmission configuration information to the receiving end. The transmission configuration information includes unique identifiers corresponding to multiple data segments. The transmission configuration information is used by the receiving end when reassembling the data. The first receiving module is configured to, upon receiving a trigger request sent by the receiving end when it is necessary to recover the original data, respond to the trigger request by instructing each intermediate node storing the corresponding data fragment to send the stored data fragment to the receiving end within a predetermined time window. The second receiving module is used to receive the data reconstruction result returned by the receiving end, wherein the reconstruction result is obtained by the receiving end restoring the original data according to the decoding method corresponding to the encoding process after receiving the data segment within the predetermined time window; The transmission determination module is used to complete the encrypted transmission of the original data based on the data reconstruction result.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 7.

Images