Recommendations
Cited in
(22)- Theory of Cryptography
- Matroids Can Be Far from Ideal Secret Sharing
- Secret-sharing matroids need not be algebraic
- On the diameter of matroid ports
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- On secret-sharing matroids
- On the composition of matroids and ideal secret sharing schemes
- On ideal homomorphic secret sharing schemes and their decomposition
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Secret sharing schemes for ports of matroids of rank 3.
- A representation of a family of secret sharing matroids
- scientific article; zbMATH DE number 1394291 (Why is no real title available?)
- On the Power of Nonlinear Secret-Sharing
- scientific article; zbMATH DE number 708819 (Why is no real title available?)
- Common information, matroid representation, and secret sharing for matroid ports
- Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
- On abelian and homomorphic secret sharing schemes
- On ideal and weakly-ideal access structures
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
- A remark on hierarchical threshold secret sharing
- On secret sharing schemes, matroids and polymatroids
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
This page was built for publication: On Matroids and Nonideal Secret Sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604544)