On Secret Sharing Schemes, Matroids and Polymatroids
From MaRDI portal
(Redirected from Publication:3596383)
Recommendations
- On secret sharing schemes, matroids and polymatroids
- On secret-sharing matroids
- On the composition of matroids and ideal secret sharing schemes
- On matroid characterization of ideal secret sharing schemes
- scientific article; zbMATH DE number 1394291
- Generalized ideal secret-sharing schemes and matroids
- Theory of Cryptography
- A representation of a family of secret sharing matroids
- Secret-sharing matroids need not be algebraic
Cited in
(29)- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- On the diameter of matroid ports
- An impossibility result on graph secret sharing
- Common information, matroid representation, and secret sharing for matroid ports
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Secret sharing on the \(d\)-dimensional cube
- On secret set schemes
- The free product of M-fuzzifying matroids
- Secret-Sharing Schemes: A Survey
- On secret sharing schemes, matroids and polymatroids
- scientific article; zbMATH DE number 994583 (Why is no real title available?)
- Ideal hierarchical secret sharing schemes
- Two Constructions on Limits of Entropy Functions
- On Matroids and Nonideal Secret Sharing
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
- scientific article; zbMATH DE number 2020870 (Why is no real title available?)
- scientific article; zbMATH DE number 6321321 (Why is no real title available?)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- scientific article; zbMATH DE number 5238593 (Why is no real title available?)
- Matroids Can Be Far from Ideal Secret Sharing
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
- Secret sharing schemes for ports of matroids of rank 3.
- Natural generalizations of threshold secret sharing
- Theory of Cryptography
- scientific article; zbMATH DE number 7759464 (Why is no real title available?)
- On-line secret sharing
- Efficient robust secret sharing from expander graphs
- New method to compute bounds on the optimal information rate of secret sharing schemes
- Extensions of access structures and their cryptographic applications
This page was built for publication: On Secret Sharing Schemes, Matroids and Polymatroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596383)