Abstract Since (t, n)-threshold secret sharing (SS) was initially proposed by Shamir and
Blakley separately in 1979, it has been widely used in many aspects. Later on, Asmuth and …

The Chinese remainder theorem (CRT) is a fundamental theorem in number theory, widely
used in cryptography to design secret sharing schemes. The CRT-based secret sharing …

Secret sharing (SS) is part of the essential techniques in cryptography but still faces many
challenges in efficiency and security. Currently, SS schemes based on the Chinese …

The (t, n) threshold secret sharing schemes (SSs) were introduced by Shamir and Blakley
separately in 1979. Multilevel threshold secret sharing (MTSS) is a generalization of …

In Shamir's (k, n)-threshold secret sharing scheme [1], a heavy computational cost is
required to make n shares and recover the secret from k shares. As a solution to this …

In Shamir's (k, n)-threshold secret sharing scheme (threshold scheme), a heavy
computational cost is required to make n shares and recover the secret. As a solution to this …

In Shamir's (k, n)-threshold secret sharing scheme (threshold scheme)[1], a heavy
computational cost is required to make n shares and recover the secret from k shares. As a …

A general (t, n) secret sharing (SS) scheme with fixed threshold allows a secret to be shared
without considering the time dynamic nature of the security environment. In this paper, we …

Threshold secret sharing is concerned with the splitting of a secret into n shares and
distributing them to some persons without revealing its information. Any t≤ n persons …

In this paper, we propose to enhance threshold secret sharing schemes based on the
Chinese remainder theorem (CRT) by incorporating the well-known RSA Cryptosystem. In …