a new social multi-secret sharing scheme using birkhoff interpolation and chinese remainder theorem

Secret sharing (ss) schemes allow the sharing of a secret among a set of trustees in such a way that only some qualified subsets of them can recover the secret. ordinary ss schemes assume that the trust to each trustee is fixed over time. however, this is not the case in many real scenarios. social secret sharing (sss) is a recently introduced type of ss that addresses this issue. it allows the sharing of a secret among a set of trustees such that the amount of trust to each participant could be changed over time. there exist only a few sss schemes in the literature; most of them can share only one secret during each execution. hence, these schemes lack the required efficiency in situations where multiple secrets need to be shared. according to the literature, there exists only one social multi-secret sharing (smss) scheme in which, all the secrets are reconstructed at one stage. however, in many applications, the secrets should be recovered in multiple stages and even according to some specified order. to address these problems, this paper employs birkhoff interpolation method and chinese remainder theorem and proposes a new smss scheme. in the proposed scheme, the shareholders can recover the secrets in different stages and according to the specified order by the dealer. the security analysis of the proposed scheme shows that it provides all the needed security requirements. in addition, the performance analysis of the proposed scheme indicates its overall superiority over the related schemes.