On Secret Sharing Schemes, Matroids and Polymatroids
From MaRDI portal
Publication:3596383
DOI10.1007/978-3-540-70936-7_15zbMATH Open1129.94029OpenAlexW2178407497MaRDI QIDQ3596383FDOQ3596383
Carles Padró, Jaume Martí-Farré
Publication date: 30 August 2007
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_15
MatroidsSecret sharingPolymatroidsIdeal access structuresIdeal secret sharing schemesInformation rate
Cited In (16)
- Matroids Can Be Far from Ideal Secret Sharing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extensions of access structures and their cryptographic applications
- On secret set schemes
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- An impossibility result on graph secret sharing
- Title not available (Why is that?)
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
- Secret sharing on the \(d\)-dimensional cube
- The free product of M-fuzzifying matroids1
- Secret-Sharing Schemes: A Survey
- On-line secret sharing
- Efficient robust secret sharing from expander graphs
- Ideal Hierarchical Secret Sharing Schemes
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 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)
