A secret-sharing scheme is a cryptographic protocol to distribute a secret state in an encoded form among a group of players such that only authorized subsets of the players can reconstruct the secret. Classically, efficient secret-sharing schemes have been shown to be induced by matroids. Furthermore, access structures of such schemes can be characterized by an excluded minor relation. No such relations are known for quantum secret-sharing schemes. In this paper we take the first steps toward a matroidal characterization of quantum-secret-sharing schemes. In addition to providing a new perspective on quantum-secret-sharing schemes, this characterization has important benefits. While previous work has shown how to construct quantum-secret-sharing schemes for general access structures, these schemes are not claimed to be efficient. In this context the present results prove to be useful; they enable us to construct efficient quantum-secret-sharing schemes for many general access structures. More precisely, we show that an identically self-dual matroid that is representable over a finite field induces a pure-state quantum-secret-sharing scheme with information rate
1.
Given a set of parties {1, /spl middot//spl middot//spl middot/, n}, an access structure is a monotone collection of subsets of the parties. For a certain domain of secrets, a secret-sharing scheme for an access structure is a method for a dealer to distribute shares to the parties. These shares enable subsets in the access structure to reconstruct the secret, while subsets not in the access structure get no information about the secret. A secret-sharing scheme is ideal if the domains of the shares are the same as the domain of the secrets. An access structure is universally ideal if there exists an ideal secret-sharing scheme for it over every finite domain of secrets. An obvious necessary condition for an access structure to be universally ideal is to be ideal over the binary and ternary domains of secrets. The authors prove that this condition is also sufficient. They also show that being ideal over just one of the two domains does not suffice for universally ideal access structures. Finally, they give an exact characterization for each of these two conditions.>
Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention since 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 is based on the well-known connection between ideal secret sharing schemes and matroids and, more specifically, on the connection between ideal multipartite secret sharing schemes and integer polymatroids. In particular, we prove that every hierarchical matroid port admits an ideal linear secret sharing scheme over every large enough finite field. Finally, we use our results to present a new proof for the existing characterization of the ideal weighted threshold access structures.
Secret sharing, which refers to methods of distributing a secret value among a group of participants, is a very important primitive in cryptology. This thesis contains some contribution to this topic. The results that are presented herein deal with two of the main open problems in secret sharing: the characterization of the ideal access structures and the optimization of the length of the shares. For both open problems, polymatroids are a powerful tool. On one hand, ideal\n\n\n\nmultipartite secret sharing schemes are strongly connected to polymatroids. On the other hand, the entropies of shares of a scheme determine a polymatroid, and because of that, they are fundamental in the search of lower bounds of the length of the shares. For the first open problem, some new and useful families of ideal multipartite access structures are found by using integer polymatroids. As a result the proofs for the existence of ideal secret sharing schemes for them are simplified in great measure. Regarding the second open problem, we present positive and negative results about the only known technique to find lower bounds: linear programming. The positive result are obtained by strengthening this method. The negative ones show the limitation of this method trying to improve the asymptotic lower bounds.
A secret-sharing scheme realizes the forbidden graph access structure determined by a graph
G=(V,E)if the parties are the vertices of the graph and the subsets that can reconstruct the secret are the pairs of vertices in
E(i.e., the edges) and the subsets of at least three vertices. Secret-sharing schemes for forbidden graph access structures defined by bipartite graphs are equivalent to conditional disclosure of secrets (CDS) protocols. We study the complexity of realizing a forbidden graph access structure by linear secret-sharing schemes, which are schemes in which the secret can be reconstructed from the shares by a linear mapping. We provide efficient constructions and lower bounds on the share size of linear secret-sharing schemes for sparse and very dense graphs, closing the gap between upper and lower bounds. Given a sparse (resp. very dense) graph with
nvertices and at most
n1+βedges (resp. at least
(2n)−n1+βedges), for some
0≤β<1, we construct a linear secret-sharing scheme realizing its forbidden graph access structure with total share size
O~(n1+β/2). Furthermore, we construct linear secret-sharing schemes realizing these access structures in which the size of each share is
O~(n1/4+β/4). We also provide constructions achieving different trade-offs between the size of each share and the total share size. We prove that almost all forbidden graph access structures require linear secret-sharing schemes with total share size
Ω(n3/2); this shows that the construction of Gay, Kerenidis, and Wee [CRYPTO 2015] is optimal. Furthermore, we show that for every
0≤β<1there exist a graph with at most
n1+βedges and a graph with at least
(2n)−n1+βedges such that the total share size in any linear secret-sharing scheme realizing the associated forbidden graph access structures is
Ω(n1+β/2). Finally, we show that for every
0≤β<1there exist a graph with at most
n1+βedges and a graph with at least
(2n)−n1+βedges such that the size of the share of at least one party in any linear secret-sharing scheme realizing these forbidden graph access structures is
Ω(n1/4+β/4). This shows that our constructions are optimal (up to poly-logarithmic factors).
A secret sharing scheme is a method which allows a dealer to share a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret. The collection of subsets of participants that can reconstruct the secret in this way is called access structure. The rank of an access structure is the maximum cardinality of a minimal qualified subset. A secret sharing scheme is perfect if unqualified subsets of participants obtain no information regarding the secret. The dealer's randomness is the number of random bits required by the dealer to setup a secret sharing scheme. The efficiency of the dealer's randomness is the ratio between the amount of the dealer's randomness and the length of the secret. Because random bits are a natural computational resource, it is important to reduce the amount of randomness used by the dealer to setup a secret sharing scheme. In this paper, we propose some decomposition constructions for perfect secret sharing schemes with access structures of constant rank. Compared with the best previous results, our constructions have some improved upper bounds on the dealer's randomness and on the efficiency of the dealer's randomness.