On secret-sharing matroids
From MaRDI portal
Publication:1204471
DOI10.1016/0095-8956(92)90007-KzbMath0771.05028MaRDI QIDQ1204471
Publication date: 10 March 1993
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Top-heavy phenomena for transformations, Linearly dependent vectorial decomposition of clutters, Secret-sharing matroids need not be algebraic, Improving the linear programming technique in the search for lower bounds in secret sharing, From clutters to matroids, Access structures determined by uniform polymatroids, On ideal and weakly-ideal access structures, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Ideal multipartite secret sharing schemes, Ideal hierarchical secret sharing and lattice path matroids, Common information, matroid representation, and secret sharing for matroid ports, The free product of M-fuzzifying matroids1, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, On ideal homomorphic secret sharing schemes and their decomposition, 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, Completion and decomposition of a clutter into representable matroids, On secret sharing schemes, matroids and polymatroids, Classes of matroids closed under minors and principal extensions, Matroids Can Be Far from Ideal Secret Sharing, Ideal secret sharing schemes whose minimal qualified subsets have at most three participants, Introduction to Secret-Sharing, On abelian and homomorphic secret sharing schemes, Hypergraph decomposition and secret sharing, Ideal homomorphic secret sharing schemes over cyclic groups, Graph decompositions and secret sharing schemes, Matroid representations by partitions, One-adhesive polymatroids, A note on representing dowling geometries by partitions
Cites Work