A New Dynamic Multiple Secrets Sharing Scheme
DU Hong-zhen · 2005
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.It can easily identify the cheaters of all shareholders,effectively solve the renewal and reuse problems,and easily and freely accept a new participant or fire a participant.The scheme is of simple structure,high security and small computational complexity.And the amount of data to be kept secret and transferred is very small.So the scheme is relatively efficient and practical.