A Verifiable Multiple-Players Enrollment Protocol for Threshold Schemes

In this paper a verifiable multiple-players enrollment protocol for threshold schemes is presented. The protocol allows distributing new shares to a group of new enrollment players, but old shareholders need not change their shares. The dishonest behavior of old shareholders can be detected and the new enrollment players can assure to get the right shares. The new protocol is very efficient compared with other schemes. It only needs 4t + n´ - 2 times broadcast when all players are honest, where t is the threshold value and n´ is the number of enrolling players. Furthermore, the broadcasting data are very few in this protocol. Finally, we give the security and performance analysis of the presented protocol