Data processing method and device based on zero-knowledge proof and computer equipment
By performing equivalent conversion and homomorphic secret sharing of data processing tasks, encryption generates zero-knowledge proofs, solving the problems of high computing complexity and privacy violations in the existing technology, and achieving efficient verification and simplified deployment.
Patent Information
- Application Number
- CN202410986925.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-22
- Publication Date
- 2024-11-22
AI Technical Summary
The existing zero-knowledge proof protocol has high computational complexity, long verification process and complex deployment, which violates the privacy of data.
By performing equivalent conversion of data processing tasks, a polynomial set of polynomial types is obtained, and the result set is encrypted based on the preset homomorphic secret sharing method, a proof ciphertext is generated for generating zero-knowledge proof, and distributed to two computing nodes to assist Verify the correctness of the node verification task results.
Reduces computing complexity, improves verification efficiency, ensures data privacy during data processing, and simplifies deployment difficulty and communication complexity.
Smart Images

Figure CN119011150A_ABST
Abstract
Description
Technical Field
[0001] The present application belongs to the field of computer technology, and in particular, relates to a data processing method, apparatus, computer device, and computer-readable storage medium based on zero-knowledge proof. Background Art
[0002] With the rapid development of informatization today, the importance of information security has become increasingly prominent. Whether it is personal privacy protection, the safe storage and transmission of corporate confidential data, or even national security, higher and higher requirements have been placed on information security.
[0003] Zero-Knowledge Proof (ZKP) is a technology that proves a statement is true without revealing specific information. It has received extensive attention and research in the field of information security. Through zero-knowledge proof, the verifier can be sure of the authenticity of the content declared by the data holder without obtaining specific information, which is of great significance in protecting privacy data and preventing information leakage.
[0004] However, existing zero-knowledge proof protocols are all constructed on plaintext data, and both the prover and the verifier can obtain the data in plaintext, which greatly infringes on the privacy of the data. Therefore, zero-knowledge proof and homomorphic encryption technologies have shown great potential in the field of information security, but in practical applications, there are problems such as high computational complexity, long verification process, and high deployment complexity. Summary of the invention
[0005] In view of this, the embodiments of the present application provide a data processing method, apparatus, computer device and computer-readable storage medium based on zero-knowledge proof, which reduce the computational complexity and improve the verification efficiency while ensuring the correctness and completeness of the results.
[0006] A first aspect of an embodiment of the present application provides a data processing method based on zero-knowledge proof, which is applied to a sending node of a zero-knowledge proof system, including:
[0007] Performing equivalent conversion on the data processing task to obtain a polynomial set of different polynomial types for the data processing task;
[0008] Determine a result set of each polynomial type for a specified parameter based on a polynomial set of each polynomial type and a type weight of each polynomial type;
[0009] Based on a preset homomorphic secret sharing method, encrypt each of the result sets to obtain a proof ciphertext for generating a zero-knowledge proof;
[0010] The proof ciphertext and the input ciphertext encrypted based on the preset homomorphic secret sharing method are distributed to two computing nodes of the zero-knowledge proof system, so that each computing node generates a zero-knowledge proof based on the preset homomorphic secret sharing method, the input ciphertext, and the proof ciphertext. The two zero-knowledge proofs are used to assist the verification node of the zero-knowledge proof system in verifying the correctness of the task results of the data processing task.
[0011] In an implementation of the first aspect, determining a result set of each polynomial type for a specified parameter based on a polynomial set of each polynomial type and a type weight of each polynomial type includes:
[0012] Randomly selecting a type weight for each polynomial type from the ring structure corresponding to the data processing task;
[0013] For each of the polynomial types, determining the result of each polynomial in the polynomial set of the polynomial type for the specified parameter, and obtaining an intermediate result set of the polynomial type;
[0014] The product of the type weight of the targeted polynomial type and each of the intermediate results in the intermediate result set of the targeted polynomial type is determined to obtain a result set for the targeted polynomial type with respect to the specified parameters.
[0015] In an implementation of the first aspect, the method further includes:
[0016] Encapsulating the proof ciphertext and the public key into a public reference string and sharing the public reference string in the zero-knowledge proof system;
[0017] The public reference string, a private key adapted to a preset homomorphic secret sharing method, designated parameters, and weights of each polynomial type are encapsulated into a verification key and shared in the zero-knowledge proof system.
[0018] In a first aspect of an embodiment of the present application, a data processing task is equivalently converted to obtain a polynomial set for different polynomial types; based on the polynomial set of each polynomial type and the type weight of each polynomial type, a result set for each polynomial type for specified parameters is determined; based on a preset homomorphic secret sharing method, each result set is encrypted to obtain a proof ciphertext for generating a zero-knowledge proof; the proof ciphertext and the input ciphertext encrypted based on the preset homomorphic secret sharing method are distributed to two computing nodes of the zero-knowledge proof system, so that a complex data processing task is equivalently converted into a polynomial set including multiple polynomial types to obtain a proof ciphertext with low computational complexity, which can improve the verification efficiency of the zero-knowledge proof, and the encryption by the preset homomorphic secret sharing method can ensure data privacy during the data processing process.
[0019] A second aspect of an embodiment of the present application provides a data processing device based on zero-knowledge proof, which is deployed in a sending node of a zero-knowledge proof system, including:
[0020] A conversion module, used for performing equivalent conversion on the data processing task to obtain a polynomial set of different polynomial types for the data processing task;
[0021] A determination module, configured to determine a result set of each polynomial type for a specified parameter based on a polynomial set of each polynomial type and a type weight of each polynomial type;
[0022] A first encryption module, used to encrypt each of the result sets based on a preset homomorphic secret sharing method to obtain a proof ciphertext for generating a zero-knowledge proof;
[0023] A distribution module is used to distribute the proof ciphertext and the input ciphertext encrypted based on the preset homomorphic secret sharing method to two computing nodes of the zero-knowledge proof system, so that each computing node generates a zero-knowledge proof based on the preset homomorphic secret sharing method, the input ciphertext, and the proof ciphertext. The two zero-knowledge proofs are used to assist the verification node of the zero-knowledge proof system in verifying the correctness of the task result of the data processing task.
[0024] A third aspect of an embodiment of the present application provides a data processing method based on zero-knowledge proof, which is applied to a computing node of a zero-knowledge proof system, where the number of the computing nodes is two, including:
[0025] Obtaining the input ciphertext of the data processing task distributed by the sending node of the zero-knowledge proof system, the private key adapted to the preset homomorphic secret sharing method, and the proof ciphertext;
[0026] Generate proof components of each polynomial type based on a preset intermediate vector and a result set of each polynomial type in the proof ciphertext;
[0027] Based on the preset homomorphic secret sharing method, encrypt each of the proof components to generate a zero-knowledge proof;
[0028] Sending the zero-knowledge proof to a verification node of the zero-knowledge proof system so that the verification node verifies the correctness of the task result of the data processing task based on the zero-knowledge proof;
[0029] Among them, the input ciphertext is obtained by the sending node encrypting the input information of the data processing task based on the preset homomorphic secret sharing method, the proof ciphertext is obtained by the sending node encrypting the result set of each polynomial type based on the preset homomorphic secret sharing method, the result set is determined by the sending node based on the data processing task for each polynomial type and the type weight of each polynomial type relative to the specified parameter, and the polynomial set of each polynomial type is obtained by performing equivalent transformation on the data processing task.
[0030] In an implementation of the third aspect, generating the proof component of each polynomial type based on the preset intermediate vector and the result set of each polynomial type in the proof ciphertext includes:
[0031] For each polynomial type, based on the weight of the polynomial type, weight removal is performed on each result in the result set of the polynomial type to obtain a combination of intermediate results of the polynomial type;
[0032] Determine the vector inner product of the intermediate result set of the targeted polynomial type and the preset intermediate vector to obtain a first proof component corresponding to the targeted polynomial type;
[0033] A zero-knowledge proof is generated based on a first proof component of each polynomial type and a second component of the first proof component increased by a specified multiple.
[0034] In the third aspect of the embodiment of the present application, proof components of each polynomial type are first generated based on a preset intermediate vector and a result set of each polynomial type in the proof ciphertext, and then each proof component is encrypted based on a preset homomorphic secret sharing method to generate a zero-knowledge proof. In this way, a zero-knowledge proof for verifying the correctness and integrity of the task results can be quickly generated while protecting privacy data and preventing information leakage.
[0035] A fourth aspect of an embodiment of the present application provides a data processing device based on zero-knowledge proof, which is deployed in a computing node of a zero-knowledge proof system, including:
[0036] An acquisition module, used to acquire the input ciphertext of the data processing task distributed by the sending node of the zero-knowledge proof system, the private key adapted to the preset homomorphic secret sharing method, and the proof ciphertext;
[0037] A first generating module, configured to generate a proof component of each polynomial type based on a preset intermediate vector and a result set of each polynomial type in the proof ciphertext;
[0038] A second encryption module is used to encrypt each of the proof components based on the preset homomorphic secret sharing method to generate a zero-knowledge proof;
[0039] A sending module, used for sending the zero-knowledge proof to a verification node of the zero-knowledge proof system, so that the verification node verifies the correctness of the task result of the data processing task based on the zero-knowledge proof;
[0040] Among them, the input ciphertext is obtained by the sending node encrypting the input information of the data processing task based on the preset homomorphic secret sharing method, the proof ciphertext is obtained by the sending node encrypting the result set of each polynomial type based on the preset homomorphic secret sharing method, the result set is determined by the sending node based on the data processing task for each polynomial type and the type weight of each polynomial type relative to the specified parameter, and the polynomial set of each polynomial type is obtained by performing equivalent transformation on the data processing task.
[0041] A fifth aspect of an embodiment of the present application provides a data processing method based on zero-knowledge proof, which is applied to a verification node of a zero-knowledge proof system, including:
[0042] Receiving zero-knowledge proofs respectively sent by two computing nodes of the zero-knowledge proof system, the zero-knowledge proof comprising two proof components in ciphertext form of respective polynomial types associated with the data processing task, a preset multiple relationship between the two proof components, and the polynomial type being obtained based on equivalent conversion for the data processing task;
[0043] Based on a preset homomorphic secret sharing method, the two zero-knowledge proofs are decrypted respectively to obtain two decrypted proof data;
[0044] Performing weighted summation on the elements of the same bit order in the two decryption proof data to obtain the target zero-knowledge proof;
[0045] Based on the input information of the data processing task and the target zero-knowledge proof, generating a task result of the data processing task for specified parameters;
[0046] Based on the preset multiple relationship of each polynomial type, the target zero-knowledge proof is verified to obtain a verification result indicating whether to accept the task result.
[0047] In an implementation of the fifth aspect, the target zero-knowledge proof is verified based on the preset multiple relationship of each polynomial type to obtain a verification result indicating whether to receive the task result, including:
[0048] For each polynomial type, obtaining a proof component pair corresponding to the polynomial type from the target zero-knowledge proof;
[0049] Testing each pair of the proof components to obtain a test result;
[0050] If the verification result indicates that two proof components in the proof component pair of each polynomial type have a preset multiple relationship of the corresponding polynomial type, a verification result indicating receiving the task result is obtained.
[0051] In an implementation of the fifth aspect, generating a task result of the data processing task for a specified parameter based on the input information of the data processing task and the target zero-knowledge proof includes:
[0052] For each polynomial type, determine a specified result for each specified polynomial in a specified polynomial set for the polynomial type for the specified parameters, and obtain a specified result set for each polynomial type for the specified parameters;
[0053] Determine the vector inner product of the input information of the data processing task and the specified result set for the polynomial type to obtain a specified component;
[0054] Performing a weighted summation on the designated component and the proof component of the targeted polynomial type to obtain a target component of the targeted polynomial type;
[0055] Based on the target components of each polynomial type, a task result of the data processing task at the specified parameter is determined.
[0056] In the fifth aspect of the embodiment of the present application, based on the preset homomorphic secret sharing method, two zero-knowledge proofs are decrypted respectively to obtain two decrypted proof data; weighted sum of the elements of the same order in the two decrypted proof data is performed to obtain the target zero-knowledge proof; based on the input information of the data processing task and the target zero-knowledge proof, the task result of the data processing task for the specified parameters is generated; based on the preset multiple relationship of each polynomial type, the target zero-knowledge proof is verified to obtain a verification result indicating whether to receive the task result. In this way, the secure processing of data is achieved through the homomorphic secret sharing method, the privacy of data is protected, and the correctness and integrity of the calculation results are protected through the zero-knowledge proof method.
[0057] A sixth aspect of an embodiment of the present application provides a data processing device based on zero-knowledge proof, which is deployed in a verification node of a zero-knowledge proof system, including:
[0058] A receiving module is used to receive zero-knowledge proofs respectively sent by two computing nodes of the zero-knowledge proof system, wherein the zero-knowledge proof includes two proof components in ciphertext form of each polynomial type associated with the data processing task, and there is a preset multiple relationship between the two proof components, and the polynomial type is obtained based on an equivalent conversion for the data processing task.
[0059] A decryption module, used to decrypt the two zero-knowledge proofs respectively based on a preset homomorphic secret sharing method to obtain two decrypted proof data;
[0060] A summation module, used for performing weighted summation on the elements of the same bit sequence in the two decryption proof data to obtain the target zero-knowledge proof;
[0061] A second generating module, generating a task result of the data processing task for specified parameters based on the input information of the data processing task and the target zero-knowledge proof;
[0062] A verification module is used to verify the target zero-knowledge proof based on a preset multiple relationship of each polynomial type, and obtain a verification result for indicating whether to accept the task result.
[0063] The seventh aspect of an embodiment of the present application provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the computer device is a sending node of a zero-knowledge proof system, the processor implements the data processing method based on zero-knowledge proof as described in the first aspect when executing the computer program; when the computer device is a computing node of a zero-knowledge proof system, the processor implements the data processing method based on zero-knowledge proof as described in the third aspect when executing the computer program; when the computer device is a verification node of a zero-knowledge proof system, the processor implements the data processing method based on zero-knowledge proof as described in the fifth aspect when executing the computer program.
[0064] An eighth aspect of an embodiment of the present application provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the steps of the method described in the first, third, and fifth aspects are implemented.
[0065] It can be understood that the beneficial effects of the second, fourth, sixth, seventh and eighth aspects mentioned above can be found in the relevant descriptions in the first, second or third aspects mentioned above, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS
[0066] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.
[0067] Figure 1 Schematic diagram of the system structure of the zero-knowledge proof system provided in the embodiment of the present application;
[0068] Figure 2 It is a schematic diagram of a data processing method based on zero-knowledge proof applied to a sending node provided in an embodiment of the present application;
[0069] Figure 3 It is a schematic diagram of a method for determining a result set of a polynomial type provided in an embodiment of the present application;
[0070] Figure 4 It is a schematic diagram of a data processing method based on zero-knowledge proof applied to a computing node provided in an embodiment of the present application;
[0071] Figure 5 Schematic diagram of a method for generating a zero-knowledge proof provided in an embodiment of the present application;
[0072] Figure 6 It is a schematic diagram of a data processing method based on zero-knowledge proof applied to a verification node provided in an embodiment of the present application;
[0073] Figure 7 It is a schematic diagram of a verification method for task results provided in an embodiment of the present application;
[0074] Figure 8 is a schematic diagram of a method for determining a task result provided in an embodiment of the present application;
[0075] Fig. 9 is a schematic diagram of a data processing device based on zero-knowledge proof deployed at a receiving node provided in an embodiment of the present application;
[0076] Fig.10 is a schematic diagram of a data processing device based on zero-knowledge proof deployed on a computing node provided in an embodiment of the present application;
[0077] Fig.11 It is a schematic diagram of a data processing device based on zero-knowledge proof deployed on a verification node provided in an embodiment of the present application;
[0078] Fig.12 It is a schematic diagram of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0079] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.
[0080] It should be understood that when used in the present specification and the appended claims, the term "comprising" indicates the presence of described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.
[0081] It should also be understood that the term “and / or” used in the specification and appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.
[0082] As used in the specification and appended claims of this application, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [described condition or event] is detected" or "in response to detecting [described condition or event]", depending on the context.
[0083] In addition, in the description of the present application specification and the appended claims, the terms "first", "second", "third", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance.
[0084] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways.
[0085] In one embodiment, Figure 1As shown, a zero-knowledge proof system is provided for implementing the data processing method based on zero-knowledge proof provided in an embodiment of the present application. The zero-knowledge proof system includes a sending node 100 (sending nodes 100-1, 100-2 and 100-3 are shown in the figure), a computing node 200, a computing node 210 and a verification node 300. No data interaction is performed between the computing nodes 200 and the computing nodes 210.
[0086] In data processing tasks in various fields (such as medical large model calculations, financial data security, privacy delegated calculations, etc.), the sending node 100 is used to perform equivalent conversion on the data processing tasks to obtain polynomial sets for different polynomial types of the data processing tasks; based on the polynomial sets of each polynomial type and the type weight of each polynomial type, determine the result set of each polynomial type for specified parameters; based on a preset homomorphic secret sharing method, encrypt each of the result sets to obtain a proof ciphertext for generating a zero-knowledge proof; distribute the proof ciphertext and the input ciphertext encrypted based on the preset homomorphic secret sharing method to computing nodes 200 and computing nodes 210.
[0087] The computing node 200 (or computing node 210) is used to obtain the input ciphertext of the data processing task distributed by the sending node 100, the private key adapted to the preset homomorphic secret sharing method, and the proof ciphertext; based on the preset intermediate vector and the result set of each polynomial type in the proof ciphertext, generate a proof component of each polynomial type; based on the preset homomorphic secret sharing method, encrypt each proof component to generate a zero-knowledge proof; and send the zero-knowledge proof to the verification node 300.
[0088] Verification node 300 is used to receive zero-knowledge proofs respectively sent by computing node 200 and computing node 210; based on a preset homomorphic secret sharing method, decrypt the two zero-knowledge proofs respectively to obtain two decrypted proof data; perform weighted summation on elements of the same bit sequence in the two decrypted proof data to obtain a target zero-knowledge proof; based on input information of a data processing task and the target zero-knowledge proof, generate a task result of the data processing task for specified parameters; based on a preset multiple relationship of each polynomial type, verify the target zero-knowledge proof to obtain a verification result indicating whether to receive the task result.
[0089] In the application, assuming that the data processing task is a polynomial P(x) and the input information is x, the above-mentioned sending node, computing node, and verification node collaborate to complete the data processing process based on zero-knowledge proof in this application: First, the sending node adopts a preset homomorphic secret sharing method (such as homomorphic secret sharing based on lattice cryptography) to achieve privacy protection for the input information. The sending node encrypts the input data and distributes it to two computing nodes. Each computing node has a key that is compatible with the preset homomorphic secret sharing method, performs operations on the encrypted ciphertext, and outputs partial task results respectively.<P(x)> 0 and<P(x)> 1. The verification node can restore the plaintext task result P(x) through these partial task results, and verify the correctness of the task result through zero-knowledge proof technology.
[0090] The zero-knowledge proof system based on homomorphic secret sharing technology is provided in this embodiment. The homomorphic secret sharing technology is used to realize the secure processing of data and protect the privacy of data. The zero-knowledge proof technology is used to protect the correctness and integrity of the calculation results. Compared with the zero-knowledge proof system based on fully homomorphic encryption technology, the computational complexity is reduced by introducing an additional computing node in this embodiment. Compared with the zero-knowledge proof system based on secure multi-party computing technology, only two computing nodes are required in this embodiment, and no more computing nodes are required, which reduces the deployment difficulty. In addition, in this embodiment, there is no need for communication between computing nodes, which reduces the communication complexity and reduces the possibility of joint fraud between computing nodes.
[0091] In one embodiment, Figure 2 As shown, a data processing method based on zero-knowledge proof is provided, and the method is applied to a computer device (which can be Figure 1 The sending node in FIG. 1 is taken as an example to illustrate, and the method includes the following steps S101 to S104. Among them:
[0092] Step S101, performing equivalent conversion on the data processing task to obtain a polynomial set of different polynomial types for the data processing task.
[0093] In applications, for zero-knowledge application scenarios, data processing tasks in any field can be equivalently transformed through the quadratic arithmetic program (QAP) to obtain a set of polynomials for data processing tasks of different polynomial types.
[0094] Specifically, for the data processing task P(x), a quadratic arithmetic program Q of order d and size m is used, which is represented by the polynomial set and a d-order target polynomial t(x). That is, the quadratic operation program of the data processing task P(x) is Where m is the size of the entire quadratic operation program. is the set of left-hand polynomials, is the set of right-hand polynomials, is a set of output polynomials. The polynomial type can at least include target polynomial, left line polynomial, right line polynomial, output polynomial (also called negative polynomial), etc.
[0095] Step S102: determining a result set of each polynomial type for a specified parameter based on a polynomial set of each polynomial type and a type weight of each polynomial type.
[0096] In the application, the sending node sets a corresponding type weight for each polynomial type. The type weight indicates the importance of the polynomial set corresponding to the polynomial type in the task result. Based on the preset homomorphic secret sharing method, the value of the type weight is usually randomly selected from the trivial exclusion set on the ring corresponding to the data processing task. For example, for a polynomial type of left-line polynomial Set the type weight to r v , for polynomial type right line polynomial Set the type weight to r v , for polynomial type output polynomial Set the type weight to r y , where r y =r v ·r w .
[0097] In the application, the sending node calculates the result set of each polynomial type at the specified parameters, so as to generate zero-knowledge proofs based on each result set and verify the accuracy of the task results of the data processing task. Specifically, for each polynomial type, the sending node determines the product of the value of each polynomial at the reference parameter in the newly added polynomial set after QAP processing and the type weight as the result combination of the specified parameters for the polynomial type. For example, for the newly added polynomial set of the left line polynomial type l is the number of variables in the input information of P(x). The result set of each polynomial in this set at the specified parameter s is Combination type weight r v , the result set of the left line polynomial type is Similarly, the right-hand polynomial The result set at the specified parameter s is Output polynomial The result set at the specified parameter s is In applications, the polynomial type usually also includes an auxiliary polynomial, and the result set of the auxiliary polynomial at the specified parameter s is
[0098] Step S103, based on a preset homomorphic secret sharing method, encrypt each of the result sets to obtain a proof ciphertext for generating a zero-knowledge proof.
[0099] In the application, the sending node encrypts the result of each polynomial type based on a preset homomorphic secret sharing method E (such as a homomorphic secret sharing method based on a lattice cipher) to obtain a proof ciphertext for generating a zero-knowledge proof.
[0100] For example, the ciphertext form of the result set of the left-line polynomial type is The ciphertext form of the result set of the right-line polynomial type is The ciphertext form of the result set of the output polynomial type is In addition, in the application, an additional result set of auxiliary polynomial type will be added, and its ciphertext form is At the same time, the maximum d-order value set of the specified parameter Encryption is performed where the quadratic arithmetic program Q of the data processing task P(x) is of order d.
[0101] Step S104, distributes the proof ciphertext and the input ciphertext encrypted based on the preset homomorphic secret sharing method to two computing nodes of the zero-knowledge proof system, so that each computing node generates a zero-knowledge proof based on the preset homomorphic secret sharing method, the input ciphertext, and the proof ciphertext, and the two zero-knowledge proofs are used to assist the verification node of the zero-knowledge proof system to verify the correctness of the task result of the data processing task.
[0102] In the application, the sending node uses the public key pk of the preset homomorphic encryption method to encrypt the input information u=(a0,…,a l ) is used to encrypt and generate the input ciphertext which is also represented by a vector The sending node distributes the input ciphertext and the proof ciphertext to two servers, two independent computing nodes in the zero-knowledge proof system that do not interact with data. Each computing node can generate its own zero-knowledge proof based on the preset homomorphic secret sharing method, the input ciphertext of the data processing task, and the proof ciphertext. That is, the two computing nodes generate two zero-knowledge proofs with the same structure but different specific data.
[0103] In this embodiment, by performing equivalent conversion on the data processing task, a polynomial set for different polynomial types is obtained; based on the polynomial set of each polynomial type and the type weight of each polynomial type, a result set for each polynomial type for specified parameters is determined; based on a preset homomorphic secret sharing method, each result set is encrypted to obtain a proof ciphertext for generating a zero-knowledge proof; the proof ciphertext and the input ciphertext encrypted based on the preset homomorphic secret sharing method are distributed to two computing nodes of the zero-knowledge proof system, so that the complex data processing task is equivalently converted into a polynomial set including multiple polynomial types, and a proof ciphertext with low computational complexity is obtained, which can improve the verification efficiency of the zero-knowledge proof, and the encryption by the preset homomorphic secret sharing method can ensure the data privacy in the data processing process.
[0104] In one embodiment, Figure 3 As shown, the implementation process of step S102 includes the following steps S201 to S203. Among them:
[0105] Step S201: randomly select a type weight of each polynomial type from the ring structure corresponding to the data processing task.
[0106] In the application, various random parameters related to the data processing task are obtained from the ring structure of the data processing task. In the zero-knowledge proof process, the random parameters used include the type weight of each polynomial type, the preset multiple relationship between the proof variables corresponding to each polynomial type, etc.
[0107] Exemplarily, a random parameter s←A is selected on the ring corresponding to the above data processing task P(x) * ,r v ,r w ,α,α v ,α w ,α y ,β←R * , where A is an exception set on the ring, R is a trivial ring, and r is calculated. y =r v ·r w . r v ,r w Type weights for polynomial types, etc.
[0108] Step S202: for each of the polynomial types, determine the result of each polynomial in the polynomial set of the polynomial type for the specified parameter, and obtain an intermediate result set of the polynomial type.
[0109] In the application, for each polynomial type, the sending node determines the product of the value of each polynomial at the reference parameter and the type weight in the newly added polynomial set after QAP processing as the result of the specified parameter for the polynomial type. For example, for the newly added polynomial set of the left line polynomial type l is the number of variables in the input information of P(x). The intermediate result set of each polynomial in this set at the specified parameter s is Combination type weight r v , the result set of the left line polynomial type is Similarly, the right-hand polynomial The result set at the specified parameter s is Output polynomial The result set at the specified parameter s is
[0110] Step S203: determine the product of the type weight of the targeted polynomial type and each of the intermediate results in the intermediate result set of the targeted polynomial type, and obtain a result set for the targeted polynomial type with respect to the specified parameters.
[0111] Continuing with the above example, for the left line polynomial type, determine the intermediate result set at the specified parameter s as Combination type weight r v , the result set of the left line polynomial type is
[0112] In this embodiment, the correctness of the calculation result can be quickly confirmed without re-executing the entire calculation process, while also ensuring the privacy of data during the calculation process.
[0113] In one embodiment, the method further includes: encapsulating the proof ciphertext and the public key of the preset homomorphic secret sharing method into a public reference string and sharing it in the zero-knowledge proof system; encapsulating the public reference string, the private key adapted to the preset homomorphic secret sharing method, the specified parameters, and the weights of each polynomial type into a verification key, and sharing it in the zero-knowledge proof system.
[0114] In applications, in order to reduce the frequent reading of some shared data between participants in the zero-knowledge proof system, the shared data can be encapsulated into a common reference string (CRS) and shared in the zero-knowledge proof system. In this way, the receiving node, the verification node, and the two computing nodes in the zero-knowledge proof system can all read data from the common reference string.
[0115] Exemplarily, for the above data processing task, the content of its public reference string includes the following information:
[0116]
[0117] Where pk is the public key of the preset homomorphic secret sharing method. The verification key should be vk = (sk, crs, s, α, β, r v ,r w ,r y ).
[0118] In this implementation, the setting of the public reference string and the verification key can enable all participants in the zero-knowledge proof system to obtain relevant information without obstacles, thereby reducing the frequency of data interaction.
[0119] In one embodiment, Figure 4 As shown, a data processing method based on zero-knowledge proof is provided, and the method is applied to a computer device (which can be Figure 1 The computing node in FIG. 1 is taken as an example to illustrate, and the method includes the following steps S301 to S304. Among them:
[0120] Step S301, obtaining the input ciphertext of the data processing task distributed by the sending node of the zero-knowledge proof system, the private key adapted to the preset homomorphic secret sharing method, and the proof ciphertext.
[0121] Among them, the input ciphertext is obtained by the sending node encrypting the input information of the data processing task based on the preset homomorphic secret sharing method, the proof ciphertext is obtained by the sending node encrypting the result set of each polynomial type based on the preset homomorphic secret sharing method, the result set is determined by the sending node based on the data processing task for each polynomial type and the type weight of each polynomial type relative to the specified parameter, and the polynomial set of each polynomial type is obtained by performing equivalent transformation on the data processing task.
[0122] Step S302: Generate a proof component of each polynomial type based on a preset intermediate vector and a result set of each polynomial type in the proof ciphertext.
[0123] In the application, the computing node uses the private key sk0 adapted to the preset homomorphic secret sharing method (the other computing node uses sk1) to decrypt the input ciphertext At this time, the computing node does not obtain the plaintext input vector, and the decryption result is only a ring component of the plaintext. However, based on the operational properties of homomorphic secret sharing on the ring, even if the input vector is a ring component, ordinary addition and multiplication operations can be performed, and the result obtained is also a ring component. Based on this property, the computing node determines the proof component corresponding to each polynomial type. The proof component is usually calculated by the computing node based on the preset intermediate vector and the result set of each polynomial type in the proof ciphertext.
[0124] Step S303: Based on the preset homomorphic secret sharing method, encrypt each of the proof components to generate a zero-knowledge proof.
[0125] In the application, the computing node uses the preset homomorphic secret sharing method E to encrypt the proof components of each polynomial type and generate a zero-knowledge proof.
[0126] For example, the proof component of the left polynomial is The proof component of the right-hand polynomial is The proof component of the output polynomial is The proof weight for proving a polynomial is The proof component of the auxiliary polynomial is, F = E (L β (s)), L span =r v v mid (s)+r w w mid (s)+r y y mid (s). According to each proof component, we get the zero-knowledge proof in, between, between, between, There is a multiple (α) relationship between them in plaintext.
[0127] Step S304: sending the zero-knowledge proof to a verification node of the zero-knowledge proof system, so that the verification node verifies the correctness of the task result of the data processing task based on the zero-knowledge proof.
[0128] In the application, the computing node will prove its own zero-knowledge The data is sent to a verification node of a zero-knowledge proof system so that the verification node verifies the correctness of the task result of the data processing task based on the zero-knowledge proof.
[0129] In this embodiment, each computing node has a key, performs operations on the encrypted proof ciphertext, and the two computing nodes output their own zero-knowledge proofs. The deployment method only requires two computing nodes, and no more computing nodes are required, which reduces the deployment difficulty of the zero-knowledge proof system. In addition, there is no need for communication between the two computing nodes, which reduces the complexity of communication and the possibility of joint fraud between servers.
[0130] The input information is encrypted using homomorphic secret sharing to obtain ciphertext; each computing server has a computing key and performs operations on the encrypted ciphertext, and the two computing servers output their respective partial computing results; a zero-knowledge proof with secret sharing properties is generated for each of the two partial computing results, so that the correctness and integrity of the result can be guaranteed. The present invention uses homomorphic secret sharing technology and zero-knowledge proof technology to realize a zero-knowledge proof system that protects computing privacy and result integrity.
[0131] In one embodiment, Figure 5 As shown, the implementation process of step S302 includes the following steps S401 to S403. Among them:
[0132] Step S401 : for each polynomial type, based on the weight of the polynomial type, weight removal is performed on each result in the result set of the polynomial type to obtain a combination of intermediate results of the polynomial type.
[0133] In the application, a result set of each polynomial type is obtained, and a weight is removed from each result in the result set to obtain an intermediate result set of each polynomial type.
[0134] For example, the result set of the left-line polynomial encryption is Decrypted result set The type weight of the left line polynomial is r v , the intermediate result set after weight removal is Similarly, the intermediate result set after the right line polynomial weights are removed is The intermediate result set after outputting the polynomial weights is removed is
[0135] Step S402, determining the vector inner product of the intermediate result set of the targeted polynomial type and the preset intermediate vector, and obtaining the first proof component corresponding to the targeted polynomial type.
[0136] In the application, the computing node obtains the preset intermediate variable w=(a l+1 ,…,a m ), the first proof component of each polynomial type is determined as follows: the left line polynomial set The intermediate result set at point s and the preset intermediate vector w=(a l+1 ,…,a m )'s vector inner product gives the first proof component v of the left polynomial mid (s), Similarly, the first proof component of the right polynomial can be determined Output the first proof component of the polynomial
[0137] In the application, the polynomial type also includes the proof polynomial. The computing node determines the value h(s) of the proof polynomial at point s by the proof expression formula v(x)w(x)-y(x)=h(x)t(x) of the quadratic operation program. h(s) is the value of the proof polynomial at point s, which is Parameters of the auxiliary polynomial
[0138] Step S403: Generate a zero-knowledge proof based on the first proof component of each polynomial type and the second proof component obtained by increasing the first proof component by a specified multiple.
[0139] In the application, the proof component of each polynomial type generally includes a first proof component and a second proof component, wherein the second proof component is obtained by increasing the first proof component by a specified multiple. Different preset specified multiples are set for different polynomial types.
[0140] For example, the first proof component v of the left polynomial mid (s), whose preset specified multiple is α, then the second proof component αv of the left polynomial mid (s).
[0141] In this embodiment, the method of determining the zero-knowledge proof by weight removal can improve the accuracy of generating the zero-knowledge proof and reduce the error.
[0142] In one embodiment, Figure 6 As shown, a data processing method based on zero-knowledge proof is provided, and the method is applied to a computer device (which can be Figure 1 The verification node in FIG. 1 is taken as an example to illustrate, and the method includes the following steps S501 to S505. Among them:
[0143] Step S501, receiving zero-knowledge proofs respectively sent by two computing nodes of the zero-knowledge proof system, wherein the zero-knowledge proof includes two proof components in ciphertext form of each polynomial type associated with the data processing task, and there is a preset multiple relationship between the two proof components, and the polynomial type is obtained based on an equivalent conversion for the data processing task.
[0144] In the application, the verification node receives zero-knowledge proofs from two computing nodes, where the zero-knowledge proofs include proof components of each polynomial type, each polynomial type of proof component includes two, and the two proof components have a preset multiple relationship.
[0145] For example, the zero-knowledge proof sent by the computing node numbered 0 is Zero-knowledge proof sent by computing node number 1
[0146] Step S502: based on a preset homomorphic secret sharing method, the two zero-knowledge proofs are decrypted respectively to obtain two decrypted proof data.
[0147] In the application, the verification node uses the preset homomorphic secret sharing E to decrypt the zero-knowledge proofs of the two computing nodes respectively. Restore the data encrypted by each element, where A decrypts to v mid (s), Decrypted to αv mid (s), B decrypts to w mid (s), Decrypted to αw mid (s), C decrypts to y mid (s), Decrypted to αy mid (s), D decrypts to h(s), Decrypted to αh(s), F decrypted to L β (s), and use the verification key and the decryption result to calculate L span =r v v mid (s)+r w w mid (s)+r y y mid (s).
[0148] Step S503, performing weighted summation on the elements of the same bit sequence in the two decryption proof data to obtain the target zero-knowledge proof.
[0149] In the application, the verifier performs a weighted sum of the elements of the same order in the zero-knowledge proofs of two computing nodes to obtain the target zero-knowledge proof.
[0150] That is v mid (s) = A0 + A1 (A0, A1 is v mid (s) in ciphertext form on two computing nodes), similarly, w mid (s) = B0 + B1, y mid (s) = C0 + C, h(s)=D0+D1, L β (s) = F0 + F1, and determine L span =r v v mid (s)+r w w mid (s)+r y y mid (s).
[0151] Step S504: generating a task result of the data processing task for specified parameters based on the input information of the data processing task and the target zero-knowledge proof.
[0152] In the application, the verification node uses the input vector u=(a0,…,a l ) and the target zero-knowledge proof determine the task result of the data processing P(s) task at the specified parameter s, and the determination method is as follows:
[0153]
[0154] Step S505: verify the target zero-knowledge proof based on the preset multiple relationship of each polynomial type to obtain a verification result indicating whether to accept the task result.
[0155] In the application, the verification node checks the decryption result v mid (s),αv mid (s) between mid (s),αw mid (s) between, y mid (s),αy mid (s), h(s), αh(s) whether there is a preset multiple relationship (α times), these three items are about the correctness of zero-knowledge proof; check L β (s), and L spam Whether there is a preset multiple relationship (β times) between them, this check is about the consistency of the calculation results of the calculation node; check whether αh(a)t(s) and P(s) are equal, this check is about whether the proof expression formula v(x)w(x)-y(x)=h(x)t(x) of the quadratic operation program is correctly expressed at point s, that is, the correctness of the server calculation result. If the verification node detects that all the above relationships are checked, the verification is successful and a prompt message indicating that the task result can be received is obtained. Otherwise, the verification fails and the task result is refused to be received.
[0156] In this embodiment, data security processing is achieved through homomorphic secret sharing to protect data privacy, and the correctness and integrity of the task results of the data processing task are protected through the verification operation of zero-knowledge proof on two computing nodes.
[0157] In one embodiment, Figure 7 As shown, the implementation process of step S505 includes the following steps S601 to S603. Among them:
[0158] Step S601: for each polynomial type, obtain a pair of proof components corresponding to the polynomial type from the target zero-knowledge proof.
[0159] In the application, the proof components of each polynomial type in the target zero-knowledge proof appear in pairs, and each pair of proof components has a preset multiple relationship.
[0160] Step S602, verify each pair of the proof components to obtain a verification result.
[0161] In the application, the verification node checks the multiple relationship of each proof component pair and obtains the corresponding verification result.
[0162] Step S603: If the verification result indicates that the two proof components in the proof component pairs of each polynomial type have a preset multiple relationship of the corresponding polynomial type, a verification result indicating receiving the task result is obtained.
[0163] In the application, if the verification result represents that both proof components in the proof component of each polynomial type satisfy the preset multiple relationship of the corresponding polynomial type, indicating that the correctness of the zero-knowledge evidence and the correctness of the task result have been verified, then a verification result indicating the reception of the task result can be obtained.
[0164] In this embodiment, the correctness and integrity of the task results of the data processing task are protected by a zero-knowledge proof verification operation on two computing nodes.
[0165] In one embodiment, Figure 8 As shown, the implementation process of step S504 includes the following steps S701 to S704. Among them:
[0166] Step S701 : for each polynomial type, determine a specified result for each specified polynomial in a specified polynomial set for the specified polynomial type for specified parameters, and obtain a specified result set for each polynomial type for the specified parameters.
[0167] In the application, for each polynomial type, a specified polynomial set under a specified scale is determined, wherein the specified scale is the vector size of an input vector represented by a data processing task in a vector form. And a specified result of each specified polynomial in the specified polynomial set for a specified parameter is determined to obtain a specified result set for each polynomial type.
[0168] Exemplarily, for the left line polynomial, the specified polynomial set under the specified scale e is The specified result set of the specified polynomial set at the specified parameter s is Similarly, the specified result set of the right-hand polynomial is The specified result set of the output polynomial is
[0169] Step S702: determine the vector inner product of the input information of the data processing task and the specified result set for the polynomial type to obtain the specified component.
[0170] In the application, the input information of the data processing task is represented by a vector, and the specified result set of each polynomial type can also be represented by a vector, and the scale of the two vectors is the same. The verification node determines the vector inner product of the input information and the specified result set and uses it as the specified component.
[0171] Exemplarily, the specified components of the left polynomial are The specified components of the right-hand polynomial are The specified components of the output polynomial are
[0172] Step S703: Perform weighted summation on the designated component and the proof component of the targeted polynomial type to obtain the target component of the targeted polynomial type.
[0173] In the application, for each polynomial type, its designated component and the associated proof component are weighted summed to obtain the target component of each polynomial type.
[0174] Exemplarily, the specified components of the left polynomial are Prove that the weight is v mid (s), the target component is The specified components of the right-hand polynomial are Prove that the weight is w mid (s), the target component is The specified components of the output polynomial are Prove that the weight is y mid (s), the target component is
[0175] Step S704: determining the task result of the data processing task at the specified parameters based on the target components of each polynomial type.
[0176] In the application, the verification node substitutes the target components of each polynomial type into the arithmetic expression of the data processing task to obtain the task result of the data processing task at the specified parameters.
[0177] Exemplarily, the task result of the data processing task P(x) at the specified parameter s is as follows:
[0178]
[0179] In this embodiment, the method of determining the task result based on the specified component and the target component of each polynomial type can improve the calculation accuracy of the task result.
[0180] In one embodiment, the above data processing method can be applied to a privacy data entrusted computing scenario. The privacy entrusted computing scenario generally refers to the need for organizations and individuals to entrust data processing tasks to third-party computing services, such as cloud computing platforms. The implementation process of the data processing method of the embodiment of the present application in this scenario is as follows:
[0181] Assume that the data sender is responsible for homomorphic secret sharing of the original data, generating encrypted data and sending it to two servers. Server A and Server B receive the encrypted data and perform homomorphic calculations respectively to generate calculation results and zero-knowledge proofs. The data receiver receives the calculation results and zero-knowledge proofs generated by the server to verify the correctness of the data.
[0182] First, the data sender (sending node) uses homomorphic secret sharing technology to encrypt the data to be transmitted to ensure the privacy and security of the data, and generates a public key pk, private key sk0, sk1 and verification key vk. The encrypted data and encryption key are sent to two different cloud service (computing node) providers, and the public key and verification key are made public.
[0183] Secondly, each cloud server provider uses the zero-knowledge proof system of the two servers to perform the entrusted computing tasks on the encrypted private data, generate the calculation results, and generate a zero-knowledge proof, which is sent to the data recipient (receiving node).
[0184] Finally, the data recipient can verify the correctness of the calculation results with the public key and verification key.
[0185] In this embodiment, the efficiency of data processing and verification is significantly improved, the complexity of system deployment is reduced, and the privacy and security of data are ensured. The system has high application value and can be widely used in the fields of information security, data privacy protection, etc.
[0186] The present application also provides a data processing device based on zero-knowledge proof, which is used to execute the steps in the above data processing method embodiment based on zero-knowledge proof. The data processing device based on zero-knowledge proof is deployed in the sending node of the zero-knowledge proof system. Fig. 9 As shown, the data processing device 700 based on zero-knowledge proof provided in the embodiment of the present application includes:
[0187] The conversion module 710 is used to perform equivalent conversion on the data processing task to obtain a polynomial set of different polynomial types for the data processing task.
[0188] The determination module 720 is configured to determine a result set for each polynomial type with respect to a specified parameter based on the polynomial set of each polynomial type and the type weight of each polynomial type.
[0189] The first encryption module 730 is used to encrypt each of the result sets based on a preset homomorphic secret sharing method to obtain a proof ciphertext for generating a zero-knowledge proof.
[0190] The distribution module 740 is used to distribute the proof ciphertext and the input ciphertext encrypted based on the preset homomorphic secret sharing method to the two computing nodes of the zero-knowledge proof system, so that each computing node generates a zero-knowledge proof based on the preset homomorphic secret sharing method, the input ciphertext, and the proof ciphertext. The two zero-knowledge proofs are used to assist the verification node of the zero-knowledge proof system in verifying the correctness of the task results of the data processing task.
[0191] In one embodiment, the determination module is also used to randomly select a type weight for each polynomial type from the ring structure corresponding to the data processing task; for each of the polynomial types, determine the result of each polynomial in the polynomial set of the targeted polynomial type for the specified parameters to obtain an intermediate result set of the targeted polynomial type; determine the product of the type weight of the targeted polynomial type and each of the intermediate results in the intermediate result set of the targeted polynomial type to obtain a result set of the targeted polynomial type for the specified parameters.
[0192] In one embodiment, the second verification module is also used to encapsulate the proof ciphertext and the public key of the preset homomorphic secret sharing method into a public reference string and share it in the zero-knowledge proof system; encapsulate the public reference string, the private key adapted to the preset homomorphic secret sharing method, the specified parameters, and the weights of each polynomial type into a verification key, and share it in the zero-knowledge proof system.
[0193] The present application also provides a data processing device based on zero-knowledge proof, which is used to execute the steps in the above data processing method embodiment based on zero-knowledge proof. The data processing device based on zero-knowledge proof is deployed in a computing node of a zero-knowledge proof system, and the number of computing nodes is two. Fig.10 As shown, the data processing device 800 based on zero-knowledge proof provided in the embodiment of the present application includes:
[0194] The acquisition module 810 is used to obtain the input ciphertext of the data processing task distributed by the sending node of the zero-knowledge proof system, the private key adapted to the preset homomorphic secret sharing method, and the proof ciphertext.
[0195] The first generating module 820 is used to generate a proof component of each polynomial type based on a preset intermediate vector and a result set of each polynomial type in the proof ciphertext.
[0196] The second encryption module 830 is used to encrypt each of the proof components based on the preset homomorphic secret sharing method to generate a zero-knowledge proof.
[0197] The sending module 840 is used to send the zero-knowledge proof to the verification node of the zero-knowledge proof system, so that the verification node verifies the correctness of the task result of the data processing task based on the zero-knowledge proof, wherein the input ciphertext is obtained by the sending node encrypting the input information of the data processing task based on the preset homomorphic secret sharing method, the proof ciphertext is obtained by the sending node encrypting the result set of each polynomial type based on the preset homomorphic secret sharing method, the result set is determined by the sending node based on the data processing task for each polynomial type and the type weight of each polynomial type relative to the specified parameter, and the polynomial set of each polynomial type is obtained by performing an equivalent conversion on the data processing task.
[0198] In one embodiment, the generation module is further used to, for each polynomial type, remove the weight of each result in the result set of the targeted polynomial type based on the weight of the targeted polynomial type, and obtain a combination of intermediate results of the targeted polynomial type; determine the vector inner product of the intermediate result set of the targeted polynomial type and a preset intermediate vector to obtain a first proof component corresponding to the targeted polynomial type; generate a zero-knowledge proof based on the first proof component of each of the polynomial types and a second proof component that increases the first proof component by a specified multiple.
[0199] The present application also provides a data processing device based on zero-knowledge proof, which is used to execute the steps in the above data processing method embodiment based on zero-knowledge proof. The data processing device based on zero-knowledge proof is deployed in the verification node of the zero-knowledge proof system. Fig.11 As shown, the data processing device 900 based on zero-knowledge proof provided in the embodiment of the present application includes:
[0200] The receiving module 910 is used to receive zero-knowledge proofs respectively sent by two computing nodes of the zero-knowledge proof system, wherein the zero-knowledge proof includes two proof components in ciphertext form of each polynomial type associated with the data processing task, and there is a preset multiple relationship between the two proof components. The polynomial type is obtained based on an equivalent conversion for the data processing task.
[0201] The decryption module 920 is used to decrypt the two zero-knowledge proofs respectively based on a preset homomorphic secret sharing method to obtain two decrypted proof data.
[0202] The summing module 930 is used to perform weighted summation on the elements of the same bit sequence in the two decryption proof data to obtain the target zero-knowledge proof.
[0203] The second generating module 940 generates a task result of the data processing task for specified parameters based on the input information of the data processing task and the target zero-knowledge proof.
[0204] The verification module 950 is used to verify the target zero-knowledge proof based on the preset multiple relationship of each polynomial type, and obtain a verification result for indicating whether to accept the task result.
[0205] In one embodiment, the verification module is further used to obtain, for each polynomial type, a pair of proof components corresponding to the target zero-knowledge proof; to verify each pair of proof components to obtain a verification result; if the verification result indicates that two proof components in the pair of proof components of each polynomial type have a preset multiple relationship of the corresponding polynomial type, then a verification result indicating reception of the task result is obtained.
[0206] In one embodiment, the generation module is further used to determine, for each polynomial type, a specified result of each specified polynomial in a specified polynomial set for the polynomial type for a specified parameter, to obtain a specified result set for each polynomial type for the specified parameter; determine a vector inner product of the input information of the data processing task and the specified result set for the polynomial type to obtain a specified component; perform weighted summation of the specified component and the proof component of the polynomial type to obtain a target component of the polynomial type; and determine a task result of the data processing task at the specified parameter based on the target component of each polynomial type.
[0207] The present application also provides a data processing device based on zero-knowledge proof, which is used to execute the steps in the above data processing method embodiment based on zero-knowledge proof. The data processing device based on zero-knowledge proof is deployed in a gateway device in a zero-trust network environment. Fig.10 As shown, the data processing device 1000 based on zero-knowledge proof provided in the embodiment of the present application includes:
[0208] The receiving module is used to receive a data processing request for a namespace from a remote node.
[0209] The second parsing module is used to parse the data processing request to obtain a remote service instance, an access object and a target service instance. The remote service instance depends on the remote node to run, and the target service instance depends on the namespace to run.
[0210] The second verification module is used to perform pairing verification on the remote node and the proxy node associated with the namespace to obtain a verification result.
[0211] A redirection module is used to redirect the data processing request to the proxy node if the verification result indicates that resource interaction can be performed between the proxy node and the remote node, so that the proxy node responds to the data processing request based on the target service instance and returns a response result.
[0212] In one embodiment, the data processing request is encapsulated in a preset protocol format, and in the zero-trust network environment, the preset protocol format is broadcast so that the proxy nodes associated with each namespace and each remote node encapsulate the data processing request based on the preset protocol format.
[0213] In applications, each module in a data processing device based on zero-knowledge proof may be a software program module, or may be implemented through different logic circuits integrated in a processor, or may be implemented through multiple distributed processors.
[0214] Fig.12A computer device (which may be a computer device) for implementing a data processing method based on zero-knowledge proof provided in an embodiment of the present application Figure 1 The schematic diagram of the structure of the sending node, computing node, and verification node in the example. Fig.12 As shown, the computer device 1000 of this embodiment includes: at least one processor 1010 ( Fig.12 Only one is shown in the figure) a processor, a memory 1020, and a computer program 1030 stored in the memory 1020 and executable on the at least one processor 1010, and when the processor 1010 executes the computer program 1030, the steps in any of the above-mentioned data processing method embodiments based on zero-knowledge proof are implemented.
[0215] The computer device 1000 may be a computing device such as a desktop computer, a notebook, a PDA, or a cloud server. The computer device 1000 may include, but is not limited to, a processor 1010 and a memory 1020. Those skilled in the art will appreciate that Fig.12 The computer device 1000 is merely an example and does not constitute a limitation on the computer device 1000 . The computer device 1000 may include more or fewer components than shown in the figure, or a combination of certain components, or different components. For example, the computer device 1000 may also include input and output devices, network access devices, etc.
[0216] The processor 1010 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.
[0217] In some embodiments, the memory 1020 may be an internal storage unit of the computer device 1000, such as a hard disk or memory of the computer device 1000. In other embodiments, the memory 1020 may also be an external storage device of the computer device 1000, such as a plug-in hard disk, a smart memory card (SmartMedia Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. equipped on the computer device 1000. Further, the memory 1020 may also include both an internal storage unit of the computer device 1000 and an external storage device. The memory 1020 is used to store an operating system, an application program, a boot loader (BootLoader), data, and other programs, such as the program code of the computer program, etc. The memory 1020 may also be used to temporarily store data that has been output or is to be output.
[0218] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of the present application. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.
[0219] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.
[0220] An embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in the above-mentioned method embodiments can be implemented.
[0221] An embodiment of the present application provides a computer program product. When the computer program product is run on a computer device, the computer device can implement the steps in the above-mentioned method embodiments when executing the computer device.
[0222] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the processes in the above-mentioned embodiment method, which can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may at least include: any entity or device that can carry the computer program code to a computer device, a recording medium, a computer memory, a read-only memory (ROM), a random access memory (RAM), an electric carrier signal, a telecommunication signal, and a software distribution medium. For example, a USB flash drive, a mobile hard disk, a magnetic disk or an optical disk. In some jurisdictions, according to legislation and patent practice, computer-readable media cannot be electric carrier signals and telecommunication signals.
[0223] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0224] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.
[0225] In the embodiments provided in the present application, it should be understood that the disclosed devices / network equipment and methods can be implemented in other ways. For example, the device / network equipment embodiments described above are merely schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0226] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0227] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.
Claims
1. A data processing method based on zero-knowledge proof, It is characterized in that The sending nodes used in the zero-knowledge proof system include: Performing equivalent conversion on the data processing task to obtain a polynomial set of different polynomial types for the data processing task; Determine a result set of each polynomial type for a specified parameter based on a polynomial set of each polynomial type and a type weight of each polynomial type; Based on a preset homomorphic secret sharing method, encrypt each of the result sets to obtain a proof ciphertext for generating a zero-knowledge proof; The proof ciphertext and the input ciphertext encrypted based on the preset homomorphic secret sharing method are distributed to two computing nodes of the zero-knowledge proof system, so that each computing node generates a zero-knowledge proof based on the preset homomorphic secret sharing method, the input ciphertext, and the proof ciphertext. The two zero-knowledge proofs are used to assist the verification node of the zero-knowledge proof system in verifying the correctness of the task results of the data processing task.
2. The data processing method based on zero-knowledge proof as claimed in claim 1, It is characterized in that The determining, based on the polynomial set of each polynomial type and the type weight of each polynomial type, a result set of each polynomial type for a specified parameter comprises: Randomly selecting a type weight for each polynomial type from the ring structure corresponding to the data processing task; For each of the polynomial types, determining the result of each polynomial in the polynomial set of the polynomial type for the specified parameter, and obtaining an intermediate result set of the polynomial type; The product of the type weight of the targeted polynomial type and each of the intermediate results in the intermediate result set of the targeted polynomial type is determined to obtain a result set for the targeted polynomial type with respect to the specified parameters.
3. The data processing method based on zero-knowledge proof as claimed in claim 1, It is characterized in that The method further comprises: Encapsulating the proof ciphertext and the public key of the preset homomorphic secret sharing method into a public reference string and sharing the public reference string in the zero-knowledge proof system; The public reference string, a private key adapted to a preset homomorphic secret sharing method, designated parameters, and weights of each polynomial type are encapsulated into a verification key and shared in the zero-knowledge proof system.
4. A data processing method based on zero-knowledge proof, It is characterized in that The computing nodes applied to the zero-knowledge proof system are two in number, including: Obtaining the input ciphertext of the data processing task distributed by the sending node of the zero-knowledge proof system, the private key adapted to the preset homomorphic secret sharing method, and the proof ciphertext; Generate a proof component of each polynomial type based on a preset intermediate vector and a result set of each polynomial type in the proof ciphertext; Based on the preset homomorphic secret sharing method, encrypt each of the proof components to generate a zero-knowledge proof; Sending the zero-knowledge proof to a verification node of the zero-knowledge proof system so that the verification node verifies the correctness of the task result of the data processing task based on the zero-knowledge proof; Among them, the input ciphertext is obtained by the sending node encrypting the input information of the data processing task based on the preset homomorphic secret sharing method, the proof ciphertext is obtained by the sending node encrypting the result set of each polynomial type based on the preset homomorphic secret sharing method, the result set is determined by the sending node based on the data processing task for each polynomial type and the type weight of each polynomial type relative to the specified parameter, and the polynomial set of each polynomial type is obtained by performing equivalent transformation on the data processing task.
5. The data processing method based on zero-knowledge proof as claimed in claim 4, It is characterized in that The generating of the proof components of each polynomial type based on the preset intermediate vector and the result set of each polynomial type in the proof ciphertext includes: For each polynomial type, based on the weight of the polynomial type, weight removal is performed on each result in the result set of the polynomial type to obtain a combination of intermediate results of the polynomial type; Determine the vector inner product of the intermediate result set of the targeted polynomial type and the preset intermediate vector to obtain a first proof component corresponding to the targeted polynomial type; A zero-knowledge proof is generated based on a first proof component of each polynomial type and a second proof component obtained by increasing the first proof component by a specified multiple.
6. A data processing method based on zero-knowledge proof, It is characterized in that Verification nodes used in zero-knowledge proof systems include: Receiving zero-knowledge proofs respectively sent by two computing nodes of the zero-knowledge proof system, the zero-knowledge proof comprising two proof components in ciphertext form of respective polynomial types associated with the data processing task, a preset multiple relationship between the two proof components, and the polynomial type being obtained based on equivalent conversion for the data processing task; Based on a preset homomorphic secret sharing method, the two zero-knowledge proofs are decrypted respectively to obtain two decrypted proof data; Performing weighted summation on the elements of the same bit order in the two decryption proof data to obtain the target zero-knowledge proof; Based on the input information of the data processing task and the target zero-knowledge proof, generating a task result of the data processing task for specified parameters; Based on the preset multiple relationship of each polynomial type, the target zero-knowledge proof is verified to obtain a verification result indicating whether to accept the task result.
7. The data processing method based on zero-knowledge proof as claimed in claim 6, It is characterized in that The verifying the target zero-knowledge proof based on the preset multiple relationship of each polynomial type to obtain a verification result indicating whether to receive the task result includes: For each polynomial type, obtaining a proof component pair corresponding to the polynomial type from the target zero-knowledge proof; Testing each pair of the proof components to obtain a test result; If the verification result indicates that two proof components in the proof component pair of each polynomial type have a preset multiple relationship of the corresponding polynomial type, a verification result indicating receiving the task result is obtained.
8. The data processing method based on zero-knowledge proof as claimed in claim 6, It is characterized in that The step of generating a task result of the data processing task for a specified parameter based on the input information of the data processing task and the target zero-knowledge proof includes: For each polynomial type, determine a specified result for each specified polynomial in a specified polynomial set for the polynomial type for the specified parameters, and obtain a specified result set for each polynomial type for the specified parameters; Determine the vector inner product of the input information of the data processing task and the specified result set for the polynomial type to obtain a specified component; Performing a weighted summation on the designated component and the proof component of the targeted polynomial type to obtain a target component of the targeted polynomial type; Based on the target components of each polynomial type, a task result of the data processing task at the specified parameter is determined.
9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, It is characterized in that When the computer device is a sending node of a zero-knowledge proof system, the processor implements the data processing method based on zero-knowledge proof according to any one of claims 1 to 3 when executing the computer program; When the computer device is a computing node of a zero-knowledge proof system, the processor implements the data processing method based on zero-knowledge proof as claimed in claim 4 or 5 when executing the computer program; When the computer device is a verification node of a zero-knowledge proof system, the processor implements the data processing method based on zero-knowledge proof as described in any one of claims 6 to 8 when executing the computer program.
10. A computer-readable storage medium storing a computer program. It is characterized in that When the computer program is executed by a processor, the data processing method based on zero-knowledge proof as described in any one of claims 1 to 8 is implemented.
Citation Information
Cited By
Power transaction method and system based on homomorphic secret sharing and zero-knowledge proof
CN119579317A
