一个基于交互式零知识证明的身份鉴别和数字签名协议  

AN INTERACTIVE ZERO-KNOWLEDGE PROOF BASED PROTOCOL OF IDENTIFICATION AND DIGITAL SIGNATURE

作　　者：徐明[1] 陈纯[1] 应晶[1] 

机构地区：[1]浙江大学计算机科学与工程学系,杭州310027

出　　处：《计算机研究与发展》2002年第9期1051-1056,共6页Journal of Computer Research and Development

基　　金：教育部高等学校骨干教师资助计划基金资助

摘　　要：提出了一个新的基于零知识证明的身份鉴别和数字签名协议 .该协议的安全性建立在对大数的因子分解和 RSA加密算法破解的难度上的 .该协议可以被方便地应用到智能卡系统中去 .与 Nyang的协议相比 ,此协议在通信量与前者相当 ,而且要达到零知识证明所需要的轮数比 Nyang的协议要少 .在相同轮数情况下该协议可以提供比 Nyang的协议更高的安全性能 .在一轮循环情况下协议可以达到的最高安全程度与用户身份无关 .还将协议应用于实现数字签名、多人数字签名和 (N,T)门限数字签名协议 .An interactive zero-knowledge proof based protocol of identification and digital signature is proposed in this paper. The security of protocol is based on large number factorization and security of RSA problems. This protocol can be applied to smart cards. This scheme requires minimal amount of computation and communications information. Compared with Nyang's scheme, the scheme is more likely to win higher security. The k , which is the cycle number in order to achieve zero-knowledge, is smaller than Nyang's. On one cycle, the highest security degree, which the protocol can achieve, is independent of the user's identity. The protocol is versatile enough to be applied to digital signature, multiple digital signature, and (N, T) threshold digital signature.

关 键 词：交互式零知识证明 数字签名协议 多人数字签名 门限数字签名 网络通信 身份鉴别协议 计算机网络 密码学 

分 类 号：TN918.1[电子电信—通信与信息系统] TP393.08[电子电信—信息与通信工程]