Design and Analysis of a New Multi-secret Sharing Scheme

Based on discrete logarithms, square roots model composition and Nevill formula for interpolation, a new multi-secret sharing scheme is proposed. In this scheme, each number can be communicated publicly and need a minimum secret requirement. All these shadows are as short as the secret to be shared. In the recovery stage, each participant is allowed to check whether another participant provided the true information or not. It is efficient for the scheme to share any set of multiple secrets within participants, and, in the whole course, each participants only keep one shadow.