Sharing one secret vs. sharing many secrets.
From MaRDI portal
Publication:1401235
DOI10.1016/S0304-3975(02)00399-7zbMath1045.68057MaRDI QIDQ1401235
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Visual cryptography on graphs ⋮ Attacks to some verifiable multi-secret sharing schemes and two improved schemes ⋮ A scheme for threshold multi-secret sharing ⋮ Strongly secure ramp secret sharing schemes for general access structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the information rate of secret sharing schemes
- A construction for multisecret threshold schemes
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- Anonymous secret sharing schemes
- The size of a share must be large
- On the information rate of perfect secret sharing schemes
- Ideal secret sharing schemes with multiple secrets
- How to share a secret
- Products and Help Bits in Decision Trees
- Decomposition constructions for secret-sharing schemes
- New bounds on the information rate of secret sharing schemes
- Amortized Communication Complexity
This page was built for publication: Sharing one secret vs. sharing many secrets.
