一种高效的门限多重秘密分享方案

利用椭圆曲线密码算法设计了一个新的门限多重秘密分享方案，该方案的特点是不需要秘密分发者事先给每个用户分发一个子秘密，不需要安全信道传输信息，而且所有的中间信息都是不需要保密的。该方案还解决了秘密更新和子秘密复用的问题，可以防止不诚实成员的欺诈，并且能够一次性共享多个秘密。比较现有的一些在线秘密分享方案（文献[9]，[10]等），该方案计算量小，通信量小，交互次数少，效率高，易于实现。

Efficient threshold multi-secret sharing scheme

This paper proposes a new threshold multi-secret sharing scheme which is based on ECC.The scheme didn’t need give any secret information to all users and have a secure channel to transport the information.Any informations of the computation can be openning.The renew and reuse problems of secret are properly solved in the scheme and it can detect the cheaters.The scheme has some advantages such as much less data quantum and computational complexity than others.