Decentralized CRT-Based Efficient Verifiable (n, t, n) Multi-secret Sharing Scheme

Secret sharing is critical to most applications making use of security and remains one of the most challenging research areas in modern cryptography. In this paper, we propose a novel efficient multi-secret sharing scheme that is based on the (n, t, n) secret sharing technique. We use the Chinese remainder theorem (CRT) to generate secret shares and the reconstruction of secrets instead of using the Lagrange polynomial interpolation. In addition, we discuss the security of the scheme, and provide a new method to generate verifiable shares that make the proposed scheme a verifiable secret sharing scheme.