摘要
提出了一个基于零知识证明的身份鉴别协议 .该协议的安全性依赖于大数的因子分解和离散对数两个 NP完全问题 .该协议可以被方便地应用到智能卡系统中去 .协议中证明者 ( Prover)和验证者 ( Verifier)具有同样的计算能力 ,而且该协议要求最小限度的计算量和通信流量 .
We propose an interactive proof protocol of identity based on zero-knowledge. The security of protocol is based on factorization of large number and RSA problems. This protocol can be applied to smart cards. Our scheme has symmetricity in the sense that the same computational complexity and the same hardware for both Prover and Verfier are required. Also,it requires minimal amount of computation and communications for secret information.
出处
《徐州师范大学学报（自然科学版）》
CAS
2002年第1期37-38,64,共3页
Journal of Xuzhou Normal University(Natural Science Edition)
