Journal of South China University of Technology (Natural Science Edition) ›› 2021, Vol. 49 ›› Issue (1): 1-9.doi: 10.12141/j.issn.1000-565X.200207

Special Issue: 2021年计算机科学与技术

• Computer Science & Technology • Previous Articles     Next Articles

A New ZK-SNAＲK Protocol Based on QAP

HUANG Ping LIANG Weijie   

  1. School of Mathematics，South China University of Technology，Guangzhou 510640，Guangdong，China
  • Received:2020-05-06 Revised:2020-07-22 Online:2021-01-25 Published:2021-01-01
  • Contact: 黄平 ( 1963-) ，男，博士，高级工程师，主要从事智能计算、区块链与大数据模型研究。 E-mail:gzhp18@163.com
  • About author:黄平 ( 1963-) ，男，博士，高级工程师，主要从事智能计算、区块链与大数据模型研究。
  • Supported by:
    Supported by the National Natural Science Foundation of China ( 11671149)

PDF

151

Abstract: The designing thought of verification equations in PGHR protocol is singular，that is，a verification equation targets only one constraint，ignoring their joint effect． In this paper，a new ZK-SNARK protocol——— CPGHR protocol———was obtained by using the indivisible properties of additional constant coefficient factors and the combined effect of verification equations to achieve effective compression of the PGHR protocol． At the same time，a strict verification of the security of the new protocol was given，and the validity of the protocol was theoretically analyzed and experimentally verified． The results show that the amount of evidence of the new protocol is reduced by about 75% ，and the calculation efficiency is improved by about 33% ．

Key words: cryptography, non-interactive zero-knowledge proof, ZK-SNARK protocol, data privacy

CLC Number: