ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost

The decentralization of blockchain can easily lead to the leakage of users’ private data at the transaction layer,which in turn leads to information security issues.The zero-knowledge range proof is designed to confidentially verify that the transaction data belongs to a legal positive integer range...

Full description

Bibliographic Details
Main Author: LI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin
Format: Article
Language:zho
Published: Editorial office of Computer Science 2022-10-01
Series:Jisuanji kexue
Subjects:
Online Access:https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-10-335.pdf
_version_ 1797845165007699968
author LI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin
author_facet LI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin
author_sort LI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin
collection DOAJ
description The decentralization of blockchain can easily lead to the leakage of users’ private data at the transaction layer,which in turn leads to information security issues.The zero-knowledge range proof is designed to confidentially verify that the transaction data belongs to a legal positive integer range without revealing the transaction data.It effectively solves the problem of blockchain privacy leakage.The existing blockchain range proof scheme can still be further optimized in terms of proof speed,verification speed and calculation cost.In addition,the existing solutions cannot handle the floating-point number problem,thus limiting the application fields of range proofs.This paper proposes an efficient range proof scheme with constant computational cost and universal for floating-point numbers and integers,ZKFERP.It improves the zero-knowledge protocol based on Bulletproofs to optimize the proof structure,and a Lagrangian inner product vector generation method is designed to make the witness generation time constant and the commitment is constructed according to the floating-point number range relationship to implement floating-point range proof.ZKFERP only relies on the discrete logarithm assumption,and third-party credibility is not required.The communication cost and time complexity of ZKFERP are constant.Experimental results show that,compared with the most advanced known range proof scheme,ZKFERP’s proof speed is increased by 40.0%,and the verification speed is increased by 29.8%.
first_indexed 2024-04-09T17:34:08Z
format Article
id doaj.art-e4f7323d115f4bc9adb1172dd29a297c
institution Directory Open Access Journal
issn 1002-137X
language zho
last_indexed 2024-04-09T17:34:08Z
publishDate 2022-10-01
publisher Editorial office of Computer Science
record_format Article
series Jisuanji kexue
spelling doaj.art-e4f7323d115f4bc9adb1172dd29a297c2023-04-18T02:32:40ZzhoEditorial office of Computer ScienceJisuanji kexue1002-137X2022-10-01491033534310.11896/jsjkx.210900044ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational CostLI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin0School of Software,Dalian University of Technology,Dalian,Liaoning 116024,ChinaThe decentralization of blockchain can easily lead to the leakage of users’ private data at the transaction layer,which in turn leads to information security issues.The zero-knowledge range proof is designed to confidentially verify that the transaction data belongs to a legal positive integer range without revealing the transaction data.It effectively solves the problem of blockchain privacy leakage.The existing blockchain range proof scheme can still be further optimized in terms of proof speed,verification speed and calculation cost.In addition,the existing solutions cannot handle the floating-point number problem,thus limiting the application fields of range proofs.This paper proposes an efficient range proof scheme with constant computational cost and universal for floating-point numbers and integers,ZKFERP.It improves the zero-knowledge protocol based on Bulletproofs to optimize the proof structure,and a Lagrangian inner product vector generation method is designed to make the witness generation time constant and the commitment is constructed according to the floating-point number range relationship to implement floating-point range proof.ZKFERP only relies on the discrete logarithm assumption,and third-party credibility is not required.The communication cost and time complexity of ZKFERP are constant.Experimental results show that,compared with the most advanced known range proof scheme,ZKFERP’s proof speed is increased by 40.0%,and the verification speed is increased by 29.8%.https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-10-335.pdfblockchain|privacy protection|zero-knowledge proof|range proof|vector inner product commitment
spellingShingle LI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin
ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost
Jisuanji kexue
blockchain|privacy protection|zero-knowledge proof|range proof|vector inner product commitment
title ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost
title_full ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost
title_fullStr ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost
title_full_unstemmed ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost
title_short ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost
title_sort zkferp universal and efficient range proof scheme with constant computational cost
topic blockchain|privacy protection|zero-knowledge proof|range proof|vector inner product commitment
url https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-10-335.pdf
work_keys_str_mv AT liyicongzhoukuanjiuwangzizhongxulin zkferpuniversalandefficientrangeproofschemewithconstantcomputationalcost