摘要
PGHR协议设计验证式的思想是单一化的,即一个验证式实现一个条件的验证,忽略了验证式的联合效应。文中通过利用额外常系数因子的互不整除性与验证式的联合效应实现对PGHR协议的有效压缩,得到新的ZK-SNARK协议——CPGHR协议,给出了新协议安全性的严格证明,并对协议的有效性进行了理论分析与实验验证。结果表明:新协议的证据量压缩约75%,验证方计算效率提升约33%。
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%.
作者
黄平
梁伟洁
HUANG Ping;LIANG Weijie(School of Mathematics,South China University of Technology,Guangzhou 510640,Guangdong,China)
出处
《华南理工大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2021年第1期1-9,共9页
Journal of South China University of Technology(Natural Science Edition)
基金
国家自然科学基金资助项目(11671149)。
