Efficient Generalized Dynamic Multiple Secrets Sharing Scheme
一个高效的广义动态多秘密分享机制*

A Generalized dynamic multiple Secrets sharing scheme ba,zed on one-way function is proposed in this paper. It is applicable to arbitrary access structures and eliminates the weaknesses of Yeun scheme. It can easily identify the cheaters of all shareholders, effectively solve the renewal and reuse problems, easily and freely accept a new participant or fire a participant. Compared with Yeun scheme ,the amount of computation and the computational complexity are reduced. So the scheme is relatively more efficient and practical. It will he widely applied in distributed key escrow and electronic commerce.