New results on multipartite access structures

New results on multipartite access structures

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IEE Proceedings - Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In a multipartite access structure, the set of players is divided into K different classes in such a way that all players of the same class play the same role in the structure. Not many results are known about these structures, when K ≥ 3.Although the total characterisation of ideal multipartite access structures seems a very ambitious goal, we nevertheless take a first step in this direction. On the one hand, we detect some conditions that directly imply that a multipartite structure cannot be ideal. On the other hand, we introduce a new strategy which helps to prove that a multipartite access structure is ideal, and we apply this strategy to three wide families of multipartite access structures.


    1. 1)
      • How to share a secret
    2. 2)
      • Graph decompositions and secret sharing schemes
    3. 3)
      • Di Crescenzo, G., Galdi, C.: `Hypergraph decomposition and secret sharing', Proc. International Symp. on Algorithms and Computation, December 2003, Kyoto, Japan, Springer-Verlag, Berlin, p. 645–654
    4. 4)
      • Perfect secret sharing schemes on five players
    5. 5)
      • Secret sharing schemes with bipartite access structure
    6. 6)
      • Some ideal secret sharing schemes
    7. 7)
      • Tassa, T.: `Hierarchical threshold secret sharing', Proc. Theory of Cryptography Conf., February 2004, Cambridge, USA, Springer-Verlag, Berlin, p. 473–490
    8. 8)
      • Beimel, A., Tassa, T., Weinreb, E.: `Characterizing ideal weighted threshold secret sharing', Proc. Theory of Cryptography Conf., February 2005, Cambridge, USA, Springer-Verlag, Berlin, p. 600–619
    9. 9)
      • Collins M.J.: ‘A note on ideal tripartite access structures’, 2002, manuscript available at
    10. 10)
      • Farràs, O., Martí-Farré, J., and Padró, C.: ‘Ideal multipartite secret sharing schemes’, 2006, manuscript available at
    11. 11)
      • Ideal secret sharing schemes with multipartite access structures
    12. 12)
      • Tassa, T., Dyn, N.: `Multipartite secret sharing by bivariate interpolation', Proc. International Colloquium on Automata, Languages and Programming, Venice, Italy, Springer-Verlag, Berlin, p. 288–299
    13. 13)
      • Blakley, G.R.: `Safeguarding cryptographic keys', Proc. National Computer Conf., American Federation of Information, June 1979, New York, USA, p. 313–317
    14. 14)
      • The geometry of secret sharing schemes
    15. 15)
      • Weighted threshold secret sharing schemes
    16. 16)
      • Tight bounds on the information rate of secret sharing schemes
    17. 17)
      • On the composition of matroids and ideal secret sharing schemes

Related content

This is a required field
Please enter a valid email address