Robust vector space secret sharing schemes
From MaRDI portal
Publication:293422
DOI10.1016/S0020-0190(98)00149-5zbMath1337.94099MaRDI QIDQ293422
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001495?np=y
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for robust secret sharing schemes
- How to share a secret with cheaters
- An explication of secret sharing schemes
- How to avoid the cheaters succeeding in the key sharing scheme
- Detection of cheaters in vector space secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- A perfect threshold secret sharing scheme to identify cheaters
- Graph decompositions and secret sharing schemes
- Optimum Secret Sharing Scheme Secure against Cheating
- How to share a secret
- The Detection of Cheaters in Thershold Schemes
- Decomposition constructions for secret-sharing schemes
This page was built for publication: Robust vector space secret sharing schemes