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