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

Efficient Zero-Knowledge Identification Based on Matrix Completion Problem

作　　者：王后珍[1,2] 郭岩 张焕国 WANG Houzhen;GUO Yan;ZHANG Huanguo(Key Laboratory of Aerospace Information Security and Trusted Computing,Ministry of Education,School of Cyber Science and Engineering,Wuhan University,Wuhan 430072,Hubei,China;State Key Laboratory of Cryptology,Beijing 100878,China)

机构地区：[1]空天信息安全与可信计算教育部重点实验室,武汉大学国家网络安全学院,湖北武汉430072 [2]密码科学技术国家重点实验室,北京100878

出　　处：《武汉大学学报（理学版）》2021年第2期111-117,共7页Journal of Wuhan University:Natural Science Edition

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

摘　　要：针对目前大多数身份认证密码协议容易遭受量子计算机攻击且实现效率较低的问题,基于矩阵填充问题设计了一种新型零知识身份认证协议。与现有类似方案相比,本文的方案具有密钥尺寸小、易于实现等特点。矩阵填充问题属于NPC(non-deterministic polynomial complete)问题,本文提出的协议具有抗量子计算攻击潜力。利用本文方案并采用Fiat-Shamir标准转换方法,可得到一种安全高效的抗量子计算数字签名算法。Since most of the current authentication cryptographic protocols are vulnerable to quantum computer attacks and have low implementation efficiency, we present a novel zero-knowledge authentication protocol based on the matrix completion problem in this paper. Compared with the existing similar schemes, our scheme has a smaller key size and is easier to implement. Besides, the matrix completion belongs to the NPC(non-deterministic polynomial complete)problem, so the protocol proposed in this paper has the potential to resist quantum computing attacks. Last but not least, a secure and efficient post-quantum digital signature can be obtained by employing the Fiat-Shamir method.

关 键 词：身份认证协议 矩阵填充问题 零知识证明 NPC问题 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]