Weighted decomposition construction for perfect secret sharing schemes

DOI10.1016/S0898-1221(01)00328-5MaRDI QIDQ1609153zbMATH OpenFDO

Authors Hung-Min Sun, Bor-Liang Chen

Publication date 15 August 2002

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

zbMATH Keywords

cryptographydata securityinformation ratesperfect secret sharing schemesweighted decomposition construction

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1107673
• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Hypergraph decomposition and secret sharing
• Decomposition construction for secret sharing schemes with graph access structures in polynomial time

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 553905 (Why is no real title available?)
• scientific article; zbMATH DE number 708804 (Why is no real title available?)
• scientific article; zbMATH DE number 1544184 (Why is no real title available?)
• scientific article; zbMATH DE number 812038 (Why is no real title available?)
• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• How to share a secret
• Multiple assignment scheme for sharing secret
• On secret sharing systems
• On the dealer's randomness required in secret sharing schemes
• On the information rate of perfect secret sharing schemes
• On the information rate of secret sharing schemes
• On the size of shares for secret sharing schemes
• Perfect secret sharing schemes on five participants
• Randomness in distribution protocols
• Some improved bounds on the information rate of perfect secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes

Cited in

(12)

• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• Exact information ratios for secret sharing on small graphs with girth at least 5
• The complexity of the graph access structures on six participants
• On the information ratio of graphs without high-degree neighbors
• On ideal homomorphic secret sharing schemes and their decomposition
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• Reduced access structures with four minimal qualified subsets on six participants
• Optimal linear secret sharing schemes for graph access structures on six participants
• Weighted skeletons and fixed-share decomposition
• Secret sharing on regular bipartite access structures
• The complexity of the connected graph access structure on seven participants

This page was built for publication: Weighted decomposition construction for perfect secret sharing schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609153)