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

DOI10.1007/s10623-008-9264-9zbMath1237.94114OpenAlexW2158722859MaRDI QIDQ1009166

Carles Padró, Jaume Martí-Farré

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)

Related Items (7)

Ideal secret sharing schemes on graph-based $3$-homogeneous access structures ⋮ ON THE COMPOSITION OF SECRET SHARING SCHEMES RELATED TO CODES ⋮ How to share a secret ⋮ On abelian and homomorphic secret sharing schemes ⋮ Ideal Hierarchical Secret Sharing Schemes ⋮ One-adhesive polymatroids ⋮ Secret sharing schemes for ports of matroids of rank 3

Cites Work

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

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