Optimal information ratio of secret sharing schemes on Dutch windmill graphs
From MaRDI portal
Publication:1726013
DOI10.3934/amc.2019005zbMath1405.94099OpenAlexW2905546425WikidataQ128707108 ScholiaQ128707108MaRDI QIDQ1726013
Ali Zaghian, Shahrooz Janbaz, Bagher Bagherpour
Publication date: 15 February 2019
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2019005
Related Items (2)
Ideal secret sharing schemes on graph-based $3$-homogeneous access structures ⋮ An efficient publicly verifiable and proactive secret sharing scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the information rate of secret sharing schemes
- Perfect secret sharing schemes on five participants
- An impossibility result on graph secret sharing
- An explication of secret sharing schemes
- Multiple assignment scheme for sharing secret
- On the size of shares for secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Weighted decomposition construction for perfect secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- Secret sharing schemes with bipartite access structure
- Optimal Information Rate of Secret Sharing Schemes on Trees
- How to share a secret
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
- Decomposition constructions for secret-sharing schemes
- Elements of Information Theory
This page was built for publication: Optimal information ratio of secret sharing schemes on Dutch windmill graphs
