A probabilistic secret sharing scheme for a compartmented access structure

  • Authors:

  • Yuyin Yu;Mingsheng Wang

  • Affiliations:

  • The State Key Laboratory of Information Security, Institute of Software Chinese Academy of Sciences, Beijing, China and Graduate University of the Chinese Academy of Sciences, Beijing, China;The State Key Laboratory of Information Security, Institute of Software Chinese Academy of Sciences, Beijing, China and Graduate University of the Chinese Academy of Sciences, Beijing, China

  • Venue:
  • ICICS'11 Proceedings of the 13th international conference on Information and communications security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a compartmented access structure, there are disjoint participants C1,..., 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.