Method and system for electronic document encryption exchange based on multiple exchange nodes

Abstract

The present invention discloses a method and system for encrypting and exchanging electronic documents for multiple exchange nodes, comprising the following steps: S1, constructing an official document exchange environment, configuring multiple exchange nodes, deploying core modules, and initializing key management and trust evaluation; S2, splitting keys using a verifiable hybrid secret sharing mechanism, and distributing and storing them after protection through homomorphic encryption; S3, evaluating node reputation based on a trust model, and generating exchange paths in combination with Bayesian optimization; S4, executing a multi-party key exchange protocol based on the exchange path; S5, optimizing the official document transmission path based on the exchange path and the key exchange result; S6, dynamically managing access rights based on the initialized key management strategy and trust value; S7, monitoring the exchange process, detecting abnormal traffic, and optimizing protection strategies. The present invention achieves secure and rapid transmission of official documents between multiple exchange nodes through an official document encryption exchange method based on dynamic trust evaluation and path optimization, thereby improving the security and efficiency of the system.

Description

Technical Field

[0001] The present invention relates to the field of information security technology, and in particular to a method and system for encrypting and exchanging electronic documents for multiple exchange nodes. Background Art

[0002] With the advancement of information technology, the transmission and exchange of electronic documents has become an indispensable part of modern office and government management. Electronic documents not only save paper and labor costs, but also improve work efficiency and information processing speed. Ensuring the security, integrity, and traceability of electronic documents is crucial. This demand has spawned a number of related technologies, particularly document encryption, access control, and node trust assessment, designed to safeguard the data security of electronic documents during transmission. However, existing document exchange technologies still present some significant challenges.

[0003] Currently, many traditional electronic document exchange systems use symmetric encryption algorithms or public-key cryptography-based encryption algorithms for encryption and key management. These methods can ensure data confidentiality to a certain extent. However, these traditional encryption methods often face security risks in key management and key exchange. For example, in symmetric encryption systems, key distribution and storage are particularly problematic. If the key is leaked or maliciously tampered with, the security of the entire system will be compromised. In encryption methods based on public-key cryptography, while public key exchange protocols can theoretically ensure secure key exchange, in practice, efficient and secure exchange of document keys between multiple exchange nodes remains a complex issue. Most existing technologies fail to fully consider the balance between security and efficiency in the key exchange process. Especially in scenarios with numerous nodes and complex network topologies, ensuring the trustworthiness of each node and the accuracy of the key remains a worthy research issue.

[0004] In addition to the challenges of key exchange and management, path optimization during electronic document exchange is also a key issue. Existing technologies mostly rely on static paths or simple path selection algorithms based on network bandwidth, failing to account for dynamic changes in the network environment and fluctuations in trust between nodes. In actual document exchange, factors such as the quality of communication between nodes, node reputation, and network latency all affect the efficiency and security of data transmission. Existing path selection algorithms often fail to evaluate node trust and network latency in real time, resulting in low document transmission efficiency in multi-node, large-scale network environments and susceptibility to attacks from malicious nodes or man-in-the-middle attacks. Therefore, how to dynamically select the optimal transmission path based on the real-time trust of nodes and changes in the network environment has become a technical challenge that needs to be solved urgently.

[0005] In addition, current electronic document exchange systems also have some flaws in access control. Traditional access control strategies are often based on static permission settings, ignoring the dynamic changes in node behavior. In practical applications, the reputation of a node may change over time, and attackers may bypass access control by forging identities or other malicious means. Therefore, how to adjust access rights in real time based on the dynamic reputation of the node and the optimization results of the document transmission path is an urgent problem to be solved in current electronic document exchange technology. Existing access control methods generally fail to fully consider the dynamic changes in node reputation and changes in network topology, resulting in weak access control capabilities of the system and vulnerability to internal and external security threats.

[0006] Therefore, how to provide an encrypted exchange method and system for electronic documents for multiple exchange nodes is an urgent problem that needs to be solved by those skilled in the art. Summary of the Invention

[0007] One objective of the present invention is to provide a method and system for encrypted electronic document exchange across multiple exchange nodes. This method leverages a verifiable hybrid secret sharing mechanism, a node reputation assessment model, a dynamic path optimization algorithm, and a multi-level access control strategy, detailing a technical solution for enabling secure and rapid document exchange across multiple exchange nodes. This solution effectively addresses existing technical deficiencies in key management, path selection, and access control, offering the advantages of high security, efficiency, traceability, and flexibility.

[0008] The method for encrypted exchange of electronic documents for multiple exchange nodes according to an embodiment of the present invention includes the following steps:

[0009] S1. Build a document exchange environment, configure multiple exchange nodes, deploy core modules, and initialize key management strategies and trust assessment models;

[0010] S2, using a verifiable hybrid secret sharing mechanism to split the key, and then distribute it after protecting it with homomorphic encryption;

[0011] S3. Before exchanging official documents, evaluate the node reputation based on the trust evaluation model, calculate the trust value with Bayesian optimization, and generate the exchange path;

[0012] S4. Based on the exchange path, perform key exchange using a multi-party secure key exchange protocol based on verifiable secret negotiation;

[0013] S5. Based on the exchange path and key exchange results, adaptive topology-aware routing optimization is used to dynamically adjust the document transmission path;

[0014] S6. Based on the initialized key management policy and trust value, a dynamic verifiable storage mapping mechanism is used to manage access rights.

[0015] S7. During the exchange of official documents, detect abnormal traffic and optimize security protection strategies based on official document transmission records.

[0016] Optionally, the S2 specifically includes:

[0017] S21. Let the official document data be D. Use the encryption algorithm based on polymorphic pseudo-random permutation to generate the key K. Encrypt the official document data to obtain the encrypted official document data D. ′ :

[0018]

[0019] Where H(D) is the hash value of the document data, PRG(s) is the pseudo-random stream, mod is the modular operation, λ is the key bit length, and ⊕ is the exclusive-OR operation;

[0020] S22, using a verifiable hybrid secret sharing mechanism to split the key K, setting a threshold secret sharing scheme, splitting the key K into n key shares {K1, K2, ..., K n}:

[0021]

[0022] Among them, K i is the key share, K is the original key, H(i) is the hash value of index i, r i is the key randomization factor, g is the generator, x i is the shared index, L is a large prime number, t is the total number of keys, L i is the interpolation coefficient, i is the key index;

[0023] S23. Perform homomorphic encryption on the key share. The homomorphic encryption function is E h (·), using the exponential homomorphic encryption method, the key share is encrypted as follows:

[0024]

[0025] Among them, H(K i ) is the hash value of the key share, E h (K i ) is the key share K i The result after homomorphic encryption;

[0026] S24. Generate key share verification information and construct verification parameter V using zero-knowledge proof i :

[0027]

[0028] Among them, H is a secure hash function, h is a secure base, ξi is the random challenge value;

[0029] S25. Distribute and store the encrypted key share and the corresponding key share verification information to multiple switching nodes.

[0030] Optionally, the S3 specifically includes:

[0031] S31, let the set of switching nodes be N={N1,N2,…,N m}, for each node N i Collect its original behavior data to form the feature vector X i =[x i1 ,x i2 ,…,x id ] T , using adaptive normalization to generate enhanced feature vectors:

[0032]

[0033] Among them, μ X is the mean vector, σ X is the standard deviation vector, Y i For node N i Enhanced feature vectors;

[0034] S32. Use graph convolutional network combined with self-attention mechanism to calculate the initial trust score T of each node i :

[0035]

[0036] Among them, T i is the initial trust score of the node, α is the activation function, W is the weight matrix, b is the bias term, ln is the logarithmic function, exp is the exponential function, W a is the self-attention weight matrix, Y j For node N j The enhanced feature vector of , m is the total number of exchange nodes, j is the exchange node index;

[0037] S33, based on Bayesian optimization, update the initial trust score to obtain the trust value

[0038]

[0039] Among them, μ 0,i is the prior mean of the node, ω i is the Bayesian optimization coefficient, is the prior variance of the node, is the observation variance of the node;

[0040] S34, construct a candidate exchange path set ρ, and based on the trust value Select the switching path P, where the candidate path satisfy:

[0041]

[0042] Where k is the number of nodes in the path, δ is the weight factor, For nodes The trust value, For nodes and The network delay between P'∈ρ To select the path P' that minimizes the following objective function from the candidate path set ρ;

[0043] S35. Output trust score vector and the selected switching path P.

[0044] Optionally, the S4 specifically includes:

[0045] S41, based on the generated switching path Key exchange is performed using a multi-party secure key exchange protocol based on verifiable secret negotiation;

[0046] S42, set the secure communication between nodes to C = {C i,j}, where each pair of adjacent nodes The key exchange process between i,j , using the following key exchange process:

[0047]

[0048] Among them, C i,j is the key exchange communication result, VSA-MPKE is a multi-party secure key exchange protocol based on verifiable secret negotiation, For nodes Encryption key share The ciphertext obtained by homomorphic encryption method is For nodes Encryption key share The ciphertext obtained by homomorphic encryption method, γ i,j is the communication key agreement protocol, δ i,j is the dynamic key enhancement factor;

[0049] S43. After the key exchange is completed, the node With node Verify the validity of the key exchange by:

[0050]

[0051] Among them, V i,j For nodes and The key exchange verification parameter between them, H is the hash function;

[0052] S44, using the key fusion method based on node reputation weighting, after the key exchange on all paths is completed, the key exchange result K is calculated by the following formula final :

[0053]

[0054] Where k is the number of nodes in the path, For nodes The reputation weighting coefficient, mod is the modular operation, and L is a large prime number;

[0055] S45. Distribute the generated key exchange result to each exchange node through a distributed key distribution protocol.

[0056] Optionally, the S5 specifically includes:

[0057] S51, according to the switching path and key exchange result K final , initialize the routing optimization model and assign initial transmission parameters to each node in the document transmission path in For nodes The routing parameter vector of

[0058] S52, using adaptive topology-aware routing optimization algorithm, based on the trust value of the node and network latency Dynamically adjust the document transmission path and calculate the nodes With node Routing parameters between:

[0059]

[0060] in, For nodes Updated routing parameters, ε is the weight factor, d max is the maximum value of network delay, For nodes Trust value;

[0061] S53, routing parameters for each document transmission path node Update and calculate the globally optimized document transmission path P opt, the weighted sum of the total transmission delay and the trust difference between nodes is minimized by the following optimization objective function:

[0062]

[0063] in, For nodes Trust value, argmin P'∈P To find the path P' that minimizes the objective function in the path set ρ, k is the number of nodes in the path;

[0064] S54. Based on the optimized document transmission path, dynamically adjust the data flow between nodes and calculate the total bandwidth requirement of each path. Data traffic is scheduled according to network bandwidth constraints, using an adaptive traffic allocation algorithm based on trust and delay weighting:

[0065]

[0066] in, For nodes The trust value of , ε is the weight factor;

[0067] S55, output the optimal document transmission path P opt and route parameters

[0068] Optionally, the S6 specifically includes:

[0069] S61, according to the initialized key management policy and the generated trust value Adopt dynamic adaptive multi-level access control mechanism for each switching node Generate access rights data And perform hierarchical management of node access;

[0070] S62. Define the access permission vector of each node as in Representation node The mth access level in path P;

[0071] S63, based on the trust value and path optimization result P opt , using a dynamic permission adjustment method based on node reputation weighting to dynamically adjust access rights between nodes:

[0072]

[0073] in, For nodes The final access permission vector, θ is the reputation weighting coefficient, For nodes The change in reputation, k is the number of nodes in the path, and j is the node index;

[0074] S64. Generate an encrypted access control list based on the final access rights through a multi-factor authentication mechanism:

[0075]

[0076] in, is the access control list of the node, The final access rights of the node are obtained through the homomorphic encryption function E h (·) The result after encryption, The final access right of the node is generated by the hash message authentication code. The result of the encrypted processing of the private information retrieval for the node's access rights;

[0077] S65, distribute and store the encrypted access control list to each exchange node, and use the access record evidence mechanism based on blockchain technology and the multi-level trusted computing platform to verify whether the document transmission process meets the authority requirements. If the node Access rights If the conditions are met, the node is allowed to participate in the document exchange; otherwise, participation is denied and a security alert is triggered.

[0078] The electronic document encryption exchange system for multiple exchange nodes according to an embodiment of the present invention includes the following modules:

[0079] Key management module, used to generate, manage and distribute the keys required for document encryption;

[0080] Trust evaluation module, which is used to evaluate the reputation of each exchange node, calculate the node's trust value based on historical behavior data, and dynamically adjust path selection;

[0081] Key exchange module, used to implement secure key exchange protocol;

[0082] The path optimization module is used to dynamically select the optimal document transmission path based on trust value and network delay to optimize transmission efficiency;

[0083] Access control module, used to assign appropriate access rights to each switching node based on node reputation and path optimization results;

[0084] Data encryption module, used to encrypt official documents;

[0085] The anomaly detection module is used to monitor abnormal behavior during document transmission and optimize protection strategies.

[0086] The beneficial effects of the present invention are:

[0087] This invention introduces a method for electronic document encryption and exchange based on dynamic trust assessment and path optimization, effectively addressing existing issues in key management, path selection, and access control. First, by employing a verifiable hybrid secret sharing mechanism and homomorphic encryption technology, it ensures the secure exchange of document encryption keys, avoiding potential security risks associated with traditional key management and exchange. Compared to existing single encryption schemes, this invention enables secure and efficient key transmission between multiple nodes, thereby improving the security and efficiency of document transmission.

[0088] Secondly, the adoption of node reputation assessment and dynamic path optimization overcomes the limitations of existing path selection methods in multi-node, complex network environments. Traditional technologies often rely on static path selection or simple bandwidth-based algorithms. This invention, by introducing dynamic evaluation that modifies trust values ​​and network latency, optimizes document transmission paths in real time, ensuring efficient document transmission under changing network conditions. Furthermore, by adjusting access permissions based on node trust, the system can respond to threats from malicious nodes in real time, enhancing its anti-attack capabilities.

[0089] Furthermore, the blockchain-based access record storage mechanism makes all access and operation records traceable, increasing the transparency and auditability of the system. Compared with existing technologies, this invention not only ensures the confidentiality and integrity of data during exchange, but also enhances the transparency and traceability of document exchanges, effectively preventing data tampering and unauthorized access.

[0090] In general, this invention overcomes the security, efficiency, and scalability issues of traditional electronic document exchange systems by introducing advanced technologies such as dynamic trust evaluation, path optimization, encrypted storage, and blockchain evidence storage, and has high innovation and practical application value. BRIEF DESCRIPTION OF THE DRAWINGS

[0091] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings:

[0092] Figure 1 This is a flow chart of the electronic document encryption exchange method for multiple exchange nodes proposed by the present invention;

[0093] Figure 2 This is a schematic diagram of the structure of the electronic document encryption exchange system for multiple exchange nodes proposed by the present invention. DETAILED DESCRIPTION

[0094] The present invention will now be described in further detail with reference to the accompanying drawings, which are simplified schematic diagrams that illustrate the basic structure of the present invention in a schematic manner.

[0095] refer to Figure 1 The method for exchanging electronic documents encrypted by multiple exchange nodes includes the following steps:

[0096] S1. Build a document exchange environment, configure multiple exchange nodes, deploy core modules, and initialize key management strategies and trust assessment models;

[0097] S2, using a verifiable hybrid secret sharing mechanism to split the key, and then distribute it after protecting it with homomorphic encryption;

[0098] S3. Before exchanging official documents, evaluate the node reputation based on the trust evaluation model, calculate the trust value with Bayesian optimization, and generate the exchange path;

[0099] S4. Based on the exchange path, perform key exchange using a multi-party secure key exchange protocol based on verifiable secret negotiation;

[0100] S5. Based on the exchange path and key exchange results, adaptive topology-aware routing optimization is used to dynamically adjust the document transmission path;

[0101] S6. Based on the initialized key management policy and trust value, a dynamic verifiable storage mapping mechanism is used to manage access rights.

[0102] S7. During the exchange of official documents, detect abnormal traffic and optimize security protection strategies based on official document transmission records.

[0103] In this embodiment, S2 specifically includes:

[0104] S21. Let the official document data be D. Use the encryption algorithm based on polymorphic pseudo-random permutation to generate the key K. Encrypt the official document data to obtain the encrypted official document data D. ′ :

[0105]

[0106] Where H(D) is the hash value of the document data, PRG(s) is the pseudo-random stream, mod is the modular operation, λ is the key bit length, and ⊕ is the exclusive-OR operation;

[0107] S22, using a verifiable hybrid secret sharing mechanism to split the key K, setting a threshold secret sharing scheme, splitting the key K into n key shares {K1, K2, ..., K n}:

[0108]

[0109] Among them, K i is the key share, K is the original key, H(i) is the hash value of index i, r i is the key randomization factor, g is the generator, x i is the shared index, L is a large prime number, t is the total number of keys, L i is the interpolation coefficient, i is the key index;

[0110] S23. Perform homomorphic encryption on the key share. The homomorphic encryption function is E h (·), using the exponential homomorphic encryption method, the key share is encrypted as follows:

[0111]

[0112] Among them, H(K i ) is the hash value of the key share, E h (K i ) is the key share K i The result after homomorphic encryption;

[0113] S24. Generate key share verification information and construct verification parameter V using zero-knowledge proof i :

[0114]

[0115] Among them, H is a secure hash function, h is a secure base, ξ i is the random challenge value;

[0116] S25. Distribute and store the encrypted key share and the corresponding key share verification information to multiple switching nodes.

[0117] In this embodiment, S3 specifically includes:

[0118] S31, let the set of switching nodes be N={N1,N2,…,N m}, for each node N i Collect its original behavior data to form the feature vector X i =[x i1 ,x i2 ,…,x id ] T , using adaptive normalization to generate enhanced feature vectors:

[0119]

[0120] Among them, μ X is the mean vector, σ X is the standard deviation vector, Y i For node Ni Enhanced feature vectors;

[0121] S32. Use graph convolutional network combined with self-attention mechanism to calculate the initial trust score T of each node i :

[0122]

[0123] Among them, T i is the initial trust score of the node, α is the activation function, W is the weight matrix, b is the bias term, ln is the logarithmic function, exp is the exponential function, W a is the self-attention weight matrix, Y j For node N j The enhanced feature vector of , m is the total number of exchange nodes, j is the exchange node index;

[0124] S33, based on Bayesian optimization, update the initial trust score to obtain the trust value

[0125]

[0126] Among them, μ 0,i is the prior mean of the node, ω i is the Bayesian optimization coefficient, is the prior variance of the node, is the observation variance of the node;

[0127] S34, construct a candidate exchange path set ρ, and based on the trust value Select the switching path P, where the candidate path satisfy:

[0128]

[0129] Where k is the number of nodes in the path, δ is the weight factor, For nodes The trust value, For nodes and The network delay between P'∈ρ To select the path P' that minimizes the following objective function from the candidate path set ρ;

[0130] S35. Output trust score vector and the selected switching path P.

[0131] In this embodiment, the S4 specifically includes:

[0132] S41, based on the generated switching path Key exchange is performed using a multi-party secure key exchange protocol based on verifiable secret negotiation;

[0133] S42, set the secure communication between nodes to C = {C i,j}, where each pair of adjacent nodes The key exchange process between i,j , using the following key exchange process:

[0134]

[0135] Among them, C i,j is the key exchange communication result, VSA-MPKE is a multi-party secure key exchange protocol based on verifiable secret negotiation, For nodes Encryption key share The ciphertext obtained by homomorphic encryption method is For nodes Encryption key share The ciphertext obtained by homomorphic encryption method, γ i,j is the communication key agreement protocol, δ i,j is the dynamic key enhancement factor;

[0136] S43. After the key exchange is completed, the node With node Verify the validity of the key exchange by:

[0137]

[0138] Among them, V i,j For nodes and The key exchange verification parameter between them, H is the hash function;

[0139] S44, using the key fusion method based on node reputation weighting, after the key exchange on all paths is completed, the key exchange result K is calculated by the following formula final :

[0140]

[0141] Where k is the number of nodes in the path, For nodes The reputation weighting coefficient, mod is the modular operation, and L is a large prime number;

[0142] S45. Distribute the generated key exchange result to each exchange node through a distributed key distribution protocol.

[0143] In this embodiment, the S5 specifically includes:

[0144] S51, according to the switching path and key exchange result K final , initialize the routing optimization model and assign initial transmission parameters to each node in the document transmission path in For nodes The routing parameter vector of

[0145] S52, using adaptive topology-aware routing optimization algorithm, based on the trust value of the node and network latency Dynamically adjust the document transmission path and calculate the nodes With node Routing parameters between:

[0146]

[0147] in, For nodes Updated routing parameters, ε is the weight factor, d max is the maximum value of network delay, For nodes Trust value;

[0148] S53, routing parameters for each document transmission path node Update and calculate the globally optimized document transmission path P opt , the weighted sum of the total transmission delay and the trust difference between nodes is minimized by the following optimization objective function:

[0149]

[0150] in, For nodes Trust value, argmin P'∈P To find the path P' that minimizes the objective function in the path set ρ, k is the number of nodes in the path;

[0151] S54. Based on the optimized document transmission path, dynamically adjust the data flow between nodes and calculate the total bandwidth requirement of each path. Data traffic is scheduled according to network bandwidth constraints, using an adaptive traffic allocation algorithm based on trust and delay weighting:

[0152]

[0153] in, For nodes The trust value of , ε is the weight factor;

[0154] S55, output the optimal document transmission path P opt and route parameters

[0155] In this embodiment, S6 specifically includes:

[0156] S61, according to the initialized key management policy and the generated trust value Adopt dynamic adaptive multi-level access control mechanism for each switching node Generate access rights data And perform hierarchical management of node access;

[0157] S62. Define the access permission vector of each node as in Representation node The mth access level in path P;

[0158] S63, based on the trust value and path optimization result P opt , using a dynamic permission adjustment method based on node reputation weighting to dynamically adjust access rights between nodes:

[0159]

[0160] in, For nodes The final access permission vector, θ is the reputation weighting coefficient, For nodes The change in reputation, k is the number of nodes in the path, and j is the node index;

[0161] S64. Generate an encrypted access control list based on the final access rights through a multi-factor authentication mechanism:

[0162]

[0163] in, is the access control list of the node, The final access rights of the node are obtained through the homomorphic encryption function E h (·) The result after encryption, The final access right of the node is generated by the hash message authentication code. The result of the encrypted processing of the private information retrieval for the node's access rights;

[0164] S65, distribute and store the encrypted access control list to each exchange node, and use the access record evidence mechanism based on blockchain technology and the multi-level trusted computing platform to verify whether the document transmission process meets the authority requirements. If the node Access rights If the conditions are met, the node is allowed to participate in the document exchange; otherwise, participation is denied and a security alert is triggered.

[0165] refer to Figure 2 , an electronic document encryption exchange system for multiple exchange nodes, including the following modules:

[0166] Key management module, used to generate, manage and distribute the keys required for document encryption;

[0167] Trust evaluation module, which is used to evaluate the reputation of each exchange node, calculate the node's trust value based on historical behavior data, and dynamically adjust path selection;

[0168] Key exchange module, used to implement secure key exchange protocol;

[0169] The path optimization module is used to dynamically select the optimal document transmission path based on trust value and network delay to optimize transmission efficiency;

[0170] Access control module, used to assign appropriate access rights to each switching node based on node reputation and path optimization results;

[0171] Data encryption module, used to encrypt official documents;

[0172] The anomaly detection module is used to monitor abnormal behavior during document transmission and optimize protection strategies.

[0173] Example 1:

[0174] In order to verify the feasibility of the present invention in implementation, the present invention was applied to the electronic document exchange system of a certain government department. The system in the scenario adopted an electronic document encryption exchange method based on dynamic trust evaluation and path optimization, and made full use of modules such as key management, trust evaluation, path optimization, and access control.

[0175] Within a government department, the exchange of electronic documents involves a large amount of sensitive data, often requiring transmission between multiple departments and units. Due to the unique nature of government documents, the confidentiality, integrity, and timeliness of data transmission must be considered during the exchange process. Traditional electronic document exchange systems typically rely on fixed paths and static access control mechanisms, facing the following challenges: 1) The selection of document transmission paths fails to take into account dynamic network changes in real time, resulting in inefficiencies; 2) Node trust is not promptly assessed and dynamically adjusted, and malicious nodes may compromise system security; 3) The exchange and storage of keys carries potential risks of leakage, making it difficult to ensure the secure transmission of encrypted data between multiple nodes.

[0176] To address these issues, the present invention applies the technology to introduce a document exchange solution based on dynamic trust evaluation and path optimization, and makes the following improvements:

[0177] First, the encryption module employs a verifiable hybrid secret sharing mechanism and homomorphic encryption technology to encrypt official document data. During the key exchange process, the system selects the optimal path for document exchange based on the reputation of each exchange node and real-time network latency. Specifically, during inter-node key exchange, the system dynamically selects the key exchange path based on node reputation predictions and network latency, ensuring secure key transfer. This approach improves key exchange efficiency by approximately 20%. Furthermore, due to node reputation assessment, the system prevents malicious nodes from participating, thereby enhancing the security of document exchange.

[0178] Regarding trust assessment, the system dynamically calculates the reputation of each node using a graph convolutional network and a Bayesian optimization algorithm. Node reputation is not only based on historical behavioral data but also adjusted in real time based on factors such as network latency and node response time. This allows the system to automatically adjust access permissions and path selection based on node behavior, ensuring the security and efficiency of data transmission. In a real-world test, using this trust assessment mechanism improved node trustworthiness assessment accuracy by approximately 30%, effectively reducing the threat posed by malicious nodes to system security.

[0179] Furthermore, the path optimization module employs a dynamic path adjustment algorithm, taking into account network latency and node trust variations to dynamically select the optimal path. This optimization significantly reduces document transmission time. In tests, document transmission time was reduced by approximately 25% compared to traditional static path selection. For example, the time it takes to transmit a document from one department to another was reduced from 12 minutes to 9 minutes, significantly improving document transmission efficiency.

[0180] Regarding access control, the system employs a multi-level access control strategy, dynamically assigning access rights to each exchange node based on its reputation. This control not only relies on static permission settings but also adjusts permissions in real time based on changes in node reputation. In testing, the system's access control accuracy improved by approximately 40%, effectively preventing unauthorized nodes from accessing official document data and ensuring system security.

[0181] In terms of data storage and management, all access control information and transmission records are recorded using blockchain technology. This technology ensures the traceability of access rights to official documents. All operations and records are encrypted and stored on the blockchain, preventing data tampering and unauthorized access. This not only improves the transparency of the system but also increases its credibility.

[0182] Table 1 Performance improvement data of electronic document exchange system

[0183]

[0184] According to the data analysis in the table, after adopting the technology of the present invention, the official document exchange system has shown significant improvements in many aspects.

[0185] First, document transmission time was reduced from 12 minutes in the traditional solution to 9 minutes, a -25% improvement, demonstrating the significant improvements in path optimization and key exchange efficiency achieved by this method. Second, the accuracy of node reputation assessment increased by 30%, from 70% in the traditional solution to 95%, demonstrating significant progress in the accuracy of reputation assessment. Furthermore, the malicious node identification rate increased from 60% in the traditional solution to 98%, a +38% improvement, effectively enhancing system security.

[0186] In terms of encryption key exchange efficiency, this invention shortens key exchange time from the traditional 15 seconds to 12 seconds, a -20% improvement, optimizing data exchange speed. Furthermore, access control accuracy is increased from the traditional 65% to 90%, a +40% improvement, further strengthening access control during document exchange.

[0187] Finally, the tampering detection rate in data transmission has increased by 44%, from the traditional 55% to 99%, effectively ensuring the integrity and security of data transmission.

[0188] In summary, the present invention improves the efficiency and security of document exchange and significantly optimizes system performance by introducing multiple innovative technologies.

[0189] The above description is only a preferred specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any technician familiar with the technical field, within the technical scope disclosed by the present invention, who makes equivalent replacements or changes based on the technical solution and inventive concept of the present invention, should be covered by the scope of protection of the present invention.

Claims

1. A method for exchanging electronic documents encrypted by multiple exchange nodes, characterized in that: The steps include: S1. Build a document exchange environment, configure multiple exchange nodes, deploy core modules, and initialize key management strategies and trust assessment models; S2, using a verifiable hybrid secret sharing mechanism to split the key, and then distribute it after protecting it with homomorphic encryption; S3. Before exchanging official documents, evaluate the node reputation based on the trust evaluation model, calculate the trust value with Bayesian optimization, and generate the exchange path; S4. Based on the exchange path, perform key exchange using a multi-party secure key exchange protocol based on verifiable secret negotiation; S5. Based on the exchange path and key exchange results, adaptive topology-aware routing optimization is used to dynamically adjust the document transmission path; S6. Manage access rights using a dynamic verifiable storage mapping mechanism based on the initialized key management policy and trust value; S7. During the exchange of official documents, detect abnormal traffic and optimize security protection strategies based on official document transmission records; The S3 includes the following steps: S31. Let the set of switching nodes be , for each node Collect its original behavior data to form a feature vector , using adaptive normalization to generate enhanced feature vectors: ； in, is the mean vector, is the standard deviation vector, For nodes Enhanced feature vectors; S32. Use graph convolutional network combined with self-attention mechanism to calculate the initial trust score of each node : ； in, is the initial trust score of the node, is the activation function, is the weight matrix, is the bias term, is a logarithmic function, is an exponential function, is the self-attention weight matrix, For nodes The enhanced feature vector of is the total number of exchange nodes, j is the exchange node index; S33, based on Bayesian optimization, update the initial trust score to obtain the trust value : ； ； in, is the prior mean of the node, is the Bayesian optimization coefficient, is the prior variance of the node, is the observation variance of the node; S34. Construct a set of candidate switching paths , and based on the trust value Select the switching path , where the candidate path satisfy: ； in, is the number of nodes in the path, is the weight factor, For nodes The trust value, For nodes and The network delay between In the candidate path set In the example, we select the path that minimizes the objective function that follows. ; S35. Output trust score vector and the selected switching path .

2. The method for electronic document encryption exchange for multiple exchange nodes according to claim 1, characterized in that: The S2 specifically includes: S21. Let the document data be D. Use the encryption algorithm based on polymorphic pseudo-random permutation to generate the key K. Encrypt the document data to obtain the encrypted document data : ； in, is the hash value of the document data, is a pseudo-random stream, is a modular operation, is the key length, is the exclusive OR operation; S22. Use a verifiable hybrid secret sharing mechanism to split the key K, set a threshold secret sharing scheme, and split the key K into n key shares. : ； ； in, is the key share, is the original key, is the hash value of index i, is the key randomization factor, is the generator, For shared indexes, is a large prime number, is the total number of keys, is the interpolation coefficient, i is the key index; S23. Perform homomorphic encryption on the key share. The homomorphic encryption function is: , using the exponential homomorphic encryption method, the key share is encrypted as follows: ； in, is the hash value of the key share, For the key share The result after homomorphic encryption; S24. Generate key share verification information and construct verification parameters using zero-knowledge proof : ； in, is a secure hash function, For the safety base, is the random challenge value; S25. Distribute and store the encrypted key share and the corresponding key share verification information to multiple switching nodes.

3. The method for encrypted exchange of electronic documents for multiple exchange nodes according to claim 1, characterized in that: The S4 specifically includes: S41. Based on the generated switching path ,key exchange is performed using a multi-party secure key exchange protocol based on verifiable secret negotiation; S42, set the secure communication between nodes to , where each pair of adjacent nodes The key exchange process between , using the following key exchange process: ； in, is the key exchange communication result, It is a multi-party secure key exchange protocol based on verifiable secret negotiation. For nodes Encryption key share The ciphertext obtained by homomorphic encryption method is For nodes Encryption key share The ciphertext obtained by homomorphic encryption method is For the communication key negotiation protocol, is the dynamic key enhancement factor; S43. After the key exchange is completed, the node With node Verify the validity of the key exchange by: ； in, For nodes and The key exchange verification parameters between is a hash function; S44. Using a key fusion method based on node reputation weighting, after the key exchange on all paths is completed, the key exchange result is calculated using the following formula : ； in, is the number of nodes in the path, For nodes The reputation weighting coefficient of is a modular operation, is a large prime number; S45. Distribute the generated key exchange result to each exchange node through a distributed key distribution protocol.

4. The method for encrypted exchange of electronic documents for multiple exchange nodes according to claim 1, characterized in that: The S5 specifically includes: S51, according to the switching path and key exchange results , initialize the routing optimization model and assign initial transmission parameters to each node in the document transmission path ,in For nodes The routing parameter vector of S52, using adaptive topology-aware routing optimization algorithm, based on the trust value of the node and network latency Dynamically adjust the document transmission path and calculate the nodes With node Routing parameters between: ； in, For nodes Updated routing parameters, is the weight factor, is the maximum value of network delay, For nodes Trust value; S53, routing parameters for each document transmission path node Update and calculate the globally optimized document transmission path , the weighted sum of the total transmission delay and the trust difference between nodes is minimized by the following optimization objective function: ； in, For nodes The trust value, For the path collection Find the path that minimizes the objective function , is the number of nodes in the path; S54. Based on the optimized document transmission path, dynamically adjust the data flow between nodes and calculate the total bandwidth requirement of each path. , and performs data traffic scheduling according to network bandwidth constraints, using an adaptive traffic allocation algorithm based on trust and delay weighting: ； in, For nodes The trust value, is the weight factor; S55, output the optimal document transmission path and route parameters .

5. The method for encrypted exchange of electronic documents for multiple exchange nodes according to claim 1, characterized in that: The S6 specifically includes: S61, according to the initialized key management policy and the generated trust value , using a dynamic adaptive multi-level access control mechanism for each switching node Generate access rights data , and perform hierarchical management of node access; S62. Define the access permission vector of each node as ,in Representation node The mth access level in path P; S63. Optimize results based on trust value and path , using a dynamic permission adjustment method based on node reputation weighting to dynamically adjust access rights between nodes: ； in, For nodes The final access permission vector of is the reputation weighting coefficient, For nodes The change in reputation, is the number of nodes in the path, j is the node index; S64. Generate an encrypted access control list based on the final access rights through a multi-factor authentication mechanism: ； in, is the access control list of the node, The final access rights of the node are encrypted by a homomorphic encryption function The encrypted result is The final access right of the node is generated by the hash message authentication code. The result of the encrypted processing of the private information retrieval for the node's access rights; S65, distribute and store the encrypted access control list to each exchange node, and use the access record evidence mechanism based on blockchain technology and the multi-level trusted computing platform to verify whether the document transmission process meets the authority requirements. If the node Access rights If the conditions are met, the node is allowed to participate in the document exchange; otherwise, participation is denied and a security alert is triggered.

6. An electronic document encryption exchange system for multiple exchange nodes, and an electronic document encryption exchange method for multiple exchange nodes according to any one of claims 1 to 5, characterized in that: Includes the following modules: Key management module, used to generate, manage and distribute the keys required for document encryption; Trust evaluation module, which is used to evaluate the reputation of each exchange node, calculate the node's trust value based on historical behavior data, and dynamically adjust path selection; Key exchange module, used to implement secure key exchange protocol; The path optimization module is used to dynamically select the optimal document transmission path based on trust value and network delay to optimize transmission efficiency; Access control module, used to assign appropriate access rights to each switching node based on node reputation and path optimization results; Data encryption module, used to encrypt official documents; The anomaly detection module is used to monitor abnormal behavior during document transmission and optimize protection strategies.

Images