Message encryption routing method and system based on mixnet hierarchical network and edge computing

Abstract

The invention discloses a message encryption routing method and system based on a mixnet hierarchical network and edge computing, and efficient and safe message routing is realized by designing a mixnet hierarchical network topological structure and combining with an edge server dynamic unloading mechanism. A user generates a layer-by-layer encrypted message, selects a dynamic path and sends the message; the mix node processes the message through random delay, judges the load state and forwards the message to the edge server during overload; the edge server asynchronously processes encrypted messages with multiple threads to significantly reduce latency and mitigate network node load pressure. According to the method, a hybrid encryption technology based on symmetric encryption and asymmetric encryption is adopted, and data privacy and path anonymity are guaranteed through layer-by-layer encryption and decryption. Meanwhile, performance requirements of different scenes can be met by adjusting a node load threshold value and hierarchical network configuration.

Description

Technical Field

[0001] The present invention relates to communication networks and information security technologies, and in particular to a message encryption routing method and system based on a mixnet layered network and edge computing. Background Art

[0002] With the rapid development of the information society, data privacy and user anonymity have become important issues in the field of network security. In an increasingly complex network environment, user identities and communication content are often at risk of being leaked or abused. In order to meet this challenge, anonymous communication network technology has emerged. Mixnet, as one of the privacy protection technologies with important application prospects, effectively prevents communication path analysis and identity tracking through multi-layer encryption and message obfuscation mechanisms, and ensures user anonymity.

[0003] An anonymous communication network is a system that uses special communication protocols and encryption technology to ensure that user identities and communication content are not monitored, tracked, and analyzed by third parties. In traditional communication networks, data usually exposes information such as the sender, receiver, and message content during transmission, which provides opportunities for attacks such as traffic analysis and identity recognition. In order to solve this problem, the design of anonymous communication networks aims to hide the identity information of both parties in communication and protect the privacy of message content. At present, the most famous anonymous communication networks include Tor, mixnet, etc. Among them, mixnet, as an early proposed solution, uses multi-layer encryption and obfuscation technology to effectively prevent traffic analysis and path tracing attacks, ensuring the anonymity of the communication process and the security of data.

[0004] The working principle of mixnet is based on the "mixing" and "delay" mechanism, which focuses on disrupting and encrypting the communication path to prevent the identities of both parties and the content of the message from being snooped on by the outside. Mixnet encrypts and obfuscates the message layer by layer through multiple message nodes (mixnode), making it difficult for attackers to obtain the actual communication path by analyzing the message traffic even if they can intercept the communication of a certain node.

[0005] Specifically, the core principles adopted by mixnet are:

[0006] 1. Multi-layer encryption: When sending a message, the message will go through multiple encryption layers, and each layer of encryption uses a different key to encrypt it, ensuring that each intermediate node can only decrypt the information of the next hop, but cannot decrypt the complete message content. In this way, even if the message is intercepted by a node during transmission, it cannot know the entire communication path or message content.

[0007] 2. Mixing mechanism: Mixnet mixes, sorts, and delays message traffic so that each node can only process local information. Messages are transmitted through multiple nodes in the network, encrypted, and shuffled before finally reaching the recipient. Since each node can only process encrypted data and partial routing information, attackers cannot identify the sender and receiver of a message based solely on the traffic pattern of the message.

[0008] 3. Delay: In order to improve the security of the system, mixnet usually introduces a delay mechanism, which makes message traffic more difficult to analyze by deliberately introducing transmission delays. Although the delay mechanism may affect the real-time performance of the network, in application scenarios that focus on privacy protection, the introduction of delay is to enhance the ability to resist traffic analysis attacks.

[0009] As a classic anonymous communication solution, mixnet is widely used in scenarios where user privacy and communication content need to be protected, especially in the fields of anonymous email, anonymous payment systems, and digital voting systems.

[0010] Although mixnet has important application value in anonymous communication, it also faces a series of challenges and shortcomings: the first is the network delay problem. Since the messages of mixnet need to be processed by multiple encryption nodes, the delay introduced in the system is high, which may affect application scenarios with high real-time requirements (such as instant messaging, video conferencing, etc.). Secondly, its computing overhead. Each node needs to perform multiple encryption and decryption operations on the message, which puts high demands on the computing power of the node, especially in the scenario of high-frequency communication, the computing power and bandwidth of the node may become a bottleneck. Then there is the security issue. Although mixnet can effectively prevent traffic analysis attacks, if the attacker controls enough nodes, it may be possible to identify the sender or receiver of the message through statistical analysis or coordinated attack methods. Therefore, the security of mixnet depends on the distribution and strategy of nodes in the network. Summary of the invention

[0011] Purpose of the invention: The purpose of the present invention is to solve the deficiencies in the prior art and provide a message encryption routing method and system based on a mixnet layered network and edge computing; this patent introduces an edge server to process encrypted messages in a multi-threaded asynchronous manner, thereby reducing latency; the edge server undertakes part of the computing tasks, balances the node load, and reduces the computing pressure of a single node. When the network scale increases, new edge servers can be added dynamically to improve the system processing capacity. Regarding security issues: messages are encrypted using multiple layers, and each node can only decrypt its own encryption layer and cannot obtain complete path information; to prevent traffic patterns from being analyzed, each node introduces random delays and generates false traffic when necessary to confuse attackers; the node's path selection and encryption strategy are adjusted regularly so that attackers cannot predict the path of the message through static analysis.

[0012] Technical solution: A message encryption routing method based on a mixnet layered network and edge computing of the present invention comprises the following steps:

[0013] Step 1: First, construct a hierarchical network topology structure. The number of network layers in the hierarchical network topology structure is L, the number of nodes in each network layer is N, and each network layer contains multiple obfuscated nodes; an edge server is provided in the hierarchical network topology structure;

[0014] Then, the user selects a node in the current layer as part of the path through a random selection algorithm or a rule based on path optimization, and then selects a path P = {n1, n2, ..., n L}, where n i It is a confusion node in the i-th network layer; the multi-node design further improves the anonymity and anti-traffic analysis capabilities of the path;

[0015] Step 2: Use a hybrid encryption method to encrypt the original message content M layer by layer to generate a recursively encapsulated message, wherein the symmetric key of each layer of nodes is first encrypted using asymmetric encryption RSA, and then the message encrypted by asymmetric encryption RSA is encrypted using symmetric encryption AES to obtain an encrypted message The expression is as follows:

[0016]

[0017] In the above formula, K i For node n i The symmetric encryption key K is used by RSA i encryption; Indicates the encryption operation on the node;

[0018] Step 3

[0019] The obfuscation node decrypts the message layer by layer along the path P, and the expression is as follows:

[0020]

[0021] The above decryption process is automatically completed by each obfuscation node in the network, and the user is only responsible for generating encrypted information and sending it to the first node; in the above formula, Indicates that in the confusion node n i Encrypted message Decryption operation, RSA -1 For asymmetric decryption operations, AES -1 It is a symmetric decryption operation;

[0022] Step 4: When the queue load Q of the obfuscation node satisfies Q>T, the message is forwarded to the edge server for processing, where T is a preset threshold; here, Q usually represents the number of pending messages in the node queue;

[0023] Step 5: Record the decryption delay τ of each layer i and network transmission delay δ i , the final total delay Δ is:

[0024]

[0025] Confusion node n i The delay is described by the following model:

[0026] τ i =α*log(Q i )+β;

[0027] Among them, Q i is the number of messages in the node queue, α and β are network configuration parameters;

[0028] The total message decryption delay τ of the edge server e satisfy:

[0029]

[0030] Among them, M num is the number of messages processed simultaneously by the edge server, τ e,j Decryption time of a single message.

[0031] Furthermore, the recursive process of layer-by-layer encryption and layer-by-layer encryption and decryption in step 2 and step 3 satisfies the following conditions:

[0032] The key K of each layer i All are randomly generated, satisfying: H(K i )≈U(0,1);

[0033] H is the entropy function, U(0,1) represents uniform distribution;

[0034] The size of the encrypted message is: S = S M +L*(S K +S padding );

[0035] Among them, S M is the original message size, S K is the encryption key size, S padding is the padding data size; data padding occurs in step 2 (before layer-by-layer encryption) and step 3 (layer-by-layer encryption process). Padding data is added to the encrypted data every time it passes through a node, so that the length of each layer of messages remains consistent, further preventing the length from leaking path information; when using block encryption algorithms such as AES, the message length must be a multiple of the block size (such as 16 bytes). The formula for calculating the padding size is:

[0036] S padding = Block_size-(S M +S K )mod Block_size;

[0037] Wherein, Block_size is the block length of the encryption algorithm, and the block length of the AES algorithm is usually 16 bytes). Furthermore, the probability that the user selects path P in step 1 satisfies the following conditions:

[0038] Node n in the path i The probability of being selected P(n i )for:

[0039] Among them, N i is the total number of nodes in the i-th layer;

[0040] The overall privacy of path P satisfies:

[0041] Among them, I(P) represents the entropy of the path, log(P(n i ))The information entropy of each layer of nodes being selected, The accumulation of all layers of the path represents the total information entropy.

[0042] Furthermore, in step 5, the total delay Δ is used as the system optimization index, and the optimization objective function is:

[0043] Performance optimization is achieved by adjusting the number of network layers L, the number of nodes per layer N, the threshold T and the path selection algorithm;

[0044] Total edge server decryption delay τ eis the decryption delay τ of some nodes i When a hybrid node forwards tasks to an edge server due to overload, its τ i is replaced by τ e , indicating that the delay of this node is transferred to the edge server.

[0045] The present invention also discloses a system for message encryption routing method based on mixnet hierarchical network and edge computing, involving users, hierarchical network topology, obfuscation nodes and edge servers; the hierarchical network topology includes L-layer networks, and the number of nodes in each layer of the network is N; the user selects a path P and encrypts the original message M layer by layer; the obfuscation node decrypts the message layer by layer and calculates the delay τ at the same time i , and forward the message to the edge server when Q>T (Q is the queue load, T is the threshold); the edge server decrypts the message using the public key and private key, and records the total delay τ e .

[0046] Beneficial effects: The present invention can significantly reduce message transmission delay in a high-load network environment, improve system throughput and stability, and is suitable for communication optimization of large-scale distributed systems such as the Internet of Things and blockchain. Compared with the existing technology, the present invention has the following beneficial effects:

[0047] 1. Significantly reduce communication delay. This invention introduces edge servers, and through a series of operations such as load transfer and task sharing, message decryption, delay optimization and network load balancing, it distributes traditional Mix network tasks to distributed nodes for processing, thereby significantly reducing the delay of message transmission. Through dynamic routing selection, messages can be transmitted through the optimal path, avoiding the problems of node overload and low path selection efficiency in traditional Mixnet.

[0048] 2. Improve system throughput and scalability. The present invention distributes computing tasks to multiple edge servers through edge computing and load sharing mechanisms, balances the load of each node, and avoids computing bottlenecks.

[0049] 3. Enhanced resistance to traffic analysis and path tracing. The present invention combines multi-layer encryption, message obfuscation and dynamic path selection to make messages more complex and unpredictable during transmission, significantly enhancing the system's resistance to traffic analysis attacks.

[0050] 4. Optimized dynamic routing and path selection mechanism. The dynamic routing selection mechanism proposed in the present invention solves the problem that the system intelligently selects the best path for message transmission based on the network status such as the real-time load, delay and bandwidth of each node, thus ensuring transmission efficiency and security.

[0051] 5. Distributed edge computing improves the robustness and reliability of the system. By distributing computing tasks to edge servers, the system can share the computing load among multiple nodes, thereby avoiding the impact of single point failures on the entire system. In addition, the introduction of edge servers also enables the system to better adapt to different network conditions and load requirements, improving the stability and robustness of the system.

[0052] 6. Adapt to a wider range of application scenarios. The present invention can adapt to more application scenarios with higher requirements on real-time performance and throughput, such as the Internet of Things (IoT), smart cities, smart transportation, and real-time financial transactions, through optimized dynamic routing, edge computing, and multi-layer encryption mechanisms. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] Figure 1 It is a schematic diagram of the overall model of the present invention;

[0054] Figure 2 The figure is a schematic diagram of the message transmission process in an embodiment of the present invention. DETAILED DESCRIPTION

[0055] The technical solution of the present invention is described in detail below, but the protection scope of the present invention is not limited to the embodiments.

[0056] Traditional mixnet systems usually need to encrypt and transmit data layer by layer through multiple encryption nodes, which inevitably introduces large delays. In particular, in scenarios with high frequency and large amounts of communication data, the delay problem is particularly prominent, and each node usually handles a large number of encryption calculations and data transmission tasks, which causes the system to have bottlenecks when the node load is high, resulting in reduced throughput. In addition, although traditional mixnets can provide basic anonymity protection, they may still expose some communication paths or identity information when facing large-scale traffic analysis, especially when intermediate nodes are attacked by traffic analysis. In the face of dynamic network environments, path selection is not flexible and is usually suitable for environments with low latency requirements and abundant computing resources.

[0057] like Figure 1 As shown, the message encryption routing method based on mixnet layered network and edge computing of the present invention includes the following steps:

[0058] Step 1: First, construct a hierarchical network topology structure. The number of network layers in the hierarchical network topology structure is L, the number of nodes in each network layer is N, and each network layer contains multiple obfuscated nodes; an edge server is provided in the hierarchical network topology structure;

[0059] Then, the user selects a node in the current layer as part of the path through a random selection algorithm or a rule based on path optimization, and then selects a path P = {n1, n2, ..., n L}, where n i It is a confusion node in the i-th network layer; the multi-node design further improves the anonymity and anti-traffic analysis capabilities of the path;

[0060] Step 2: Use a hybrid encryption method to encrypt the original message content M layer by layer to generate a recursively encapsulated message, wherein the symmetric key of each layer of nodes is first encrypted using asymmetric encryption RSA, and then the message encrypted by asymmetric encryption RSA is encrypted using symmetric encryption AES to obtain an encrypted message The expression is as follows:

[0061]

[0062] In the above formula, K i For node n i The symmetric encryption key K is used by RSA i encryption; Indicates the encryption operation on the node;

[0063] Step 3: The obfuscation node decrypts the message layer by layer along path P. The expression is as follows:

[0064]

[0065] In the above formula, Indicates that in the confusion node n i Encrypted message Decryption operation, RSA -1 For asymmetric decryption operations, AES -1 It is a symmetric decryption operation;

[0066] Step 4: When the queue load Q of the obfuscation node satisfies Q>T, the message is forwarded to the edge server for processing, where T is the preset threshold;

[0067] Step 5: Record the decryption delay τ of each layer i and network transmission delay δ i , the final total delay Δ is:

[0068]

[0069] Confusion node n i The delay is described by the following model:

[0070] τ i =α*log(Q i )+β;

[0071] Among them, Q i is the number of messages in the node queue, α and β are network configuration parameters;

[0072] The total message decryption delay τ of the edge server e satisfy:

[0073]

[0074] Among them, M num is the number of messages processed simultaneously by the edge server, τ e,j Decryption time of a single message.

[0075] The recursive process of layer-by-layer encryption and layer-by-layer encryption and decryption in step 2 and step 3 above meets the following conditions:

[0076] The key K of each layer i All are randomly generated, satisfying: H(K i )≈U(0,1);

[0077] H is the entropy function, U(0,1) represents uniform distribution;

[0078] The size of the encrypted message is: S = S M +L*(S K +S padding );

[0079] Among them, S M is the original message size, S K is the encryption key size, S padding is the padding data size. The probability that the user selects path P in step 1 satisfies the following conditions:

[0080] Node n in the path i The probability of being selected P(n i )for:

[0081] Among them, N i is the total number of nodes in the i-th layer;

[0082] The overall privacy of path P satisfies:

[0083] Among them, I(P) represents the entropy of the path, log(P(n i ))The information entropy of each layer of nodes being selected, The accumulation of all layers of the path represents the total information entropy.

[0084] In step 5 of this embodiment, the total delay Δ is used as the system optimization index, and the optimization objective function is:

[0085]

[0086] Performance optimization is achieved by adjusting the number of network layers L, the number of nodes per layer N, the threshold T and the path selection algorithm;

[0087] Total edge server decryption delay τ e is the decryption delay τ of some nodes i When a hybrid node forwards tasks to an edge server due to overload, its τ i is replaced by τ e , indicating that the delay of this node is transferred to the edge server.

[0088] The above-mentioned system of message encryption routing method based on mixnet hierarchical network and edge computing involves users, hierarchical network topology, obfuscation nodes and edge servers; the hierarchical network topology includes L-layer networks, and the number of nodes in each layer of the network is N; the user selects a path P and encrypts the original message M layer by layer; the obfuscation node decrypts the message layer by layer and calculates the delay τ at the same time i , and forward the message to the edge server when Q>T; the edge server decrypts the message using the public key and private key, and records the total delay τ e .

[0089] In the initialization phase of the system of the message encryption routing method based on the mixnet hierarchical network and edge computing of this embodiment, network settings and key distribution must be performed first. The specific contents are as follows: First, a distributed network including multiple obfuscation nodes (i.e., Mix nodes) and edge servers is created. Each Mix node is responsible for receiving and processing encrypted messages and forwarding them to the next node. The edge server is responsible for load balancing and computing task allocation. To ensure data security, a pair of public and private keys are assigned to each Mix node and edge server through the public key infrastructure (PKI); the user end (sender and receiver) will also generate a shared key through the key exchange protocol for encrypting and decrypting messages.

[0090] In this embodiment, dynamic path selection and message transmission are performed according to the real-time status of the network (node ​​load, delay, bandwidth, etc.). Each Mix node selects a transmission path based on a scoring mechanism:

[0091]

[0092] Among them, B i is the bandwidth of the node, L i is the delay, C i is the current load. The system selects the path with the highest score to ensure efficient data transmission.

[0093] After the message is dynamically selected, it is encrypted from the sender of the user to the first Mix node, and then passes through each Mix node on the path in turn; after receiving the encrypted message, each Mix node decrypts it and forwards the decrypted message to the next Mix node until the message reaches the target node (i.e. the receiver among the users).

[0094] In this embodiment, when performing message encryption and path selection:

[0095] The sender generates the original message M = {ID_src, ID_dest, Timestamp, Payload, MAC}, which contains the sender and receiver's identities, the message timestamp, the actual message content (Payload), and the message authentication code (MAC) used to verify the message integrity. Then, the sender performs multiple layers of encryption on the message, each layer of encryption is encrypted using a different Mix node key. Before the message is sent, the sending path P (there are N Mix nodes on the path) has been determined. The sender first encrypts the message using the public key of the last layer of Mix nodes on the path, and then encrypts it using the public key of the second-to-last layer of Mix nodes, and so on, until the message is completely encrypted.

[0096] When executing message processing and decryption in this embodiment:

[0097] Each Mix node can only decrypt the previous layer of information of the message to maintain the privacy of the message. For node i, the encrypted message C it receives i The private key of this node will be used for decryption:

[0098]

[0099] The Mix node only knows from which node the message is received and forwards it to the next node, ensuring that intermediate nodes cannot know the complete path of the message.

[0100] After decryption, the Mix node performs a delayed mixing process on the message to prevent attackers from identifying the source and destination of the message through traffic patterns. The mixing process can be achieved by reordering the message or adding random padding.

[0101] When the message reaches the receiving end and is finally decrypted, when the encrypted message finally reaches the Mix node of the receiving end, the receiving end starts the decryption process. Each node will decrypt step by step in the order from the last layer node to the first layer node. Assuming that the target node is the receiving end, the decryption process is as follows:

[0102]

[0103] After decryption is completed, the receiver can obtain the original message content, including the payload of the message and additional identity information, timestamp, etc.

[0104] The receiver verifies the integrity and authenticity of the message through MAC (Message Authentication Code) to ensure that the message has not been tampered with. If the verification is successful, the receiver can successfully decrypt and read the message.

[0105] Anti-traffic analysis and protection of this embodiment: To further enhance the system's ability to resist traffic analysis, each Mix node may randomly introduce delays when forwarding messages, and add false traffic (filling packets) when necessary to confuse potential attackers, making traffic analysis more difficult. The node paths and encryption strategies in the Mix network are regularly adjusted to ensure that attackers cannot predict the message transmission path through static analysis patterns.

[0106] In this embodiment, when processing load balancing and scalability, the edge server will monitor the load of the Mix node in real time and perform load balancing based on the computing power, bandwidth and latency of the node. When the load of a node is too high, the system will forward the message to other nodes with lower load to ensure the efficient operation of the system.

[0107] In order to cope with the data transmission needs in large-scale networks, the system supports dynamic expansion. As the number of users and nodes increases, the system automatically adds new Mix nodes and edge servers to ensure communication quality and network stability.

[0108] In the experiment of transmitting 1,000 messages, Chaum's existing Mixnet system has an average delay of up to 3.5 seconds and a throughput of less than 500 messages per second; the delay of the Loopix anonymous system is usually 1-3 seconds, and the throughput is about 300-600 messages per second. Vuvuzela is protected by differential privacy and false traffic, and its delay is usually 5-10 seconds (due to the high computational cost of differential privacy) and the throughput is about 50-200 messages per second. By combining edge computing, the present invention reduces the delay to 1.2 seconds under the same conditions and increases the throughput to 800 messages per second.

[0109] The present invention significantly improves the performance, throughput and security of anonymous communication systems by innovatively combining Mix networks and edge computing. While protecting communication privacy, it reduces latency, improves the scalability and robustness of the system, enhances the ability to resist traffic analysis attacks, and can better adapt to diverse and complex application scenarios. These innovations and optimizations make the present invention have broad application prospects and market value in the field of anonymous communication.

Claims

1. A message encryption routing method based on mixnet layered network and edge computing, characterized in that: The following steps are involved: Step 1: First, construct a hierarchical network topology structure. The number of network layers in the hierarchical network topology structure is L, the number of nodes in each network layer is N, and each network layer contains multiple obfuscated nodes; an edge server is provided in the hierarchical network topology structure; Then, the user selects a node in the current layer as part of the path through a random selection algorithm or a rule based on path optimization, and then selects a path P = {n1, n2, ..., n L }, where n i It is a confusion node in the i-th network layer; the multi-node design further improves the anonymity and anti-traffic analysis capabilities of the path; Step 2: Use a hybrid encryption method to encrypt the original message content M layer by layer to generate a recursively encapsulated message, wherein the symmetric key of each layer of nodes is first encrypted using asymmetric encryption RSA, and then the message encrypted by asymmetric encryption RSA is encrypted using symmetric encryption AES to obtain an encrypted message. The expression is as follows: In the above formula, K i For node n i The symmetric encryption key K is used by RSA i encryption; Indicates the encryption operation on the node; Step 3: The obfuscation node decrypts the message layer by layer along path P. The expression is as follows: In the above formula, Indicates that in the confusion node n i Encrypted message decryption operation, RSA-1 is an asymmetric decryption operation, AES -1 It is a symmetric decryption operation; Step 4: When the queue load Q of the obfuscation node satisfies Q>T, the message is forwarded to the edge server for processing, where T is the preset threshold; Step 5: Record the decryption delay τ of each layer i and network transmission delay δ i , the final total delay Δ is: Confusion node n i The delay is described by the following model: t i =a*log(Q i )+b; Among them, Q i is the number of messages in the node queue, α and β are network configuration parameters; The total message decryption delay τ of the edge server e satisfy: Among them, M num is the number of messages processed simultaneously by the edge server, τ e，j Decryption time of a single message.

2. According to claim 1, the message encryption routing method based on mixnet layered network and edge computing is characterized in that: The recursive process of layer-by-layer encryption and layer-by-layer encryption and decryption in step 2 and step 3 satisfies the following conditions: The key K of each layer i All are randomly generated, satisfying: H(K i )≈U(0,1); H is the entropy function, U(0,1) represents uniform distribution; The size of the encrypted message is: S = S M +L*(S K +S padding ); Among them, S M is the original message size, S K is the encryption key size, S padding The size of the padding data.

3. The message encryption routing method based on mixnet layered network and edge computing according to claim 1 is characterized in that: The probability that the user chooses path P in step 1 satisfies the following conditions: Node n in the path i The probability of being selected P(n i )for: Among them, N i is the total number of nodes in the i-th layer; The overall privacy of path P satisfies: Among them, I(P) represents the entropy of the path, log(P(n i ))The information entropy of each layer of nodes being selected, The accumulation of all layers of the path represents the total information entropy.

4. The message encryption routing method based on mixnet layered network and edge computing according to claim 1 is characterized in that: In step 5, the total delay Δ is used as the system optimization index, and the optimization objective function is: Performance optimization is achieved by adjusting the number of network layers L, the number of nodes per layer N, the threshold T and the path selection algorithm; Total edge server decryption delay τ e is the decryption delay τ of some nodes i When a hybrid node forwards tasks to an edge server due to overload, its τ i is replaced by τ e , indicating that the delay of this node is transferred to the edge server.

5. A system for implementing the message encryption routing method based on mixnet layered network and edge computing as described in any one of claims 1 to 4, characterized in that: Involving users, hierarchical network topology, obfuscation nodes and edge servers; the hierarchical network topology includes L layers of networks, and the number of nodes in each layer of the network is N; the user selects a path P and encrypts the original message M layer by layer; the obfuscation node decrypts the message layer by layer and calculates the delay τ at the same time i , and forward the message to the edge server when Q>T; the edge server decrypts the message using the public key and private key, and records the total delay τ e .

Images