Efficient ideal multi-secret sharing scheme
Hei Zan · Jisuanji yingyong yanjiu · 2012
This paper presented an efficient ideal multi-secret sharing scheme based on MSP.This scheme,splitted a set of n participants into several subsets of participants to establish multiple access structures.It was cheat-proof,that was,after a secret was reconstructed by some participants,the dishonest participant could not recover other secrets by using those sharings he obtained.The entire scheme had the advantages of small computational cost,only using simple linear operations.Compared with ,it avoided high complexity operations like exponentiation,which was a practical linear multi-secret sharing scheme.