Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

DOI10.1007/S10623-008-9264-9MaRDI QIDQ1009166zbMATH OpenOpenAlexFDO

Authors Jaume Martí-Farré, Carles Padró

Publication date 31 March 2009

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-008-9264-9

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
• Secret sharing schemes for ports of matroids of rank 3.
• On Secret Sharing Schemes, Matroids and Polymatroids
• On Matroids and Nonideal Secret Sharing
• Ideal multipartite secret sharing schemes

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 708803 (Why is no real title available?)
• A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
• A Solution of the Shannon Switching Game
• A note on secret sharing schemes with three homogeneous access structure
• Almost affine codes
• An explication of secret sharing schemes
• How to share a secret
• Ideal Multipartite Secret Sharing Schemes
• Matroid representations by partitions
• On Secret Sharing Schemes, Matroids and Polymatroids
• On secret sharing systems
• On secret-sharing matroids
• On the classification of ideal secret sharing schemes
• On the size of shares for secret sharing schemes
• Perfect secret sharing schemes on five participants
• Secret sharing schemes on access structures with intersection number equal to one
• Secret sharing schemes on sparse homogeneous access structures with rank three
• Secret sharing schemes with bipartite access structure
• Secret sharing schemes with three or four minimal qualified subsets
• The size of a share must be large
• Theory of Cryptography
• Tight bounds on the information rate of secret sharing schemes

Cited in

(12)

• On the composition of secret sharing schemes related to codes
• On the diameter of matroid ports
• One-adhesive polymatroids.
• Secret sharing schemes for ports of matroids of rank 3.
• Ideal secret sharing schemes on graph-based 3-homogeneous access structures
• Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
• Secret sharing schemes on sparse homogeneous access structures with rank three
• On abelian and homomorphic secret sharing schemes
• Ideal hierarchical secret sharing schemes
• How to share a secret
• A remark on hierarchical threshold secret sharing
• Ideal hierarchical secret sharing and lattice path matroids

This page was built for publication: Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009166)