A Verifiable Multi-Policy Secret Sharing Scheme
Zhengming Hu · Beijing Youdian Xueyuan xuebao · 2010
The secret sharing schemes are important techniques for key management.However,most verifiable multi-secret sharing schemes can not distinguish the security classification because of having the common drawback of sharing secrets with the same value.A verifiable multi-policy secret sharing scheme is proposed.The significant character of the proposed scheme is that each participant has to be kept only one master secret share,the share can be used to reconstruct different group secrets according to the number of threshold values.So it will reduce the calculated amount of the secret distributor.Moreover,the efficient solutions against multiform cheating are proposed,the scheme is therefore with highly security and practicality.