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.
基于中国剩余定理，零知识证明与有限域上计算离散对数问题的困难性，提出了一种新的动态多秘密分享方案。
Finally it is pointed out that the protocol is one of interactive zero-knowledge proofs.
最后指出了此协议为一个满足零知识交互式证明的协议。
As a building block of the fair exchange protocol, this approach does not use any zero-knowledge proofs to provide verifiability, it avoids most of the costly computations.
作为设计公平交换协议的基本模块，该方案没有使用零知识证明系统提供验证，有效地避免了大量运算。
应用推荐