Further ideal multipartite access structures from integer polymatroids
RIS ID
98471
Abstract
Ideal access structures admit ideal secret sharing schemes where the shares have the minimal size. As multipartite access structures can well mirror the real social organizations, of which the participants are partitioned into disjoint groups according to their properties, it is desirable to find expressive ideal multipartite access structures. Integer polymatroids, due to their close relationship with ideal multipartite access structures, have been shown as a powerful tool to study the ideality of some multipartite access structures. In this paper, to cater for flexible applications, we consider several ideal multipartite access structures that further extend some known results. We first explore a type of compartmented access structures with strictly lower bounds, which provide fairness among all the participant groups when recovering the secret. Then, we investigate ideal bench access structures where the participant set is divided into two parts, that is, line-up section and bench section. The participants in line-up section can delegate their capabilities to the participants in bench section in such a way that the participants in bench section can take over the role of their delegators in line-up section, which is applicable to emergency situations when there are no enough participants in line-up section for recovering the secret. Finally, we propose two types of ideal partially hierarchical access structures which are suitable to more realistic hierarchical social organizations than existing results.
Publication Details
Wang, Y., Wu, Q., Wong, D. S., Qin, B., Mu, Y. & Liu, J. (2015). Further ideal multipartite access structures from integer polymatroids. Science China Information Sciences, 58 072105:1-072105:13.