Lower bounds for robust secret sharing schemes

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)

zbMATH Keywords

cryptographysecret sharingsafety/security in digital systems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Robust vector space secret sharing schemes ⋮ The use of mathematical linguistic methods in creating secret sharing threshold algorithms ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes

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

This page was built for publication: Lower bounds for robust secret sharing schemes