Table 2.

Comparison of the previous shared secret protocols in terms of advantages and disadvantages.

Shared Secret Protocol	Advantages	Disadvantages	Implementation Type
Basic Shamir [11]	No verification of secret shares. Unconditionally secure. (t − n) threshold protocol.	Require secure channel. Require group members’ communication. High communication cost. No key updating and authentication.	Decentralized
Ulutas et al. [17]	Secure distribution of shares of medical images. No verification of secret shares. (t − n) threshold protocol.	No key updating. No key authentication. Dishonest and fake shares distribution.	Decentralized
Harn et al. [20]	Support a verifiable secret sharing method based on the CRT. Using Asmuth–Bloom’s scheme. It does not require a secure channel.	Require verification of secret shares. High communication cost. Computationally secure. No key updating and key authentication.	Centralized
Liu et al. [21]	Efficient secret share using Asmuth–Bloom’s scheme. Unconditionally secure.	Require verification of secret shares. No key updating and no key authentication. Require secure channel.	Centralized
Liu et al. [22]	Unconditionally secure. Using Chinese Reminder Theorem, Shamir’s Secret Sharing, and Asmuth-secret Bloom’s sharing. Support key authentication using a one-way hash function.	Require verification of secret shares. Require secure channel. No key updating. High communication cost.	Centralized
Meng et al. [28]	Presented two thresholds changeable secret sharing methods. Using a mix of bivariate and univariate polynomials. Unconditionally secure.	Require secure channel. Require verification of secret shares. No key updating and authentication.	Centralized
Liu et al. [29]	A linear threshold secret sharing that combines two of Shamir’s procedures. Cheating detection. No verification of secret shares.	No key updating and key authentication. High communication cost due to using of two polynomials.	Centralized