论文部分内容阅读
论文指出了文献[1]中的零知识证明协议在公钥参数选取上的安全漏洞,并从求解离散对数的角度进行了分析证明。然后吸取了DSA数字签名算法中安全密钥选取高效简单的优点,提出了一种比Schnorr身份识别方案快1／3的简单、安全、高效的零知识证明身份识别方案。
The paper points out the security loopholes in the selection of public key parameters for the zero-knowledge proof protocol in [1] and proves it from the perspective of solving discrete logarithm. Then, the advantage of simple and efficient security key selection in DSA digital signature algorithm is deduced. A simple, safe and efficient identification scheme of zero-knowledge identification which is 1/3 faster than Schnorr identification scheme is proposed.