On the classification of ideal secret sharing schemes
From MaRDI portal
Publication:1180513
DOI10.1007/BF00196772zbMath0747.94010MaRDI QIDQ1180513
Ernest F. Brickell, Daniel M. Davenport
Publication date: 27 June 1992
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items (77)
Ideal secret sharing schemes on graph-based $3$-homogeneous access structures ⋮ Secret-sharing matroids need not be algebraic ⋮ Secret-sharing schemes for very dense graphs ⋮ On secret sharing schemes ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Linear mappings of near-vector spaces ⋮ On the information rate of perfect secret sharing schemes ⋮ Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions ⋮ A note on secret sharing schemes with three homogeneous access structure ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Recent Advances in Non-perfect Secret Sharing Schemes ⋮ Anonymous secret sharing schemes ⋮ Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems ⋮ Abelian sharing, common informations, and linear rank inequalities ⋮ Powerful sets: a generalisation of binary matroids ⋮ The decomposition of finite-dimensional near-vector spaces ⋮ The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Access structures determined by uniform polymatroids ⋮ Secret Sharing Schemes for (k, n)-Consecutive Access Structures ⋮ The model theory of commutative near-vector spaces ⋮ On ideal and weakly-ideal access structures ⋮ On identification secret sharing schemes. ⋮ The complexity of the graph access structures on six participants ⋮ Ideal uniform multipartite secret sharing schemes ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Ideal multipartite secret sharing schemes ⋮ Representability of matroids by \(c\)-arrangements is undecidable ⋮ Ideal hierarchical secret sharing and lattice path matroids ⋮ A remark on hierarchical threshold secret sharing ⋮ On representation theory and near-vector spaces ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ The free product of M-fuzzifying matroids1 ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Secret-Sharing Schemes: A Survey ⋮ Ideal Secret Sharing Schemes for Useful Multipartite Access Structures ⋮ Fully dynamic secret sharing schemes ⋮ New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures ⋮ On ideal homomorphic secret sharing schemes and their decomposition ⋮ On the information rate of secret sharing schemes ⋮ Lower bounds for monotone span programs ⋮ The complexity of the connected graph access structure on seven participants ⋮ An explication of secret sharing schemes ⋮ Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ Secret sharing on the \(d\)-dimensional cube ⋮ Secret sharing schemes on access structures with intersection number equal to one ⋮ Secret sharing schemes based on graphical codes ⋮ How to share a secret ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ Unnamed Item ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ The communication complexity of private simultaneous messages, revisited ⋮ Secret sharing and duality ⋮ The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures ⋮ On counting subspaces of near-vector spaces ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ Introduction to Secret-Sharing ⋮ On abelian and homomorphic secret sharing schemes ⋮ General information dispersal algorithms ⋮ Secret Sharing Schemes for Dense Forbidden Graphs ⋮ Hypergraph decomposition and secret sharing ⋮ On the optimization of bipartite secret sharing schemes ⋮ Ideal Hierarchical Secret Sharing Schemes ⋮ Ideal homomorphic secret sharing schemes over cyclic groups ⋮ Graph decompositions and secret sharing schemes ⋮ Efficient explicit constructions of compartmented secret sharing schemes ⋮ Matroid representations by partitions ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ A note on representing dowling geometries by partitions ⋮ On the size of shares for secret sharing schemes ⋮ Randomness in distribution protocols ⋮ Probability of shares in secret sharing schemes ⋮ Geometric secret sharing schemes and their duals
Cites Work
This page was built for publication: On the classification of ideal secret sharing schemes
