On Secret Sharing Schemes, Matroids and Polymatroids

DOI10.1007/978-3-540-70936-7_15MaRDI QIDQ3596383zbMATH OpenOpenAlexFDO

Authors Jaume Martí-Farré, Carles Padró

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

zbMATH Keywords

MatroidsSecret sharingPolymatroidsIdeal access structuresIdeal secret sharing schemesInformation rate

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of matroids and geometric lattices (05B35)

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

(27)

• Theory of Cryptography
• Matroids Can Be Far from Ideal Secret Sharing
• scientific article; zbMATH DE number 2020870 (Why is no real title available?)
• scientific article; zbMATH DE number 5238593 (Why is no real title available?)
• scientific article; zbMATH DE number 6321321 (Why is no real title available?)
• Natural generalizations of threshold secret sharing
• On the diameter of matroid ports
• Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
• Extensions of access structures and their cryptographic applications
• On Matroids and Nonideal Secret Sharing
• On secret set schemes
• The free product of \(M\)-fuzzifying matroids
• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
• An impossibility result on graph secret sharing
• Secret sharing schemes for ports of matroids of rank 3.
• scientific article; zbMATH DE number 7759464 (Why is no real title available?)
• On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
• Two Constructions on Limits of Entropy Functions
• Common information, matroid representation, and secret sharing for matroid ports
• Secret sharing on the \(d\)-dimensional cube
• Ideal hierarchical secret sharing schemes
• On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
• On secret sharing schemes, matroids and polymatroids
• Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
• Secret-Sharing Schemes: A Survey
• On-line secret sharing
• Efficient robust secret sharing from expander graphs

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)