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

DOI10.1016/S0020-0190(02)00213-2MaRDI QIDQ1853095zbMATH OpenOpenAlexFDO

Authors Carles Padró, Germán Sáez

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)

Recommendations

• Tight bounds on the information rate of secret sharing schemes
• scientific article; zbMATH DE number 708804
• On the information rate of secret sharing schemes
• scientific article; zbMATH DE number 708803
• New bounds on the information rate of secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• On the information rate of perfect secret sharing schemes
• On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
• Secret Sharing, Rank Inequalities, and Information Inequalities
• Secret sharing, rank inequalities and information inequalities

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 708804 (Why is no real title available?)
• scientific article; zbMATH DE number 774344 (Why is no real title available?)
• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• How to share a secret
• On the size of shares for secret sharing schemes
• Perfect secret sharing schemes on five participants
• Recursive constructions for perfect secret sharing schemes
• Secret sharing schemes with bipartite access structure
• Some improved bounds on the information rate of perfect secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes
• Weighted threshold secret sharing schemes

Cited in

(13)

• On the Power of Amortization in Secret Sharing
• Hypergraph decomposition and secret sharing
• On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
• Secret sharing schemes for dense forbidden graphs
• Local bounds for the optimal information ratio of secret sharing schemes
• The lower bound and exact value of the information rate of some developed graph access structures
• Optimal complexity of secret sharing schemes with four minimal qualified subsets
• New bounds on the information rate of secret sharing schemes
• On secret sharing schemes, matroids and polymatroids
• scientific article; zbMATH DE number 708804 (Why is no real title available?)
• Ideal secret sharing schemes on graph-based 3-homogeneous access structures
• Reduced access structures with four minimal qualified subsets on six participants
• Secret-sharing schemes for very dense graphs

This page was built for publication: Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.

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