Welcome to the resource topic for 2021/127
Title:
Cuproof: A Novel Range Proof with Constant Size
Authors: Cong Deng, Xianghong Tang, Lin You, Gengran Hu, Shuhong Gao
Abstract:Zero-knowledge proof is widely used in blockchains. For example, zk-SNARK is used by Zcash as its core technology in identifying transactions. Up to now, various range proofs have been proposed, and their efficiency and range-flexibility are enhanced. Bootle et al. used inner product method and recursion to make an efficient zero-knowledge proof. Then, Benediky Bünz et al. came up with an efficient zero-knowledge proof scheme called Bulletproofs which can convince the verifier that a secret number lies in [0,2^{\kappa}-1]. By combining inner-product and Lagrange’s four-square theorem, we structure a range proof scheme which is called Cuproof. The scheme of Cuproof would make a range proof to prove that a secret number v \in [a,b] without exposing redundant information of v. In Cuproof, all the communication cost, the proving time and the verification time are constant. When the interval of the range proof is large, our Cuproof would show much better.
ePrint: https://eprint.iacr.org/2021/127
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .