New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
From MaRDI portal
Publication:497216
DOI10.1016/j.ins.2013.03.047zbMath1366.94559OpenAlexW2092529344MaRDI QIDQ497216
Publication date: 23 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.03.047
access structuresecret-sharing schemecomplete multipartite coveringoptimal average information rateoptimal information rateweighted threshold access structure
Related Items (3)
Memory leakage-resilient secret sharing schemes ⋮ The lower bound and exact value of the information rate of some developed graph access structures ⋮ Realizing secret sharing with general access structure
Cites Work
- Unnamed Item
- An ideal multi-secret sharing scheme based on MSP
- Probabilistic visual secret sharing schemes for grey-scale images and color images
- Visual multiple secret sharing based upon turning and flipping
- Perfect secret sharing schemes on five participants
- Strong \((n, t, n)\) verifiable secret sharing scheme
- An impossibility result on graph secret sharing
- On the classification of ideal secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- Weighted threshold secret sharing schemes
- Graph decompositions and secret sharing schemes
- On the information rate of perfect secret sharing schemes
- Threshold cryptography based on Asmuth-Bloom secret sharing
- New efficient and practical verifiable multi-secret sharing schemes
- Secret sharing schemes with bipartite access structure
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Decomposition constructions for secret-sharing schemes
- New bounds on the information rate of secret sharing schemes
This page was built for publication: New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
