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

DOI10.1016/J.DAM.2005.09.003MaRDI QIDQ2489950zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cryptographyinformation ratesecret sharing schemesideal schemes

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

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

Cites work

• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 708803 (Why is no real title available?)
• Almost affine codes
• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Geometric secret sharing schemes and their duals
• Graph decompositions and secret sharing schemes
• How to share a secret
• 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 with bipartite access structure
• Secret sharing schemes with three or four minimal qualified subsets
• Some improved bounds on the information rate of perfect secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes

Cited in

(12)

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

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)