Paper 2006/048

New Results on Multipartite Access Structures

Javier Herranz and German Saez


In a multipartite access structure, the set of players is divided into $K$ different entities, in such a way that all players of the same entity play the same role in the structure. Not many results are known about these structures, when $K \geq 3$. Even if the total characterization of ideal multipartite access structures seems a very ambitious goal, we 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 prove that three wide families of multipartite access structures are ideal. We believe that the techniques employed in these proofs are so general that they could be used to prove in the future more general results related to the characterization of ideal multipartite access structures.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. IET Proceedings of Information Security, Volume 153, Number 4, pp. 153-162, 2006
secret sharingideal access structures
Contact author(s)
jherranz @ ma4 upc edu
2010-11-24: revised
2006-02-13: received
See all versions
Short URL
Creative Commons Attribution


      author = {Javier Herranz and German Saez},
      title = {New Results on Multipartite Access Structures},
      howpublished = {Cryptology ePrint Archive, Paper 2006/048},
      year = {2006},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.