Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
From MaRDI portal
Publication:1853095
DOI10.1016/S0020-0190(02)00213-2zbMATH Open1043.94017OpenAlexW2017964091MaRDI QIDQ1853095FDOQ1853095
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
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
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- How to share a secret
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Perfect secret sharing schemes on five participants
- Tight bounds on the information rate of secret sharing schemes
- Graph decompositions and secret sharing schemes
- Secret sharing schemes with bipartite access structure
- Title not available (Why is that?)
- Weighted threshold secret sharing schemes
- Recursive constructions for perfect secret sharing schemes
Cited In (13)
- The lower bound and exact value of the information rate of some developed graph access structures
- New bounds on the information rate of secret sharing schemes
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Title not available (Why is that?)
- Secret-sharing schemes for very dense graphs
- On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
- Secret sharing schemes for dense forbidden graphs
- 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 secret sharing schemes, matroids and polymatroids
- Local bounds for the optimal information ratio of secret sharing schemes
- On the Power of Amortization in Secret Sharing
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)
