Efficient Secret Sharing Schemes Based on Unauthorized Subsets
We propose two multiple assignment secret sharing schemes realizing general access structures. One is always more efficient than the secret sharing scheme proposed by Ito. Saito and Nishizeki [5] from the viewpoint of the number of shares distributed to each participant. The other is also always more efficient than the scheme I of [7].
multiple assignment secret sharing scheme general access structure (k,n)-threshold scheme