基于矩阵填充问题的五轮零知识身份认证方案  

5-pass zero-knowledge identity authentication scheme based on matrix completion problem

作　　者：王后珍[1,2] 蔡鑫伟 郭岩 张焕国 WANG Houzhen;CAI Xinwei;GUO Yan;ZHANG Huanguo(School of Cyber Science and Engineering,Wuhan University,Wuhan 430072,China;State Key Laboratory of Cryptology,Beijing 100878,China)

机构地区：[1]武汉大学国家网络安全学院,湖北武汉430072 [2]密码科学技术国家重点实验室,北京100878

出　　处：《通信学报》2021年第11期79-86,共8页Journal on Communications

基　　金：“十三五”国家密码发展基金资助项目(No.MMJJ201701304);国家自然科学基金资助项目(No.61332019);国家重点研发计划基金资助项目(No.2018YFC1604000)。

摘　　要：针对现存绝大多数身份认证协议容易遭受量子计算攻击及实现效率低的缺陷,基于矩阵填充(MC)问题构造了一种安全高效的五轮零知识身份认证方案。由于MC问题是NP完全的,所提方案具有很好的抗量子计算攻击潜力。相较于目前已有类似方案,所提方案通过增加单轮交互将欺骗概率由2/3降至1/2,同时兼具容易实现、密钥尺寸小等优点。此外,采用Fiat-Shamir密码转换技术还可将所提五轮零知识认证协议转换为高效的具有抗量子计算攻击潜力的数字签名方案。To solve the problem that most identity authentication schemes are vulnerable to quantum-computing attacks and low efficiency,a new 5-pass zero-knowledge identity authentication scheme was designed based on the matrix completion problem(MCP).Since the MCP is NP-complete,the proposed scheme has the potential to avoid quantum-computing attacks.Compared with the existing similar protocols,the proposed scheme reduced the fraud probability from 2/3 to 1/2 by adding a single round of interaction,and had the advantages of easy implementation and small key size.Moreover,based on the proposed zero-knowledge authentication scheme and Fiat-Shamir standard transformation method,a secure and efficient digital signature algorithm against quantum-computing can be obtained.

关 键 词：抗量子计算密码 身份认证 零知识证明 矩阵填充问题 

分 类 号：TP3-0[自动化与计算机技术—计算机科学与技术]