[1]王平水.基于独立集问题的零知识证明研究[J].计算机技术与发展,2007,(09):55-57.
　WANG Ping-shui.Study on Zero- Knowledge Proof Based on Independent Set Problem[J].,2007,(09):55-57.
点击复制

基于独立集问题的零知识证明研究()
分享到：

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

卷:
期数:
2007年09期
页码:
55-57
栏目:
智能、算法、系统工程
出版日期:
1900-01-01

文章信息/Info

Title:
Study on Zero- Knowledge Proof Based on Independent Set Problem
文章编号:
1673-629X（2007）09-0055-03
作者:
王平水
安徽财经大学网络中心
Author(s):
WANG Ping-shui
Network Center of Anhui University of Finance ＆ Economics
关键词:
零知识证明; 独立集; 离散对数; 计算复杂性
Keywords:
zero- knowledge proof;  independent set problem;  discrete logarithm;  computational complexity
分类号:
TP18
文献标志码:
A
摘要:
零知识证明已经成为信息安全领域身份认证的关键技术之一。为了避免已知零知识证明系统的图同构问题，提出了一种知识的计算零知识证明系统，其安全性建立在NPC独立集问题上。该算法的构造基于离散对数问题的困难性，从而保证了系统的合理性、完全性、计算零知识性。并从计算复杂度和通信复杂度两方面对系统及其算法参数的选取进行了分析。理论证明，该系统是可行有效的
Abstract:
Zero- knowledge proof has been one of the key technologies to be applied in identity authentication in the fields of information security. To avoid the use of the graph isomorphism problem in the known zero- knowledge proof systems, an efficient computational zero - knowledge proof of knowledge whose security relies on the NP- Completeness of the independent set problem is presented here. The proposed logarithm is constructed from a bit commitment scheme based on the hardness of the discrete logarithm problem, which guarantees the fulfillment of soundness, completeness and computational zero- knowledge properties. The system and its logarithm parameter choice were analyzed from two aspects of computational complexity and communication complexity It was proved theoretically that the system is feasible and effective

相似文献/References:

[1]王平水.零知识数字签名方案中Hash值长度的研究[J].计算机技术与发展,2007,(06):170.
　WANG Ping-shui.Study on Length of Hash - Values for Digital Signature Schemes Based on Zero- Knowledge[J].,2007,(09):170.
[2]郭晓莲 林志伟 许力.一种新的自组网极小连通支配集生成算法[J].计算机技术与发展,2007,(07):17.
　GUO Xiao-lian,LIN Zhi-wei,XU Li.A Novel Distributed Minimum Connected Dominating Set Algorithm in Ad Hoc Network[J].,2007,(09):17.
[3]孟彦 侯整风 昂东宇 周循.基于椭圆曲线的单轮零知识证明方案[J].计算机技术与发展,2007,(12):147.
　MENG Yan,HOU Zheng-feng,ANG Dong-yu,et al.One- Round Zero- Knowledge Proofs Protocol Based on Elliptic Curve[J].,2007,(09):147.
[4]张弢,任帅,张德刚[].基于可信计算的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(09):147.
[5]陈梁景,王志伟.隐私保护的传染病密切接触者身份追踪系统[J].计算机技术与发展,2022,32(09):167.[doi:10. 3969 / j. issn. 1673-629X. 2022. 09. 026]
　CHEN Liang-jing,WANG Zhi-wei.A Privacy-protected Identity Tracking System for Close Contacts of Infectious Diseases[J].,2022,32(09):167.[doi:10. 3969 / j. issn. 1673-629X. 2022. 09. 026]
[6]王宝成,伍博文.基于零知识证明的电子投票协议研究[J].计算机技术与发展,2022,32(S1):44.[doi:10. 3969 / j. issn. 1673-629X. 2022. S1. 010]
　WANG Bao-cheng,WU Bo-wen.Research on Electronic Voting Protocol Based on Zero-knowledge Proof[J].,2022,32(09):44.[doi:10. 3969 / j. issn. 1673-629X. 2022. S1. 010]
[7]麻付强,徐 峥,宋桂香.基于零知识的多实体联合身份认证算法[J].计算机技术与发展,2023,33(11):113.[doi:10. 3969 / j. issn. 1673-629X. 2023. 11. 017]
　MA Fu-qiang,XU Zheng,SONG Gui-xiang.Multi-entity Joint Identity Authentication Algorithm Based on Zero-knowledge Proof[J].,2023,33(09):113.[doi:10. 3969 / j. issn. 1673-629X. 2023. 11. 017]

备注/Memo

备注/Memo:
安徽省教育厅自然科学基金资助项目（2006KJ017C）王平水（1972-），男，安徽蚌埠人，副教授，硕士，主要研究领域为符号计算与网络信息安全
更新日期/Last Update: 1900-01-01