Regular Contribution

International Journal of Information Security

, Volume 8, Issue 5, pp 379-385

First online:

A secret sharing scheme based on (t, n) threshold and adversary structure

  • Huawang QinAffiliated withSchool of Automatization, NJUST Email author 
  • , Yuewei DaiAffiliated withSchool of Automatization, NJUST
  • , Zhiquan WangAffiliated withSchool of Automatization, NJUST

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


The existing secret sharing schemes cannot be applied directly if the threshold and the adversary structures are both needed to meet. A secret sharing scheme which can meet the requirements of both the (t, n) threshold and the adversary structure is proposed basing on the existing (t, n) threshold schemes and the knowledge of set theory, and the validity of the proposed scheme is proved perfectly. The scheme does not need to traverse the whole set of participants to get the qualified or unqualified subsets, and can distribute the shadows according to the requirements of threshold and adversary structure directly. The scheme can prevent the participants from cheating, and does not need the participants to provide their real shadows when the shared secret is reconstructed. The shadows do not need to be renewed when the shared secret is changed. The comparisons to the existing schemes show that, the proposed scheme is more efficient when the threshold and the adversary structure are both required.


Secret sharing Information security Threshold Adversary structure Cryptography