|
计算机应用 2006
Simple verifiable secret sharing scheme
|
Abstract:
Two effective Verifiable Secret Sharing(VSS) schemes including the Feldman's VSS scheme and the Pedersen's VSS scheme were analyzed.But as they are the threshold schemes,it is inefficient for them to be applied to the general access structure.Then,a new VSS scheme for the general access structure was proposed.The dealer created the shares randomly,and sent them to the participants by secret channel.Each authorized subset of the access structure had a public message, through which the validity of the shares could be verified respectively.This scheme has two types: one is computationally secure and the other is unconditionally secure.Their security is equal to that of the Feldman's scheme and the Pedersen's scheme respectively.But,it is more efficient to implement the new scheme on the same level of security.