Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.

DOI10.1016/S0020-0190(02)00213-2zbMath1043.94017OpenAlexW2017964091MaRDI QIDQ1853095

Germán Sáez, Carles Padró

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00213-2

zbMATH Keywords

cryptographyinformation ratesecret sharing schemes

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Ideal secret sharing schemes on graph-based $3$-homogeneous access structures, Secret-sharing schemes for very dense graphs, Optimal complexity of secret sharing schemes with four minimal qualified subsets, On secret sharing schemes, matroids and polymatroids, Reduced access structures with four minimal qualified subsets on six participants, Secret Sharing Schemes for Dense Forbidden Graphs, Hypergraph decomposition and secret sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect secret sharing schemes on five participants
• 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
• Tight bounds on the information rate of secret sharing schemes
• Weighted threshold secret sharing schemes
• Graph decompositions and secret sharing schemes
• Recursive constructions for perfect secret sharing schemes
• Secret sharing schemes with bipartite access structure
• How to share a secret
• Decomposition constructions for secret-sharing schemes