Recursive constructions for perfect secret sharing schemes

DOI10.1016/S0898-1221(99)00049-8zbMath0935.94025OpenAlexW1979040220MaRDI QIDQ1962965

Shiuh-Pyng Shieh, Hung-Min Sun

Publication date: 20 January 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00049-8

zbMATH Keywords

information ratesecret sharing schemerecursive constructionsaccess structures of constant rank

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Perfect secret sharing scheme based on vertex domination set ⋮ Recursive hiding of biometrics-based secret sharing scheme using adversary structure ⋮ Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some improved bounds on the information rate of perfect secret sharing schemes
• Multiple assignment scheme for sharing secret
• On the size of shares for 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
• How to share a secret
• Decomposition constructions for secret-sharing schemes
• On secret sharing systems

This page was built for publication: Recursive constructions for perfect secret sharing schemes