scientific article; zbMATH DE number 503323

MaRDI QIDQ4279656zbMATH OpenFDO

Authors Carlo Blundo, Alfredo De Santis, D. R. Stinson, Ugo Vaccaro

Publication date 22 February 1994

zbMATH Keywords

access structuresgraph decompositionsinformation ratelinear programmingsecret sharing schemesupper and lower bounds

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Cryptography (94A60)

Recommendations

• Graph decompositions and secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• scientific article; zbMATH DE number 708803

Cited in

(25)

• Hypergraph decomposition and secret sharing
• An impossibility result on graph secret sharing
• Secret sharing schemes for graph-based prohibited structures
• Some improved bounds on the information rate of perfect secret sharing schemes
• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• Graph decompositions and secret sharing schemes
• On the information rate of perfect secret sharing schemes
• An efficient construction of perfect secret sharing schemes for graph-based structures
• Recursive constructions for perfect secret sharing schemes
• Secret sharing schemes based on graphical codes
• Optimal assignment schemes for general access structures based on linear programming
• The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
• An efficient threshold group signature scheme
• Optimal linear secret sharing schemes for graph access structures on six participants
• Access structure in graphs in high dimension and application to secret sharing
• Decomposition constructions for secret-sharing schemes
• scientific article; zbMATH DE number 708803 (Why is no real title available?)
• scientific article; zbMATH DE number 1775121 (Why is no real title available?)
• Randomness in distribution protocols
• On the information ratio of graphs with many leaves
• Decomposition construction for secret sharing schemes with graph access structures in polynomial time
• Sum graph based access structure in a secret sharing scheme
• Optimal secret share distribution in degree splitting communication networks
• Fully dynamic secret sharing schemes
• On the information rate of secret sharing schemes

This page was built for publication:

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