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

DOI10.1007/S10623-008-9264-9zbMATH Open1237.94114OpenAlexW2158722859MaRDI QIDQ1009166FDOQ1009166

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Ideal secret sharing schemes on graph-based $3$-homogeneous access structures
• One-adhesive polymatroids
• Secret sharing schemes for ports of matroids of rank 3
• On the diameter of matroid ports
• 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
• ON THE COMPOSITION OF SECRET SHARING SCHEMES RELATED TO CODES
• 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)