On secret-sharing matroids

From MaRDI portal
Revision as of 06:12, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1204471

DOI10.1016/0095-8956(92)90007-KzbMath0771.05028MaRDI QIDQ1204471

P. D. Seymour

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)




Related Items (30)

Top-heavy phenomena for transformationsLinearly dependent vectorial decomposition of cluttersSecret-sharing matroids need not be algebraicImproving the linear programming technique in the search for lower bounds in secret sharingFrom clutters to matroidsAccess structures determined by uniform polymatroidsOn ideal and weakly-ideal access structuresFinding lower bounds on the complexity of secret sharing schemes by linear programmingIdeal multipartite secret sharing schemesIdeal hierarchical secret sharing and lattice path matroidsCommon information, matroid representation, and secret sharing for matroid portsThe free product of M-fuzzifying matroids1Ideal Secret Sharing Schemes for Useful Multipartite Access StructuresOn ideal homomorphic secret sharing schemes and their decompositionAn explication of secret sharing schemesImproved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroidExtending Brickell-Davenport theorem to non-perfect secret sharing schemesCompletion and decomposition of a clutter into representable matroidsOn secret sharing schemes, matroids and polymatroidsClasses of matroids closed under minors and principal extensionsMatroids Can Be Far from Ideal Secret SharingIdeal secret sharing schemes whose minimal qualified subsets have at most three participantsIntroduction to Secret-SharingOn abelian and homomorphic secret sharing schemesHypergraph decomposition and secret sharingIdeal homomorphic secret sharing schemes over cyclic groupsGraph decompositions and secret sharing schemesMatroid representations by partitionsOne-adhesive polymatroidsA note on representing dowling geometries by partitions




Cites Work




This page was built for publication: On secret-sharing matroids