Lower bounds for robust secret sharing schemes
From MaRDI portal
Publication:287197
DOI10.1016/S0020-0190(97)00135-XzbMath1336.94077MaRDI QIDQ287197
Carlo Blundo, Alfredo De Santis
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
68P25: Data encryption (aspects in computer science)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
94A62: Authentication, digital signatures and secret sharing
Related Items
Robust vector space secret sharing schemes, The use of mathematical linguistic methods in creating secret sharing threshold algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to share a secret with cheaters
- New bounds and constructions for authentication/secrecy codes with splitting
- An explication of secret sharing schemes
- On a fallacious bound for authentication codes
- Probability of shares in secret sharing schemes
- Optimum Secret Sharing Scheme Secure against Cheating
- How to share a secret
- Decomposition constructions for secret-sharing schemes