Secret sharing schemes on access structures with intersection number equal to one

DOI10.1016/J.DAM.2005.09.003zbMATH Open1091.94034OpenAlexW2092892095MaRDI QIDQ2489950FDOQ2489950

Authors: Jaume Martí-Farré, Carles Padró 

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.003

Recommendations

• scientific article; zbMATH DE number 1952912
• scientific article; zbMATH DE number 1303145
• A note on secret sharing schemes with three homogeneous access structure
• Secret sharing schemes with three or four minimal qualified subsets
• Secret sharing schemes with bipartite access structure

zbMATH Keywords

cryptographyinformation ratesecret sharing schemesideal schemes

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• How to share a secret
• On the classification of ideal secret sharing schemes
• Almost affine codes
• Some improved bounds on the information rate of perfect secret sharing schemes
• An explication of secret sharing schemes
• On the size of shares for secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Perfect secret sharing schemes on five participants
• Tight bounds on the information rate of secret sharing schemes
• Secret sharing schemes with three or four minimal qualified subsets
• Graph decompositions and secret sharing schemes
• Secret sharing schemes with bipartite access structure
• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometric secret sharing schemes and their duals

Cited In (12)

• The accessibility of an access structure
• Title not available (Why is that?)
• A note on secret sharing schemes with three homogeneous access structure
• Optimal complexity of secret sharing schemes with four minimal qualified subsets
• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
• Hypergraph decomposition and secret sharing
• Ideal secret sharing schemes on graph-based 3-homogeneous access structures
• Reduced access structures with four minimal qualified subsets on six participants
• On abelian and homomorphic secret sharing schemes
• Optimal linear secret sharing schemes for graph access structures on six participants
• Secret Sharing Schemes for (k, n)-Consecutive Access Structures
• On secret sharing schemes, matroids and polymatroids

This page was built for publication: Secret sharing schemes on access structures with intersection number equal to one

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