Ideal Hierarchical Secret Sharing Schemes

  • Oriol Farràs
  • Carles Padró
Conference paper

DOI: 10.1007/978-3-642-11799-2_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5978)
Cite this paper as:
Farràs O., Padró C. (2010) Ideal Hierarchical Secret Sharing Schemes. In: Micciancio D. (eds) Theory of Cryptography. TCC 2010. Lecture Notes in Computer Science, vol 5978. Springer, Berlin, Heidelberg


Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays. Several constructions of ideal hierarchical secret sharing schemes have been proposed, but it was not known what access structures admit such a scheme. We solve this problem by providing a natural definition for the family of the hierarchical access structures and, more importantly, by presenting a complete characterization of the ideal hierarchical access structures, that is, the ones admitting an ideal secret sharing scheme. Our characterization deals with the properties of the hierarchically minimal sets of the access structure, which are the minimal qualified sets whose participants are in the lowest possible levels in the hierarchy. By using our characterization, it can be efficiently checked whether any given hierarchical access structure that is defined by its hierarchically minimal sets is ideal. We use the well known connection between ideal secret sharing and matroids and, in particular, the fact that every ideal access structure is a matroid port. In addition, we use recent results on ideal multipartite access structures and the connection between multipartite matroids and integer polymatroids. We prove that every ideal hierarchical access structure is the port of a representable matroid and, more specifically, we prove that every ideal structure in this family admits ideal linear secret sharing schemes over fields of all characteristics. In addition, methods to construct such ideal schemes can be derived from the results in this paper and the aforementioned ones on ideal multipartite secret sharing. Finally, we use our results to find a new proof for the characterization of the ideal weighted threshold access structures that is simpler than the existing one.


Secret sharing Ideal secret sharing schemes Hierarchical secret sharing Weighted threshold secret sharing Multipartite secret sharing Multipartite matroids Integer polymatroids 
Download to read the full conference paper text

Copyright information

© IFIP International Federation for Information Processing 2010

Authors and Affiliations

  • Oriol Farràs
    • 1
  • Carles Padró
    • 1
  1. 1.Universitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations