Verifiable Multi-secret Sharing Scheme

Ximei Li · Jisuanji gongcheng · 2009

Based on the intractability of the discrete logarithm,this paper proposes a verifiable multi-secret sharing scheme,and analyzes its security.In this scheme,several secrets can be shared during one secret sharing process simultaneously.Each participant chooses the secret share by himself,and the dealer is impossible to be a cheater.It need not to design special verification algorithm.This scheme is valuable in the environments where the security channels are not available.

Read the paper · More papers on PaperTik