Decomposition constructions for secret-sharing schemes
From MaRDI portal
Recommendations
Cited in
(76)- 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
- An explication of secret sharing schemes
- General information dispersal algorithms
- A general decomposition construction for incomplete secret sharing schemes
- Anonymous secret sharing schemes
- Sharing one secret vs. sharing many secrets.
- On identification secret sharing schemes.
- Weighted decomposition construction for perfect secret sharing schemes
- On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Secret sharing schemes with three or four minimal qualified subsets
- Reduced access structures with four minimal qualified subsets on six participants
- A perfect threshold secret sharing scheme to identify cheaters
- Randomness in secret sharing and visual cryptography schemes
- Graph decompositions and secret sharing schemes
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- Some democratic secret sharing schemes
- On the information rate of perfect secret sharing schemes
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Recursive constructions for perfect secret sharing schemes
- On ideal homomorphic secret sharing schemes and their decomposition
- Exact information ratios for secret sharing on small graphs with girth at least 5
- On abelian and homomorphic secret sharing schemes
- Strong security of linear ramp secret sharing schemes with general access structures
- Common information, matroid representation, and secret sharing for matroid ports
- On the information ratio of graphs without high-degree neighbors
- Optimal assignment schemes for general access structures based on linear programming
- Secret sharing on the \(d\)-dimensional cube
- Efficient explicit constructions of compartmented secret sharing schemes
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
- Secret sharing schemes on access structures with intersection number equal to one
- Sharing multiple secrets: Models, schemes and analysis
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
- Optimal linear secret sharing schemes for graph access structures on six participants
- Secret sharing on large girth graphs
- Rational quantum secret sharing scheme based on GHZ state
- Secret sharing schemes for dense forbidden graphs
- Lower bounds for robust secret sharing schemes
- Secret-sharing schemes for very dense graphs
- On secret sharing schemes
- Robust vector space secret sharing schemes
- Secret-Sharing Schemes: A Survey
- Ideal secret sharing schemes for useful multipartite access structures
- On secret sharing schemes, matroids and polymatroids
- Critical set of caterpillar graph for secret sharing scheme
- On Linear Secret Sharing for Connectivity in Directed Graphs
- A New (k,n)-Threshold Secret Sharing Scheme and Its Extension
- Complexity of universal access structures
- scientific article; zbMATH DE number 503323 (Why is no real title available?)
- scientific article; zbMATH DE number 1107673 (Why is no real title available?)
- Randomness in distribution protocols
- Ideal secret sharing schemes on graph-based 3-homogeneous access structures
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
- Erdős-Pyber theorem for hypergraphs and secret sharing
- The complexity of the connected graph access structure on seven participants
- Algorithms and Computation
- On the dealer's randomness required in perfect secret sharing schemes with access structures of constant rank
- Decomposition construction for secret sharing schemes with graph access structures in polynomial time
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- Approximation and decomposition in lattices of clutters
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
- Visual cryptography on graphs
- On-line secret sharing
- Fully dynamic secret sharing schemes
- On the information rate of secret sharing schemes
- New method to compute bounds on the optimal information rate of secret sharing schemes
- (k, n)-consecutive access structures
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- On the optimization of bipartite secret sharing schemes
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- A note on secret sharing schemes with three homogeneous access structure
This page was built for publication: Decomposition constructions for secret-sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307278)
