在离散对数困难问题的条件下，利用不经意多项式估值协议和拉格朗日插值多项式来解密s2(方案2)。
Under the condition of a discrete logarithm problem, S2 is decrypted by the OPE (Oblivious Polynomial Evaluation) protocol and Lagrange Interpolation Polynomial (scheme 2).
文中提出了一个新的群签名方案，该方案的安全性基于离散对数困难问题，其运行效率比已有的同类方案高。
A new group signature scheme based on the discrete logarithm problem is presented. The scheme is more efficient than the previously known schemes with the same security properties.
基于中国剩余定理，零知识证明与有限域上计算离散对数问题的困难性，提出了一种新的动态多秘密分享方案。
Based on the zero -knowledge proofs and the computational difficulty of computing discrete logarithms, a dynamic multiple secrets sharing scheme is proposed in this paper.
应用推荐