Multi-secret Threshold Sharing Scheme Based on Chinese Remainder Theorem

To address the limitations of traditional secret sharing schemes, this paper proposes a multi-secret threshold sharing scheme based on the Chinese Remainder Theorem. In this scheme, multiple secrets and their shares can be unordered as needed. The distributor can modify secrets according to actual requirements, including updating, adding, and subtracting. Each participant in this scheme holds their unique share, and the distributor can send different additional information to each participant based on these shares. Participants in this scheme can reuse their shares to store each new set of secrets without refreshing their shares. Through scheme analysis, this paper proves that the proposed scheme ensures correctness and security. Experimental results further validate that the scheme meets the requirements of efficiency while ensuring correctness and security.