[1]孟彦 侯整风 昂东宇 周循.基于椭圆曲线的单轮零知识证明方案[J].计算机技术与发展,2007,(12):147-150.
　MENG Yan,HOU Zheng-feng,ANG Dong-yu,et al.One- Round Zero- Knowledge Proofs Protocol Based on Elliptic Curve[J].,2007,(12):147-150.
点击复制

基于椭圆曲线的单轮零知识证明方案()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2007年12期
页码:
147-150
栏目:
安全与防范
出版日期:
1900-01-01

文章信息/Info

Title:
One- Round Zero- Knowledge Proofs Protocol Based on Elliptic Curve
文章编号:
1673-629X（2007）12-0147-04
作者:
孟彦 侯整风 昂东宇 周循
合肥工业大学计算机与信息学院
Author(s):
MENG Yan;  HOU Zheng-feng;  ANG Dong-yu;  ZHOU Xun
Department of Computer Science and Information, Hefei University of Technology
关键词:
零知识证明; 椭圆曲线; 单轮零知识方案; 交互式证明
Keywords:
zero-knowledge proofs;  elliptic curves;  one- round ZKP protocol;  interactive proof
分类号:
TP393.08
文献标志码:
A
摘要:
零知识证明在信息安全领域有着很广泛的应用前景。然而传统的零知识证明方案为了保证方案的正确性需要多轮的迭代，大大增加了交互双方的通信量，使得方案往往不适合实际应用。提出了一种单轮零知识证明的方案，在保证方案正确性、完全性和零知识性的同时将方案运行的迭代次数降低到1，最大程度地减少了方案的通信量。同时将零知识证明扩展到了椭圆曲线上的离散对数问题，提高了方案的安全性。最后给出了构造单轮零知识方案的一个必要条件
Abstract:
A zero- knowledge proof （ZKP） is a powerful tool which can be used and already be used for many cryptographic applications. But for the completeness property and the soundness property the existing zero - knowledge proofs are iterative in nature. The multiple communication rounds makes ZKPs unsuitable in practice. In this thesis, propose a new ZKP protocol which runs in one - round while ensure the completeness property and the .soundness property. On the other hand, extend ZKPs to elliptic curves. At last, proposed a necessary condition which was needed by constructing a one - round zero- knowledge proofs protocol

相似文献/References:

[1]王龙葛 王天芹 田珂 徐飞.基于椭圆曲线的盲数字签名及其身份识别[J].计算机技术与发展,2008,(06):142.
　WANG Long-ge,WANG Tian-qin,TIAN Ke,et al.A Blind Digital Signature Scheme and User Authentication Based on Elliptic Curves Cryptosystem[J].,2008,(12):142.
[2]王平水.零知识数字签名方案中Hash值长度的研究[J].计算机技术与发展,2007,(06):170.
　WANG Ping-shui.Study on Length of Hash - Values for Digital Signature Schemes Based on Zero- Knowledge[J].,2007,(12):170.
[3]梁雨平 汤小华.一种前向安全性的可证实代理数字签名方案[J].计算机技术与发展,2007,(07):142.
　LIANG Yu-ping,TANG Xiao-hua.A Certifiable Representative Digital Signature Approach Based on Forward Security[J].,2007,(12):142.
[4]王平水.基于独立集问题的零知识证明研究[J].计算机技术与发展,2007,(09):55.
　WANG Ping-shui.Study on Zero- Knowledge Proof Based on Independent Set Problem[J].,2007,(12):55.
[5]石润华 仲红.基于椭圆曲线离散对数的组签名方案[J].计算机技术与发展,2007,(11):153.
　SHI Run-hua,ZHONG Hong.Group Signature Schemes Based on Elliptic Curve Discrete Logarithm[J].,2007,(12):153.
[6]于雪燕 胡金初 柴春轶.椭圆曲线密码体制及其参数生成的研究[J].计算机技术与发展,2006,(11):160.
　YU Xue-yan. HU Jin-chu,CHAI Chun-yi.Research. on Elliptic Curves Cryptosystems and References Generating[J].,2006,(12):160.
[7]张弢,任帅,张德刚[].基于可信计算的Ad Hoc网络直接匿名证明[J].计算机技术与发展,2014,24(04):147.
　ZHANG Tao[],REN Shuai[],ZHANG De-gang[].Direct Anonymous Attestation to Ad Hoc Networks Based on Trusted Computing[J].,2014,24(12):147.
[8]蒋华[][],杨磊[] 胡荣磊[]. 基于SIP协议的安全网关设计[J].计算机技术与发展,2015,25(07):120.
　JIANG Hua[][],YANG Lei[],HU Rong-lei[]. Design of Security Gateway Based on SIP[J].,2015,25(12):120.
[9]韦性佳,张京花,芦殿军.基于ECC 的具有前向安全性的 VSS 方案[J].计算机技术与发展,2018,28(04):157.[doi:10.3969/ j. issn.1673-629X.2018.04.033]
　WEI Xing-jia,ZHANG Jing-hua,LU Dian-jun.A Forward Security Secret Sharing Scheme Based on ECC[J].,2018,28(12):157.[doi:10.3969/ j. issn.1673-629X.2018.04.033]
[10]袁勇[][][],唐刚[],陈辉焱[],等. 基于MOF算法改进的标量乘算法研究[J].计算机技术与发展,2016,26(12):111.
　YUAN Yong[][][],TANG Gang[],CHEN Hui-yan[],et al. Research on Improved Scalar Multiplication Algorithm Based on MOF[J].,2016,26(12):111.

备注/Memo

备注/Memo:
孟彦（1981-）。男，安徽合肥人。硕士研究生。研究方向为网络与信息安全；侯整风，教授，硕士生导师。研究方向为计算机网络与信息安全、数据库
更新日期/Last Update: 1900-01-01