A probabilistic secret sharing scheme for a compartmented access structure

Abstract

In a compartmented access structure, there are disjoint participants C 1,...,Cm. The access structure consists of subsets of participants containing at least ti from Ci for i = 1,...,m, and a total of at least t0 participants. Tassa [2] asked: whether there exists an efficient ideal secret sharing scheme for such an access structure? Tassa and Dyn [5] realized this access structure with the help of its dual access structure. Unlike the scheme constructed in [5], we propose a direct solution here, in the sense that it does not utilize the dual access structure. So our method is compact and simple. © 2011 Springer-Verlag.