Data synchronization method and system based on zero knowledge proof

Abstract

The invention discloses a data synchronization method and system based on zero knowledge proof, and relates to the field of data sharing and analysis, the system comprises a monitoring center, the monitoring center is in communication connection with a data input module, a data processing module, a proof generation module and a proof verification module; a prover and a verifier use the data input module to input data, the data processing module performs hash processing and comparison on the data of the prover and the verifier, if the hash values of the prover and the verifier are the same, the primary zero knowledge proof is successful, and the proof generation module generates secondary zero knowledge proof for the data of the prover and the verifier. The proof verification module verifies the secondary zero-knowledge proof, when the zero-knowledge proof of the prover and the zero-knowledge proof of the verifier are the same and correct, the data of the prover is synchronized, the data synchronization is carried out under the condition that the information is not leaked, and the data synchronization is better ensured by utilizing the two zero-knowledge proof.

Description

Technical Field

[0001] The present invention relates to the field of data sharing and analysis, and specifically to a data synchronization method and system based on zero-knowledge proof. Background Art

[0002] With the development of society and the improvement of people's living standards, data synchronization plays an increasingly important role in modern information technology and data management. In a modern working environment, people often use multiple devices for work. Data synchronization enables seamless switching of work on different devices, improving collaboration efficiency and flexibility. In the prior art, synchronizing data often requires both parties to view their respective data, which cannot ensure the privacy of the data and may lead to data leakage. How to synchronize data without disclosing the privacy of the data to avoid data leakage is a problem that needs to be solved. For this reason, a data synchronization method and system based on zero-knowledge proof are provided herein. Summary of the Invention

[0003] In order to solve the above technical problems, the purpose of the present invention is to provide a data synchronization method and system based on zero-knowledge proof.

[0004] The purpose of the present invention can be achieved by the following technical solutions: A data synchronization system based on zero-knowledge proof includes a monitoring center, which is communicatively connected to a data input module, a data processing module, a proof generation module, and a proof verification module. The data input module is used for the prover and the verifier to input data and back up the data input by the prover and the prover. The data processing module is used for hashing the data of the prover and the verifier and comparing the hashed values of the prover and the verifier obtained after processing. The proof generation module is used for generating zero-knowledge proofs for the data of the prover and the verifier according to the comparison result. The proof verification module is used for verifying the zero-knowledge proofs generated by the proof generation module.

[0005] Further, the process of the verifier and the prover inputting data into the data input module includes: Setting up a registration unit and a login unit, inputting the personal basic information of the prover and the verifier through the registration unit, and having the monitoring center review the input basic information of the prover and the verifier and output a review result. After the review is passed, a login account and a login password are generated according to the mobile phone number in the input personal basic information, and the generated login account and login password are sent to the corresponding mobile terminal. By inputting the obtained login account and login password into the login unit, the prover and the verifier complete the login process. After the login is completed, enter the data input module. The prover and the verifier input data through the data input module, and the data input by the prover and the verifier is backed up.

[0006] Furthermore, the process of the data processing module performing hash processing on the data of the prover and the verifier and comparing the obtained hash values of the prover and the verifier includes: Convert the data of the prover and the verifier into the corresponding ASCII code representation. The ASCII code is a standard encoding method that maps characters to integers. Convert the ASCII code into binary representation. Pad the data whose length is not a multiple of 512 bit, add a 1 followed by several 0s, and then add the data length. Group the data of the prover and the verifier. Define H b as the initial hash value, b = 0, 1,..., 8. Define K h as the confusion constant, h = 0, 1,..., 63. Define ROTR x (H l ) to represent rotating H l to the right by x bits. Generate a group of initial 256-bit hash values H b according to the first 32 bits of the square roots of the smallest 8 prime numbers, b = 0, 1,..., 8. Generate the confusion constant K h according to the first 32 bits of the cube roots of the first 64 prime numbers, h = 0, 1,..., 63. Define ∑0 = ROTR 2 (H0) ⨁ ROTR 13 (H0) ⨁ ROTR 22 (H0), define ∑1 = ROTR 6 (H4) ⨁ ROTR 11 (H4) ⨁ ROTR 25 (H4), define Ch and Ma, Ch(H4, H5, H6) = (H4 ⋀ H5) ⊕ ((¬H4) ⋀ H6), Ma(H0, H1, H2) = (H0 ⋀ H1) ⊕ (H0 ⋀ H2) ⊕ (H1 ⋀ H2). The ROTR 2 (H0) represents rotating H0 to the right by 2 bits. Perform a confusion operation on the grouped data to obtain the hash values after hashing the data of the prover and the verifier. Compare the hash values of the prover and the verifier. When the hash values of the prover and the verifier are the same, it indicates that a zero-knowledge proof is successful. Send the backed-up data input by the prover and the verifier to the proof generation module through the monitoring center. When the hash values of the prover and the verifier are different, the data of the prover and the verifier are inconsistent, the data synchronization fails, and a zero-knowledge proof fails.

[0007] Further, the process of grouping the data of the prover and the verifier includes: Group the data of the prover and the verifier, with each group being 512 bits, marked as S j , j = 0, 1, 2, ……, n, where n is an integer. Divide each group into 16 sub-groups, with each sub-group having 32 bits, marked as W0, W1, ……, W 16 , and expand the 16 sub-groups into 64 sub-groups, marked as W i , i = 0, 1, ……, 63.

[0008] Further, the process of performing a confusion operation on the grouped data includes: Perform a confusion operation on the first W1, and the resulting hash value after confusion is marked as H 0 , H 0 Consists of 8 32-bit components, respectively marked as A, B, C, D, E, F, G, H. Take the value of H0 as B, the value of H1 as C, the value of H2 as D, E = (W0 ⊕ K0) ⊕ H7 ⊕ Ch(H4, H5, H6) ⊕ ∑1 ⊕ H3, take the value of H4 as F, the value of H5 as G, the value of H6 as H, A = (W0 ⊕ K0) ⊕ H7 ⊕ Ch(H4, H5, H6) ⊕ ∑1 ⊕ Ma(H0, H1, H2) ⊕ ∑0; Take H 0 as the initial hash value for the second round, perform several rounds of confusion operations, perform an exclusive OR operation on the hash value obtained in the last round and the initial hash value to obtain the hash value of the first group of data, and take the hash value of the first group of data as the initial hash value of the second group of data and repeat in a loop, and so on.

[0009] Further, the process by which the proof generation module generates a zero-knowledge proof for the data of the prover and the verifier includes: Set the parameters for the security of the zero-knowledge proof. The parameters are 64-bit binary numbers. Convert each character in the data of the prover into the corresponding ASCII code representation, convert the ASCII code of each character into 8-bit binary representation, and divide the data of the prover into several data blocks with a length of 64; Perform a NOT operation on the data block, perform an exclusive NOR operation on the parameter and the data block, and take the result of performing an OR-NOT operation on the parameter and the data block as the zero-knowledge proof generated for the data of the prover; Convert each character in the verifier's data into its corresponding ASCII code representation, convert the ASCII code of each character into an 8-bit binary representation, and divide the verifier's data into several data blocks of length 64; Perform a NOT operation on the data block, perform an exclusive NOR operation on the parameter and the data block, and use the result obtained by performing a NOR operation on the parameter and the data block as the zero-knowledge proof generated for the verifier's data.

[0010] Furthermore, the process by which the proof verification module verifies the zero-knowledge proof generated by the proof generation module includes: Verify the correctness of the zero-knowledge proofs of the prover and the verifier through the parameters of the security of the zero-knowledge proof; When the zero-knowledge proofs of the prover and the verifier are the same and both are correct, the prover has specific data, the verifier has specific data, and the specific data owned by the prover is the same as the specific data owned by the verifier, and the data of the prover has been synchronized; When the zero-knowledge proofs of the prover and the verifier are different, the data of the prover and the verifier are inconsistent, and the data of the prover has not been synchronized.

[0011] The present invention also discloses a data synchronization method based on zero-knowledge proof, including the following steps: Step 1: The prover and the verifier input data; Step 2: Perform a hash process on the data input by the prover and the verifier and compare the hash values of the prover and the verifier obtained after the process; Step 3: Generate a zero-knowledge proof for the data of the prover and the verifier according to the comparison result; Step 4: Verify the generated zero-knowledge proof.

[0012] Compared with the prior art, the beneficial effects of the present invention are: The prover and the verifier input data through the data input module, the data processing module performs a hash process on the data input by the verifier and the prover and compares the hash values obtained after the hash process. If the hash values of both are the same, a zero-knowledge proof is successful once. The proof generation module generates a secondary zero-knowledge proof for the data of the prover and the verifier, and the proof verification module verifies the secondary zero-knowledge proof. If the secondary zero-knowledge proofs of the prover and the verifier are the same and both are correct, then the data of the prover has been synchronized. The prover and the verifier have synchronized the data without disclosing information, protecting the privacy of the data. The prover and the verifier perform a secondary zero-knowledge proof, further ensuring that the data has been synchronized. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] To more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings required in the embodiments. Obviously, the drawings described below are only some embodiments recorded in the present invention. For those of ordinary skill in the art, other drawings can also be obtained based on these drawings.

[0014] Figure 1 This is the schematic diagram of the present invention. Detailed implementation manners

[0015] As Figure 1 shown, the zero-knowledge proof-based data synchronization system includes a monitoring center, and the monitoring center is communicatively connected to a data input module, a data processing module, a proof generation module, and a proof verification module; The data input module is used for the prover and the verifier to input data; It should be further noted that, in the specific implementation process, the process of the data input module inputting the data of the prover and the verifier includes: Set up a registration unit and a login unit, input the personal basic information of the prover and the verifier through the registration unit, and the monitoring center audits the input basic information of the prover and the verifier and outputs an audit result. After the audit passes, a login account and a login password are generated according to the mobile phone number in the input personal basic information, and the generated login account and login password are sent to the corresponding mobile terminal; By inputting the obtained login account and login password into the login unit, the prover and the verifier complete the login process. After the login is completed, enter the data input module, and the prover and the verifier input data through the data input module, and back up the data input by the prover and the verifier.

[0016] The data processing module is used for performing hash processing on the data input by the prover and the verifier and comparing the hash values of the prover and the verifier obtained after the processing; It should be further noted that, in the specific implementation process, the specific process of the data processing module performing hash processing on the data input by the prover and the verifier includes: Convert the data input by the prover and the verifier into the corresponding ASCII code representation. The ASCII code is a standard encoding method that maps characters to integers. Convert the ASCII code into binary representation, pad the data whose length is not a multiple of 512bit, add a 1 followed by several 0s, and then add the data length; Group the data, with each group being 512bit, and mark it as S j, j = 0, 1, 2, ……, n, n is an integer. Each group is further divided into 16 sub - groups, and each sub - group has 32 bits, labeled as W0, W1, ……, W 16 ; Define S0 = ROTR 7 (W i-15 ) ⊕ ROTR 18 (W i-15 ) ⊕ SHR 3 (W i-15 ), S1 = ROTR 7 (W i-2 ) ⊕ ROTR 19 (W i-2 ) ⊕ SHR 10 (W i-2 ); Expand the 16 sub - groups into 64 sub - groups, labeled as W i , i = 0, 1, ……, 63. The expansion formula is W i = W i-16 + W i-7 + S0 + S1. The ROTR represents a right rotation. ROTR 7 (W i-15 ) means rotating W i-15 right by 7 bits. ROTR 18 (W i-15 ) means rotating W i-15 right by 18 bits. SHR represents a right shift. SHR 3 (W i-15 ) means shifting W i-15 right by 3 bits. ROTR 19 (W i-2 ) means rotating W i-2 right by 19 bits. SHR 10 (W i-2 ) means shifting W i-2 right by 10 bits; Define H b as the initial hash value, b = 0, 1, ……, 8. Define K h as the confusion constant, h = 0, 1, ……, 63; Generate a group of initial 256 - bit hash values H b , b = 0, 1, ……, 8, according to the first 32 bits of the square roots of the smallest 8 prime numbers. Generate the confusion constant K h , h = 0, 1, ……, 63, and define ∑0 = ROTR 2 (H0) ⨁ ROTR 13 (H0) ⨁ ROTR 22 (H0), define ∑1 = ROTR6 (H4) ⨁ ROTR 11 (H4) ⨁ ROTR 25 (H4), define Ch and Ma, Ch(H4, H5, H6) = (H4 ⋀ H5) ⊕ ((¬H4) ⋀ H6), Ma(H0, H1, H2) = (H0 ⋀ H1) ⊕ (H0 ⋀ H2) ⊕ (H1 ⋀ H2), the ROTR 2 (H0) represents rotating H0 to the right by 2 bits, ROTR 13 (H0) represents rotating H0 to the right by 13 bits, ROTR 6 (H4) represents rotating H4 to the right by 6 bits, ROTR 11 (H4) represents rotating H4 to the right by 11 bits, the Ch(H4, H5, H6) represents the result of performing an exclusive OR operation on the result of performing a bitwise logical AND operation on H4 and H5 and a bitwise logical AND operation on the result of performing a logical NOT operation on H4 and H6, the Ma(H0, H1, H2) represents performing an exclusive OR on the result of performing a bitwise logical AND operation on H0 and H1 and the result of performing a bitwise logical AND operation on H0 and H2, and then performing an exclusive OR on the result of the exclusive OR with the result of performing a bitwise logical AND operation on H1 and H2; Perform a confusion operation on the first W1, and the hash value obtained after confusion is marked as H 0 , H 0 Consists of 8 32 - bits, respectively marked as A, B, C, D, E, F, G, H. Take the value of H0 as B, the value of H1 as C, the value of H2 as D, E = (W0 ⊕ K0) ⊕ H7 ⊕ Ch(H4, H5, H6) ⊕ ∑1 ⊕ H3, take the value of H4 as F, the value of H5 as G, the value of H6 as H, A = (W0 ⊕ K0) ⊕ H7 ⊕ Ch(H4, H5, H6) ⊕ ∑1 ⊕ Ma(H0, H1, H2) ⊕ ∑0; Take H 0 As the initial hash value of the second round, perform several rounds of confusion operations, perform an exclusive OR operation on the hash value obtained in the last round and the initial hash value to obtain the hash value of the first group of data. Take the hash value of the first group of data as the initial hash value of the second group of data and repeat in a loop, and so on until the hash value obtained in the last group is the hash value obtained after hashing the data of the prover and the verifier.

[0017] Compare the hash values of the prover and the verifier. When the hash values of the prover and the verifier are the same, it means that a zero - knowledge proof is successful, and send the input data of the backed - up prover and verifier to the proof generation module through the monitoring center; When the hash values of the prover and the verifier are different, the data of the prover and the data of the verifier are inconsistent, the data synchronization fails, and a zero - knowledge proof fails.

[0018] The proof generation module is used to generate zero - knowledge proofs for the data of the prover and the verifier; It should be further noted that in the specific implementation process, the specific process of the proof generation module generating zero - knowledge proofs for the data of the prover and the verifier includes: Set the parameters for the security of the zero - knowledge proof. The parameters are 64 - bit binary numbers. Convert each character in the prover's data into the corresponding ASCII code representation, convert the ASCII code of each character into 8 - bit binary representation, and divide the prover's data into several data blocks with a length of 64; Perform a NOT operation on the data block, perform an XOR operation between the parameter and the data block, and use the result of performing a NOR operation between the parameter and the data block as the zero - knowledge proof generated for the prover's data. The zero - knowledge proof is used to prove that the prover has specific data; Convert each character in the verifier's data into the corresponding ASCII code representation, convert the ASCII code of each character into 8 - bit binary representation, and divide the verifier's data into several data blocks with a length of 64; Perform a NOT operation on the data block, perform an XOR operation between the parameter and the data block, and use the result of performing a NOR operation between the parameter and the data block as the zero - knowledge proof generated for the verifier's data. The zero - knowledge proof is used to prove that the verifier has specific data; Send the zero - knowledge proof of the prover, the zero - knowledge proof of the verifier, and the parameters for the security of the zero - knowledge proof to the proof verification module through the monitoring center.

[0019] The proof verification module is used to verify the zero - knowledge proofs generated by the proof generation module; It should be further noted that in the specific implementation process, the specific process of the proof verification module verifying the zero - knowledge proofs generated by the proof generation module includes: Verify the correctness of the zero - knowledge proofs of the prover and the verifier through the parameters for the security of the zero - knowledge proof. Perform a NOT operation on the zero - knowledge proof of the prover, perform an OR operation between the parameter and the zero - knowledge proof of the prover, perform a NOT operation on the result of performing an XOR operation between the parameter and the zero - knowledge proof of the prover, convert the result obtained after the NOT operation into ASCII code, convert the ASCII code into verification data, and compare the verification data with the prover's data. When the comparison result is consistent, the zero - knowledge proof of the verifier is correct; When the zero - knowledge proofs of the prover and the verifier are the same and both are correct, the prover has specific data, the verifier has specific data, and the specific data owned by the prover is the same as the specific data owned by the verifier, and the data of the prover has been synchronized; When the zero - knowledge proofs of the prover and the verifier are different, the data of the prover and the verifier are inconsistent, and the data of the prover is not synchronized.

[0020] The present invention also discloses a data synchronization method based on zero - knowledge proof, including the following steps: Step 1: The prover and the verifier input data; Step 2: Hash - process the data input by the prover and the verifier and compare the obtained hash values of the prover and the verifier; Step 3: Generate zero - knowledge proofs for the data of the prover and the verifier according to the comparison result; Step 4: Verify the generated zero - knowledge proofs.

[0021] The above embodiments are only used to illustrate the technical method of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical method of the present invention can be modified or equivalently replaced without departing from the spirit and scope of the technical method of the present invention.

Claims

1. A data synchronization system based on zero-knowledge proof, including a monitoring center, characterized in that: The monitoring center is communicatively connected to a data input module, a data processing module, a proof generation module and a proof verification module; The data input module is used for the prover and the verifier to input data and to back up the data input by the prover and the verifier; The data processing module is used to perform hash processing on the data input by the prover and the verifier and compare the hash values ​​of the prover and the verifier obtained after the processing; The proof generation module is used to generate a zero-knowledge proof for the prover and the verifier's data according to the comparison result; The proof verification module is used to verify the zero-knowledge proof generated by the proof generation module.

2. The data synchronization system based on zero-knowledge proof according to claim 1, characterized in that: The process of the prover and the verifier inputting data into the data input module and backing up the input data includes: A registration unit and a login unit are set, and the basic personal information of the prover and the verifier is input through the registration unit, and the monitoring center reviews the input basic information of the prover and the verifier, outputs the review result, and after the review is passed, generates a login account and login password according to the mobile phone number in the input personal basic information, and sends the generated login account and login password to the corresponding mobile phone terminal; The prover and verifier complete the login process by inputting the obtained login account and login password into the login unit. After the login is completed, they enter the data input module, and the prover and verifier input data through the data input module, and the data input by the prover and verifier are backed up.

3. The data synchronization system based on zero-knowledge proof according to claim 2, characterized in that: The process of the data processing module performing hash processing on the data of the prover and the verifier and comparing the hash values ​​of the prover and the verifier obtained after the processing includes: Convert the data of the prover and the verifier into corresponding ASCII code representations, convert the ASCII code into binary representations, and pad the data if the data length is not a multiple of 512; Group the prover and verifier data into groups, and b Defined as the initial hash value, b = 0, 1, ..., 8, K h Defined as a confusion constant, h = 0, 1, ..., 63, define ROTR x (H l ) means that H l Rotate right by x positions; Generate an initial 256-bit hash value H based on the first 32 bits of the smallest 8 prime square roots b , b = 0, 1, ..., 8, generate the confusion constant K based on the first 32 bits of the first 64 prime cube roots h , h = 0, 1, ..., 63, define ∑0 = ROTR 2 (H0) ⨁ROTR 13 (H0) ⨁ROTR 22 (H0), define ∑1=ROTR 6 (H4) ⨁ROTR 11 (H4) ⨁ROTR 25 (H4), define Ch function and Ma function, Ch(H4, H5, H6) = (H4⋀H5)⊕ ((¬H4)⋀H6), Ma(H0, H1, H2) = (H0⋀H1)⊕ (H0⋀H2)⊕ (H1⋀H2); Perform obfuscation operation on the grouped data to obtain the hash value of the prover and verifier data, and compare the hash values ​​of the prover and verifier. When the hash values ​​of the prover and verifier are the same, it means that the zero-knowledge proof is successful. The backup data input by the prover and verifier are sent to the proof generation module through the monitoring center; When the hash values ​​of the prover and the verifier are different, the prover's data and the verifier's data are inconsistent, data synchronization fails, and a zero-knowledge proof fails.

4. The data synchronization system based on zero-knowledge proof according to claim 3, characterized in that: The process of grouping the prover and verifier data includes: The prover and verifier data are grouped into 512 bits per group, marked as S j , j = 0, 1, 2, ..., n, n is an integer, each S j Divided into 16 groups, each with 32 bits, marked as W0, W1, ..., W 16 ; Defining SHR p (W o ) means that W o Shift right by p positions, define S0=ROTR 7 (W i-15 )⊕ROTR 18 (W i-15 )⊕SHR 3 (W i-15 ), S1=ROTR 7 (W i-2 )⊕ROTR 19 (W i-2 )⊕SHR 10 (W i-2 ); Expand the 16 groups into 64 groups, labeled W i , i=0, 1, ..., 63, the diffusion formula is W i =W i-16 +W i-7 +S0+S1.

5. The data synchronization system based on zero-knowledge proof according to claim 3, characterized in that: The process of obfuscating the grouped data includes: Perform the obfuscation operation on the first W1, and mark the hash value obtained after obfuscation as H 0 , H 0 It consists of 8 32-bit bits, marked as A, B, C, D, E, F, G, H. The value of H0 is B, the value of H1 is C, and the value of H2 is D. E = (W0⊕K0)⊕H7⊕Ch(H4, H5, H6)⊕∑1⊕H3, the value of H4 is F, the value of H5 is G, and the value of H6 is H. A = (W0⊕K0)⊕H7⊕Ch(H4, H5, H6)⊕∑1⊕Ma(H0, H1, H2)⊕∑0; H 0 As the initial hash value of the second round, several rounds of obfuscation operations are performed, the hash value obtained in the last round is XORed with the initial hash value to obtain the hash value of the first group of data, and the hash value of the first group of data is used as the initial hash value of the second group of data, and the cycle is repeated, and so on.

6. The data synchronization system based on zero-knowledge proof according to claim 3, characterized in that: The process of the proof generation module generating a zero-knowledge proof for the prover and the verifier's data includes: Set the security parameters of zero-knowledge proof, which are 64-bit binary numbers, convert each character in the prover's data into the corresponding ASCII code, convert the ASCII code of each character into an 8-bit binary representation, and divide the prover's data into several data blocks of length 64; Perform a negation operation on the data block, perform an XOR operation on the parameter and the data block, and use the result of performing an XOR operation on the parameter and the data block as the zero-knowledge proof of the data generation of the prover; Convert each character in the verifier's data into its corresponding ASCII code, convert each character's ASCII code into an 8-bit binary representation, and divide the verifier's data into several data blocks of length 64; The data block is negated, the parameter and the data block are XORed, and the result of the parameter and the data block is used as the zero-knowledge proof of the verifier's data generation.

7. The data synchronization system based on zero-knowledge proof according to claim 6, characterized in that: The process of the proof verification module verifying the zero-knowledge proof generated by the proof generation module includes: Verify the correctness of the prover and verifier’s zero-knowledge proof through the security parameters of the zero-knowledge proof; When the zero-knowledge proofs of the prover and the verifier are the same and both are correct, the prover has specific data, the verifier has specific data, and the specific data owned by the prover is the same as the specific data owned by the verifier, and the prover's data has been synchronized; When the zero-knowledge proofs of the prover and the verifier are different, the prover's data and the verifier's data are inconsistent and the prover's data are not synchronized.

8. The data synchronization method based on zero-knowledge proof according to any one of claims 1 to 7, characterized in that: The following steps are involved: Step 1: The prover and verifier input data; Step 2: Hash the data input by the prover and the verifier and compare the hash values ​​of the prover and the verifier after processing; Step 3: Generate zero-knowledge proof for the prover and verifier’s data based on the comparison results; Step 4: Verify the generated zero-knowledge proof.

Images