Welcome to the resource topic for 2010/348
Title:
Lattice-theoretic Characterization of Secret Sharing Representable Connected Matroids
Authors: A. N. Alekseychuk
Abstract:Necessary and sufficient conditions for a connected matroid to be secret sharing (ss-)representable are obtained. We show that the flat lattices of ss-representable matroids are closely related with well-studied algebraic objects called linear lattices. This fact implies that new powerful methods (from lattice theory and mathematical logic) for investigation of ss-representable matroids can be applied. We also obtain some necessary conditions for a connected matroid to be ss-representable. Namely, we construct an infinite set of sentences (like to Haiman’s “higher Arguesian identities”) which are hold in all ss-representable matroids.
ePrint: https://eprint.iacr.org/2010/348
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .