ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK
From MaRDI portal
Publication:5249040
DOI10.1142/S0129054100000168zbMath1320.94089MaRDI QIDQ5249040
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- Randomness in distribution protocols
- Secret sharing schemes for graph-based prohibited structures
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- Multiple assignment scheme for sharing secret
- On the size of shares for secret sharing schemes
- On the dealer's randomness required in secret sharing schemes
- Graph decompositions and secret sharing schemes
- On the information rate of perfect secret sharing schemes
- An efficient construction of perfect secret sharing schemes for graph-based structures
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
This page was built for publication: ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK