Unordered Multisecret Sharing Based on Generalized Chinese Remainder Theorem

Abstract EN

Multisecret sharing schemes have been widely used in the area of information security, such as cloud storage, group authentication, and secure parallel communications.

One of the issues for these schemes is to share and recover multisecret from their shareholders.

However, the existing works consider the recovery of multisecret only when the correspondences between the secrets and their shares are definite.

In this paper, we propose a multisecret sharing scheme to share and recover two secrets among the participants based on the generalized Chinese Remainder Theorem (GCRT), where the multisecret and their shares are unordered.

To overcome the leakage of information, we propose an improved scheme including the improved sharing phase and the recovery phase.

The improved scheme has not only a more secure performance but also a lower computation complexity.

The conditions for recovery failure and success are also explored.