Multi-link data security verification method based on homomorphic encryption and asymmetric encryption
By employing a multi-stage data security verification method combining homomorphic and asymmetric encryption, the issues of data privacy and security in multi-party communication are resolved. This method achieves privacy protection and efficient computation during multi-stage data transmission, ensuring the accuracy and integrity of the data.
Patent Information
- Application Number
- CN202510253281.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-03-05
- Publication Date
- 2026-05-15
- Estimated Expiration
- 2045-03-05
AI Technical Summary
In multi-party communication scenarios, how can we ensure that sensitive information is not leaked during data processing at each processing end, while ensuring that the final receiving end can accurately and completely receive the data, especially when traditional encryption technologies cannot effectively solve the privacy and security issues of multi-stage data verification?
A multi-stage data security verification method based on homomorphic encryption and asymmetric encryption is adopted. By generating a dynamically bound key, homomorphically encrypting the data, and performing ciphertext operations at each verification stage, data privacy is ensured, and the data is decrypted at the final receiving end.
It achieves data privacy protection and efficient computation during multi-stage data transmission, avoids data leakage in intermediate stages, ensures the accuracy and integrity of the final decrypted data, and improves the system's scalability and security.
Smart Images
Figure CN120034390B_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of information technology in the field of communications, and specifically relates to a multi-stage data security verification method based on homomorphic encryption and asymmetric encryption. Background Technology
[0002] In modern communication systems, the security, privacy, and authenticity of data transmission are of paramount importance. Especially in multi-party communication scenarios, how to achieve effective trust and verification among the data generating end, multiple processing ends, and data receiving end is an important issue in communication security.
[0003] While traditional encryption technologies can ensure data confidentiality, when data verification is involved in multiple stages, ensuring that sensitive information is not leaked during data processing at each stage and that the final receiving end can accurately and completely receive the data becomes an urgent problem to be solved.
[0004] For example, in communication scenarios where data needs to be verified by multiple processing terminals, and the information can only be sent to the data receiving terminal after one of the processing terminals has verified and processed the data, how to ensure that each processing terminal can only perform verification and processing operations and cannot obtain the data content, while ensuring that the final receiving terminal can correctly decrypt and receive the data, is an important technical challenge in the field of information security.
[0005] Homomorphic encryption, as a novel encryption method, features computation performed on encrypted data. Unlike traditional encryption algorithms, homomorphic encryption allows operations such as addition and multiplication to be performed on encrypted data without first decrypting it. This means that the processing end can still effectively operate on encrypted data even without access to the plaintext, thus protecting data privacy while ensuring the security of computation and processing.
[0006] The emergence of homomorphic encryption has significantly enhanced the protection of data privacy, especially in scenarios such as cloud computing and distributed computing, where the trade-off between data privacy and computational efficiency has been better balanced. For scenarios requiring verification and processing at multiple stages, homomorphic encryption provides a secure technical solution that can both guarantee data privacy and achieve necessary data processing and verification. It allows all parties to perform calculations and processing on the data without revealing the plaintext, and the final recipient can recover the original data through appropriate decryption operations.
[0007] However, the application of existing homomorphic encryption technology in multi-party verification and data transmission still faces certain technical challenges. For example, how to perform computations through layer-by-layer verification at multiple verification stages while maintaining data privacy, how to effectively prevent data leakage in intermediate stages during homomorphic encryption, and how to ensure that the finally decrypted data is accurate are all problems that need to be solved. Summary of the Invention
[0008] (a) Technical problems to be solved
[0009] The technical problem to be solved by this invention is to design a data security verification method that can achieve secure and efficient data transmission and verification while ensuring data privacy.
[0010] (II) Technical Solution
[0011] To address the aforementioned technical problems, this invention provides a multi-stage data security verification method based on homomorphic encryption and asymmetric encryption, comprising the following steps:
[0012] 1. The data generation end encrypts and verifies the information and the data to be sent.
[0013] Step 1: Generate a dynamic binding key
[0014] 11) The data generator first generates the raw data (Data) to be sent. This data is preprocessed and prepared for subsequent verification. The raw data is not encrypted. The data generator also obtains the public key (PK) of the data receiver. receiver ;
[0015] 12) Dynamic key derivation
[0016] Calculate the hash value of the data recipient's public key: H PK =SHA3 512 (PK receiver );
[0017] Generate initial homomorphic parameters n temp (For Paillier-safe prime product), encrypted as: C n =RSA-OAEP(PK) receiver ,n temp );
[0018] Generate the final homomorphic modulus as the dynamic key:
[0019] Step 2: Homomorphically encrypt the raw data to be sent.
[0020] 21) Using the dynamic modulus n, perform Paillier homomorphic encryption on Data to obtain the homomorphic ciphertext: C data=Enc Paillier (Data) = g Data ·r n mod n 2 g is the generator, providing homomorphic structure; r is the random number, providing randomness.
[0021] 22) Salinity formation:
[0022] For H PK and n temp Perform ECDSA signing and extract the first 128 bits as the salt value.
[0023]
[0024] 23) Data processing end verification information preparation
[0025] Encrypt a piece of verification data using the public key of the corresponding data processing terminal as verification information for the data processing terminal, which is used to identify which data processing terminal should process the data;
[0026] Step 3: Prepare and encrypt verification information
[0027] The data generator prepares to send the following data to the data processing end: dynamic homomorphic ciphertext, initial encryption modulus, hash value of the data receiver's public key, signature salt value, and verification information from the data processing end, which will be used to confirm the legitimacy of the data generator in subsequent verification steps.
[0028] Step 4: Send encrypted data and verification information
[0029] The data generator sends the encrypted homomorphic encrypted data and verification information together to the first verification stage;
[0030] 2. The data processing end performs data verification and processing.
[0031] Step 5: Receive encrypted data and parse verification information
[0032] After receiving the encrypted data, each verification step first decrypts the verification information and parses out the relevant verification data.
[0033] Step Six: Verify the validity of the data
[0034] Verify whether the Salt comes from a valid signature using the public key of the data generator:
[0035]
[0036] Verify whether the data generator is authorized and check whether the data has been tampered with or forged. If the verification fails, forward the data to other data processing terminals and return to step five. Only if the verification passes will the verification process continue to process the data.
[0037] Step 7: Perform calculations and processing on the ciphertext
[0038] After successful verification, the verification process verifies the encrypted data C. data Perform necessary calculations; all operations are performed in encrypted form.
[0039] Step 8: Forward the processed ciphertext
[0040] After verification and calculation, the ciphertext will be forwarded to the data receiving end. During this process, the verification process can only operate on the ciphertext and cannot access the plaintext.
[0041] 3. Data receiver decrypts ciphertext
[0042] Step Nine: Receive Ciphertext
[0043] The data receiver receives the homomorphic encrypted ciphertext from the verification process. Since the data receiver is the final recipient, it has the right to decrypt the ciphertext.
[0044] Step 10: Decrypt the ciphertext using the private key
[0045] 101) Restore the initial modulus:
[0046] Decrypt C using the private key n Get n temp ′:
[0047] n temp ′=RSA-OAEP-Decrypt(SK receiver C n )
[0048] 102) Reconstructing the homomorphic modulus:
[0049] Calculate the homomorphic modulus:
[0050]
[0051] H PK ′ is the public key hash value calculated by the data receiving end;
[0052] 103) Prime number verification:
[0053] Verify whether n′ is a valid Paillier modulus. It is considered valid if n′=p×q and p≡q≡3mod4.
[0054] 104) Layered Decryption and Auditing
[0055] Decrypting the homomorphic ciphertext yields:
[0056]
[0057] Where λ = lcm(p-1, q-1), L is the core function of the Paillier decryption algorithm, and C result This refers to the ciphertext received by the data receiver.
[0058] The present invention also provides a system for implementing the method.
[0059] The present invention also provides a communication system based on the method described above.
[0060] The present invention also provides an application of the method in the field of information security.
[0061] (III) Beneficial Effects
[0062] Compared with the prior art, the present invention has the following beneficial effects:
[0063] Privacy Protection: Homomorphic encryption technology allows for encryption of the ciphertext transmitted from the data generator to the verification stage during transmission, ensuring data privacy. Each verification stage is only responsible for verifying the data and performing calculations on the encrypted data, without leaking the data content. In contrast, ordinary encryption primarily focuses on the security of data storage and transmission. Data decryption is required before processing, resulting in the data being in plaintext during processing, posing a risk of privacy breaches.
[0064] Key protection: The homomorphic encryption key is dynamically derived from the receiver's public key hash and temporary parameters, and does not rely on static storage. Attackers cannot obtain the global key by intruding into a single node.
[0065] Multi-layered verification mechanism: Multiple verification steps are introduced as intermediaries for data verification. Each verification step can only perform verification and calculation operations, ensuring data privacy while allowing different processing of the model according to business needs, thus improving the scalability of the system.
[0066] Efficiency: Homomorphic encryption technology allows for various operations such as addition and multiplication to be performed on the ciphertext. The data processing module can directly perform statistical operations such as summation and averaging on the ciphertext without decrypting the data, providing a more flexible and efficient data processing method. For ordinary encrypted data, decryption is required before any calculation can be performed. This limits the data calculation process due to the decryption step. Moreover, each calculation requires a cumbersome decryption-calculation-re-encryption process. Attached Figure Description
[0067] Figure 1 This is a flowchart of the method of the present invention. Detailed Implementation
[0068] To make the objectives, contents, and advantages of the present invention clearer, the specific embodiments of the present invention will be described in further detail below with reference to the accompanying drawings and examples.
[0069] This invention provides a communication security verification method and system based on asymmetric and homomorphic encryption. By combining multiple processing ends and employing a verification mechanism, it ensures the security and privacy of data transmitted between the data generation end, multiple processing ends, and the data receiving end. This invention combines homomorphic and asymmetric encryption technologies, employing multi-layered verification and computation mechanisms to achieve secure and efficient data transmission and verification while ensuring data privacy. This method safeguards data privacy and transmission security through a secure transmission link between the data generation end, multiple processing ends, and the data receiving end, ensuring the security and trustworthiness of information verification and data transmission in multi-party communication scenarios. This method not only guarantees encrypted information transmission but also enables secure verification and decryption across multiple verification stages, making it widely applicable in various fields such as data transmission, information verification, and privacy protection.
[0070] The method includes the following steps:
[0071] 1. The data generation end encrypts and verifies the information and the data to be sent.
[0072] Step 1: Generate a dynamic binding key
[0073] 11) The data generator first generates the raw data (Data) to be sent. This data, after preprocessing, is ready to be sent to the subsequent verification stage. The raw data can be any type of information, and it is not encrypted. The data generator also obtains the data recipient's public key (PK). receiver .
[0074] 12) Dynamic key derivation:
[0075] Calculate the hash value of the data recipient's public key: H PK =SHA3 512 (PK receiver );
[0076] Generate initial homomorphic parameters (modulus) n temp (For Paillier-safe prime product), encrypted as: C n =RSA-OAEP(PK) receiver ,n temp );
[0077] Generate the final homomorphic modulus as the dynamic key:
[0078] Step 2: Homomorphically encrypt the raw data to be sent.
[0079] 21) Using the dynamic modulus n, perform Paillier homomorphic encryption on Data to obtain the homomorphic ciphertext: C data =Enc Paillier (data) = g Data ·r n mod n 2 g and r are parameters in homomorphic encryption algorithms. g is the generator, providing the homomorphic structure; r is a random number, providing randomness.
[0080] 22) Salinity formation:
[0081] For H PK and n temp Perform ECDSA signing and extract the first 128 bits as the salt value.
[0082]
[0083] 23) Data processing end verification information preparation
[0084] Encrypt a piece of verification data using the public key of the corresponding data processing terminal as verification information for the data processing terminal, in order to identify which data processing terminal should process the data.
[0085] Step 3: Prepare and encrypt verification information
[0086] The data generator prepares to send the following data to the data processing end: dynamic homomorphic ciphertext, initial encryption modulus, hash value of the data receiver's public key, signature salt value, and verification information from the data processing end, which will be used to confirm the legitimacy of the data generator in subsequent verification steps.
[0087] Step 4: Send encrypted data and verification information
[0088] The data generator sends the encrypted homomorphically encrypted data and verification information together to the first verification stage. At this stage, the data generator cannot guarantee that the data will not be tampered with during transmission, so encryption is used to ensure data privacy, and the verification information is used to confirm the identity of the data generator.
[0089] 2. The data processing end performs data verification and processing.
[0090] Step 5: Receive encrypted data and parse verification information
[0091] Upon receiving encrypted data, each verification step first decrypts the verification information to extract the relevant verification data. Using asymmetric decryption technology, the verification process can verify the legitimacy of the data generator and whether the data conforms to predetermined verification rules.
[0092] Step Six: Verify the validity of the data
[0093] Verify whether the Salt comes from a valid signature using the public key of the data generator:
[0094]
[0095] Verify whether the data generator is authorized and check whether the data has been tampered with or forged. If the verification fails, forward the data to other data processing terminals and return to step five. Only if the verification passes will the verification process continue to process the data.
[0096] Step 7: Perform calculations and processing on the ciphertext
[0097] After successful verification, the verification process verifies the encrypted data C. data Perform necessary computational operations. These operations include data format conversion, data validity verification, and aggregation of encrypted data. All operations are performed in encrypted form to ensure data privacy is not compromised.
[0098] Step 8: Forward the processed ciphertext
[0099] After verification and computation, the ciphertext will be forwarded to the data receiving end. During this process, the verification stage can only operate on the ciphertext and cannot access the plaintext data, thus effectively protecting data privacy.
[0100] 3. Data receiver decrypts ciphertext
[0101] Step Nine: Receive Ciphertext
[0102] The data receiver receives homomorphically encrypted ciphertext from the verification process. Since the data receiver is the final recipient, it has the authority to decrypt the ciphertext.
[0103] Step 10: Decrypt the ciphertext using the private key
[0104] 101) Restore the initial modulus:
[0105] Decrypt C using the private key n Get n temp ′:
[0106] n temp =RSA-OAEP-Decrypt(SK) receiver C n )
[0107] 102) Reconstructing the homomorphic modulus:
[0108] Calculate the homomorphic modulus:
[0109]
[0110] H PK ′ is the public key hash value calculated by the data receiving end;
[0111] 103) Prime number verification:
[0112] Verify whether n′ is a valid Paillier modulus. It is considered valid if n′=p×q and p≡q≡3mod4.
[0113] 104) Layered Decryption and Auditing
[0114] Decrypting the homomorphic ciphertext yields:
[0115]
[0116] Where λ = lcm(p-1, q-1), L is the core function of the Paillier decryption algorithm, and C result This refers to the ciphertext received by the data receiver.
[0117] Step 11: Further processing and feedback
[0118] The decrypted data will be further processed according to business needs. The data receiving end can perform corresponding operations based on the decryption results and, as needed, provide feedback on the processing results to the data generating end or the verification process.
[0119] The system that implements the above method includes the following modules:
[0120] Data generation module
[0121] Data generation module: Generates plaintext data to be sent and performs homomorphic encryption on the data.
[0122] Homomorphic encryption module: Uses homomorphic encryption technology to encrypt the data to be sent, ensuring that encrypted calculations can be performed on the data during transmission.
[0123] Data sending module: Sends the encrypted data and verification information to the first verification stage.
[0124] Data processing module
[0125] Processing end receiving module: Receives encrypted data sent by the data generating end.
[0126] Asymmetric decryption module: Uses asymmetric encryption technology to decrypt the verification information sent by the data generation end, and is used to verify the legality of the data.
[0127] Verification module: Performs verification operations based on the decrypted verification information to determine whether it is permissible to forward the ciphertext to the next verification stage or the data receiver.
[0128] Homomorphic computation module: Performs necessary computational operations on homomorphically encrypted ciphertext and updates the ciphertext content. All operations are performed in the ciphertext state, ensuring data privacy.
[0129] Data forwarding module: forwards the processed homomorphic encrypted ciphertext to the next verification step or data receiving end.
[0130] Data receiving module
[0131] Data receiving module: Receives homomorphic encrypted ciphertext forwarded by the verification process.
[0132] Asymmetric decryption module: Uses asymmetric encryption technology to decrypt homomorphic encrypted ciphertext and recover the original data sent by the data generation end.
[0133] As can be seen, this invention provides a communication security verification method and system based on a combination of asymmetric and homomorphic encryption, which can effectively protect the privacy, integrity, and authenticity of data in multi-party communication scenarios. Through multi-layered verification and encryption mechanisms, it provides an efficient and secure data transmission solution suitable for a wide range of application scenarios.
[0134] This method can be applied to various homomorphic encryption schemes, including:
[0135] 1. Cases with public and private keys (such as homomorphic encryption based on RSA variants)
[0136] Public keys are used to encrypt data. Users can use public keys to encrypt plaintext data into ciphertext, just like in ordinary RSA encryption. For example, a data owner (such as a company) can provide their public key to a cloud service provider, which can then use this public key to perform homomorphic computations on the encrypted data sent by the company.
[0137] The private key is used to decrypt the final result. Only the party possessing the private key (usually the data owner) can decrypt the ciphertext result after homomorphic computation to obtain a meaningful computation result. This ensures the confidentiality of the data and ownership of the computation result.
[0138] 2. Cases where there are no public and private keys (such as some simple homomorphic encryption schemes)
[0139] Some homomorphic encryption schemes may be based solely on symmetric keys, meaning the same key is used for both encryption and decryption. In this case, key management is relatively simple, but it can be limited in application scenarios. For example, in multi-party computation scenarios, how to securely share and use this key can be problematic. However, this approach may be suitable for specific scenarios with relatively low security requirements and relatively closed computing environments.
[0140] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the technical principles of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.
Claims
1. A multi-stage data security verification method based on homomorphic encryption and asymmetric encryption, characterized in that, Includes the following steps:
1. The data generation end encrypts and verifies the information and the data to be sent. Step 1: Generate a dynamic binding key 11) The data generation end first generates the raw data to be sent. After preprocessing, this raw data is ready to be sent to the subsequent verification stage, which is completed by the data processing end. The raw data is not encrypted. The data generation end also obtains the public key of the data recipient. ; 12) Dynamic key derivation Calculate the hash value of the data recipient's public key: ; Generate initial homomorphic parameters , The Paillier-safe prime product is encrypted as follows: ; Generate the final homomorphic modulus as the dynamic key: Step 2: Homomorphically encrypt the raw data to be sent (Data). 21) Using dynamic modulus Paillier homomorphic encryption is applied to the original data Data to obtain homomorphic ciphertext: ; It is a generator that provides homomorphic structure; It is a random number, providing randomness; 22) Salinity formation: right and Perform ECDSA signing and extract the first 128 bits as the salt value. : ; 23) Verification process: Preparation of verification information Encrypt a piece of verification data using the public key of the corresponding verification step as verification information for the verification step, which is used to identify which verification step should process the data; Step 3: Prepare and encrypt verification information The data generator prepares to send the following data to the verification stage: homomorphic ciphertext, initial encryption modulus, hash value of the data receiver's public key, and salt value. The verification information in the verification stage is used to confirm the legitimacy of the data generation end in subsequent verification stages; Step 4: Send encrypted data and verification information The data generator sends the homomorphic ciphertext and verification information together to the verification stage; 2. The verification phase involves data verification and processing. Step 5: Receive encrypted data and parse verification information After receiving the encrypted data, the verification process first decrypts the verification information and extracts the relevant verification data. Step Six: Verify the validity of the data Verify the salt value using the public key from the data generator. Is it from a valid signature? Verify whether the data generator is authorized and check whether the data has been tampered with or forged. If the verification fails, forward it to other verification stages and return to step five. Only if the verification passes will the verification stage continue to process the data. Step 7: Perform calculations and processing on the ciphertext After successful verification, the verification process verifies the encrypted data. Perform computational operations; all operations are executed in encrypted form. Step 8: Forward the processed ciphertext After verification and calculation, the ciphertext will be forwarded to the data receiving end. During this process, the verification process can only operate on the ciphertext and cannot access the plaintext.
3. Data receiver decrypts ciphertext Step Nine: Receive Ciphertext The data receiver receives the homomorphic encrypted ciphertext from the verification process. Since the data receiver is the final recipient, it has the right to decrypt the ciphertext. Step 10: Decrypt the ciphertext using the private key 101) Restore the initial modulus: Decrypt using the private key get : 102) Reconstructing the homomorphic modulus: Calculate the homomorphic modulus: It is the public key hash value calculated by the data receiving end; 103) Verification of primeness: verify Is it a valid Paillier modulus, provided that it satisfies... and It is considered legal under certain circumstances; 104) Layered Decryption and Auditing Decrypting the homomorphic ciphertext yields: in L is the core function of the Paillier decryption algorithm, C result This refers to the ciphertext received by the data receiver.
2. The method as described in claim 1, characterized in that, Step seven involves calculations including data format conversion, data validity verification, and aggregation of encrypted data.
3. The method as described in claim 1, characterized in that, The method also includes step eleven: the decrypted data will be further processed according to business needs, the data receiving end will perform corresponding operations based on the decryption results, and will provide feedback on the processing results to the data generating end or verification stage as needed.
4. An application of the method as described in claim 1, 2 or 3 in the field of information security.