scientific article; zbMATH DE number 503323
From MaRDI portal
Publication:4279656
zbMATH Open0789.94005MaRDI QIDQ4279656FDOQ4279656
Authors: Carlo Blundo, Alfredo De Santis, D. R. Stinson, Ugo Vaccaro 
Publication date: 22 February 1994
Title of this publication is not available (Why is that?)
Recommendations
linear programminggraph decompositionsupper and lower boundsinformation ratesecret sharing schemesaccess structures
Cryptography (94A60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (20)
- An efficient threshold group signature scheme
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Title not available (Why is that?)
- Secret sharing schemes for graph-based prohibited structures
- Secret sharing schemes based on graphical codes
- On the information rate of secret sharing schemes
- Fully dynamic secret sharing schemes
- On the information ratio of graphs with many leaves
- Hypergraph decomposition and secret sharing
- Some improved bounds on the information rate of perfect secret sharing schemes
- 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
- Decomposition construction for secret sharing schemes with graph access structures in polynomial time
- On the information rate of perfect secret sharing schemes
- Optimal linear secret sharing schemes for graph access structures on six participants
- Title not available (Why is that?)
- Access structure in graphs in high dimension and application to secret sharing
- Recursive constructions for perfect secret sharing schemes
- Randomness in distribution protocols
- Sum graph based access structure in a secret sharing scheme
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)
