Zero-knowledge proof method and electronic device

Patent metadata

Field	Value
Publication number	US-11550952-B1
Application number	US-202217751646-A
Country	US
Kind code	B1
Filing date	May 23, 2022
Priority date	Sep 22, 2021
Publication date	Jan 10, 2023
Grant date	Jan 10, 2023

Abstract

Disclosed is a method and an apparatus a zero-knowledge proof and an electronic device. That method comprise the following steps: selecting a data processing relationship, and processing private data and public data to obtain a calculation result; respectively committing the private data and the calculation result according to a commitment parameter to obtain a first commitment value and a second commitment value, wherein the commitment parameter is generated by a trusted third party; generating a non-interactive zero-knowledge proof according to the data processing relationship; wherein the commitment parameter, the first commitment value and the second commitment value are used by a verifier to verify the non-interactive zero-knowledge proof. The present disclosure solves the technical problem that bilinear pairing cannot be used in the scenario where bilinear pairing cannot be used in related technologies.

First claim

What is claimed is:

1. An electronic device, comprising:
one or more processors; and
a memory for storing one or more programs;
wherein when the one or more programs are executed by the one or more processors, the one or more processors is caused to realize a zero-knowledge proof method applied to a proof sender, comprising the following steps of:
selecting a data processing relationship, and processing private data and public data to obtain a calculation result;
committing the private data and the calculation result, respectively, according to a commitment parameter to obtain a first commitment value and a second commitment value, wherein the commitment parameter is generated by a trusted third party; and
generating a non-interactive zero-knowledge proof according to the data processing relationship to enable a verifier to verify the non-interactive zero-knowledge proof according to the commitment parameter, the public data, the first commitment value and the second commitment value;
wherein the step of selecting a data processing relationship, and processing private data and public data to obtain a calculation result comprises:
selecting one relationship from two data processing relationships, namely a linear relationship and a generalized multiplication relationship, as the data processing relationship;
wherein when the data processing relationship is a linear relationship, the private data is a i , the public data is b i , a number of data of the private data and the public data is n, and the calculation result is c=Σ n i=1 a i b i ; and
wherein when a generalized multiplication relation is selected, the private data is d i , e i , the public data is x i , y i , the number of data of the private data d i and the public data x i is n 1 , the number of data of the private data e i and the public data y i , is n 2 , and the calculation result is z=Σ n1 i=1 d i x i ·Σ n2 i=1 e i y i ;
the step of generating a non-interactive zero-knowledge proof according to the data processing relationship comprises:
generating an offset term according to the data processing relationship;
inputting the commitment parameter, the first commitment value, the second commitment value and the offset term into a random oracle machine to generate a challenge value according to the data processing relationship;
obtaining a response value by calculation according to the private data, the public data and the challenge value; and generating the non-interactive zero-knowledge proof according to the offset term and the response value.

2. The method according to claim 1 , further comprising:
sending the first commitment value, the second commitment value and the non-interactive zero-knowledge proof to a public data storage system, wherein the commitment parameter is stored in the public data storage system by the trusted third party, and the public data is stored in the public data storage system.

3. The method according to claim 1 , wherein the step of the verifier verifying the non-interactive zero-knowledge proof according to the commitment parameter, the public data, the first commitment value and the second commitment value comprises:
inputting the commitment parameter, the first commitment value, the second commitment value and the offset term into the random oracle machine to output the challenge value; and
verifying the non-interactive zero-knowledge proof according to the public data, the first commitment value, the second commitment value and the challenge value.

4. An electronic device, comprising:
one or more processors; and
a memory for storing one or more programs;
wherein when the one or more programs are executed by the one or more processors, the one or more processors is caused to realize a zero-knowledge proof method applied to a verifier, comprising the following steps of:
acquiring a commitment parameter, public data, a first commitment value, a second commitment value and a non-interactive zero-knowledge proof, wherein the commitment parameter is generated by a trusted third party; the first commitment value and the second commitment value are obtained by selecting, by a proof sender, a data processing relationship to process private data and public data to obtain a calculation result, and committing the private data and the calculation result according to the commitment parameter, respectively; the non-interactive zero-knowledge proof is generated by the proof sender according to the data processing relationship; and
verifying the non-interactive zero-knowledge proof according to the commitment parameter, the public data, the first commitment value and the second commitment value;
wherein the step of selecting a data processing relationship to process private data and public data to obtain a calculation result comprises:
selecting one relationship from two data processing relationships, namely a linear relationship and a generalized multiplication relationship, as the data proc wherein when the data processing relationship is a linear relationship, the private data is a i , the public data is b i , a number of data of the private data and the public data is n, and the calculation result is c=Σ n i=1 a i b i ; and
wherein when a generalized multiplication relation is selected, the private data is d i , e i , the public data is x i , y i , the number of data of the private data d i and the public data x i is n 1 , the number of data of the private data e i and the public data y i , is n 2 , and the calculation result is z=Σ n1 i=1 d i x i ·Σ n2 i=1 e i y i ,
the step of generating a non-interactive zero-knowledge proof according to the data processing relationship comprises:
generating an offset term according to the data processing relationship;
inputting the commitment parameter, the first commitment value, the second commitment value and the offset term into a random oracle machine to generate a challenge value according to the data processing relationship;
obtaining a response value by calculation according to the private data, the public data and the challenge value; and generating the non-interactive zero-knowledge proof according to the offset term and the response value.

Assignees

• Univ Zhejiang
• Hangzhou Abmatrix Tech Co Ltd

Inventors

• Zhang Bingsheng
• Zhou Zhelei
• Ren Kui
• Xu Jingzhong
• Lu Kaiyu

Classifications

• H04L9/3218

  using proof of knowledge, e.g. Fiat-Shamir, GQ, Schnorr, ornon-interactive zero-knowledge proofs · CPC title

• G06F21/6245 Primary

  Protecting personal data, e.g. for financial or medical purposes · CPC title

• G06F7/523

  Multiplying only · CPC title

• H04L9/321

  involving a third party or a trusted authority · CPC title