On matroid characterization of ideal secret sharing schemes
DOI10.1007/S001459900036zbMATH Open0960.94019OpenAlexW2091268429WikidataQ126422883 ScholiaQ126422883MaRDI QIDQ1126889FDOQ1126889
Authors: J. Dj. Golić
Publication date: 20 May 2001
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459900036
Recommendations
matroidaccess structurebalanced maximum-order correlation immune functionsideal secret sharing schemes
Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62)
Cited In (7)
- On Secret Sharing Schemes, Matroids and Polymatroids
- Title not available (Why is that?)
- On the composition of matroids and ideal secret sharing schemes
- A representation of a family of secret sharing matroids
- Two Constructions on Limits of Entropy Functions
- Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
- Ideal hierarchical secret sharing and lattice path matroids
This page was built for publication: On matroid characterization of ideal secret sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126889)