On secret sharing schemes

DOI10.1016/S0020-0190(97)00194-4zbMath1339.94073MaRDI QIDQ293172

Ugo Vaccaro, Carlo Blundo, Alfredo De Santis

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/S0020019097001944?np=y

zbMATH Keywords

cryptographysecret sharingsafety/security in digital systems

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

On secret set schemes, Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets, Secret-Sharing Schemes: A Survey, On ideal homomorphic secret sharing schemes and their decomposition, Sharing multiple secrets: Models, schemes and analysis, Matroids Can Be Far from Ideal Secret Sharing, Multiple ramp schemes, Probability of shares in secret sharing schemes

Cites Work

• Combinatorial lower bounds for secret sharing schemes
• Fully dynamic secret sharing schemes
• On the information rate of secret sharing schemes
• Randomness in distribution protocols
• On the classification of ideal secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• An explication of secret sharing schemes
• On the size of shares for secret sharing schemes
• On the dealer's randomness required in secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes
• Graph decompositions and secret sharing schemes
• On the information rate of perfect secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• On secret sharing systems
• New bounds on the information rate of secret sharing schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item