Abstract

Based on the simple introduction of the multi-teeth encryption-decryption algorithm (Shang, 2010, P.1500-1502.), a dynamic secret sharing scheme based on the multi-teeth central encryption system is proposed in this article. In this research, for any K system members , they respectively select the positive integer in the set of  distributed randomly, and , and  is opened. By P <G, X, >, any l (or more)  could reconstruct the shared secret key, and . The result indicates that the scheme proposed in this article has good characteristics of security and encryption.

This work is licensed under a Creative Commons Attribution 4.0 License.