Access structures determined by uniform polymatroids

DOI10.1515/JMC-2022-0017MaRDI QIDQ6085192zbMATH OpenOpenAlexFDO

Authors Renata Kawa, Mieczysław Kula

Publication date 7 November 2023

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2005.04509

zbMATH Keywords

ideal access structuremultipartite access structurepartially hierarchical access structuresecret sharinguniform polymatroid

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Abstract: An access structure is said to be multipartite, if the set of participants is divided into several parts and all participants in the same part play an equivalent role. The search for ideal secret sharing schemes for some special interesting families of multipartite access structures, has been carried out by many authors. In this paper a new concept of study of ideal access structures is proposed. We do not consider special classes of access structures defined by imposing certain prescribed assumptions, but we investigate all access structures obtained from uniform polymatroids using the method developed by Farr`as, Mart'i-Farr'e and Padr'o. They satisfy necessary condition to be ideal, i.e., they are matroid ports. Moreover some objects in this family can be useful for the applications of secret sharing. The choice of uniform polymatroids is motivated by the fact that each such polymatroid defines ideal access structures. The method presented in this article is universal and can be continued with other classes of polymatroids in further similar studies. Here we are especially interested in hierarchy of participants determined by the access structure and we distinguish two main classes: they are compartmented and hierarchical access structures. The vast majority of papers discussing hierarchical access structures consider access structures which are compartment or totally hierarchical. The main results are summarized in Section 4, which presents situations where partial hierarchy properties may arise. In particular, hierarchical orders of obtained structures are described. It is surprising, that the hierarchical orders of access structures obtained from uniform polymatroids are flat, i.e., every chain has at most 2 elements. The ideality of some families of hierarchical access structures is proved in Section 5.

Recommendations

• Complexity of universal access structures
• Ideal homogeneous access structures constructed from graphs
• Structural aspects of ordered polymatroids
• On polynomial time computation over unordered structures
• Uniformly bounded arrays and mutually algebraic structures
• A generalisation of uniform matroids
• Optimal assignment schemes for general access structures based on linear programming
• Total polynomials of uniform oriented matroids
• Uniform decompositions of polytopes
• On ideal and weakly-ideal access structures

Cites work

• Hierarchical threshold secret sharing
• How to share a secret
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 3912274 (Why is no real title available?)
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• Ideal Hierarchical Secret Sharing Schemes
• Ideal multipartite secret sharing schemes
• Natural Generalizations of Threshold Secret Sharing
• On secret-sharing matroids
• On the classification of ideal secret sharing schemes
• On the optimization of bipartite secret sharing schemes
• Secret-Sharing Schemes: A Survey
• The size of a share must be large

This page was built for publication: Access structures determined by uniform polymatroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085192)