Recommendations
Cited in
(56)- A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not
- Probabilistic secret sharing
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Matroids Can Be Far from Ideal Secret Sharing
- Threshold Secret Sharing Requires a Linear Size Alphabet
- On the information ratio of non-perfect secret sharing schemes
- The complexity of the graph access structures on six participants
- On the information ratio of graphs without high-degree neighbors
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- On group-characterizability of homomorphic secret sharing schemes
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Improved polynomial secret-sharing schemes
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
- Towards breaking the exponential barrier for general secret sharing
- Secret-sharing schemes for very dense graphs
- Algebraic Cryptanalysis of CTRU Cryptosystem
- Quadratic secret sharing and conditional disclosure of secrets
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
- Ideal multipartite secret sharing schemes
- Recent advances in non-perfect secret sharing schemes
- Secret sharing on large girth graphs
- An ideal multi-secret sharing scheme based on MSP
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- Secret sharing schemes for dense forbidden graphs
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Hypergraph decomposition and secret sharing
- An impossibility result on graph secret sharing
- Threshold secret sharing requires a linear-size alphabet
- Secret sharing schemes for ports of matroids of rank 3.
- Randomness recoverable secret sharing schemes
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Common information, matroid representation, and secret sharing for matroid ports
- Sharing multiple secrets: Models, schemes and analysis
- 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
- On the optimization of bipartite secret sharing schemes
- On abelian and homomorphic secret sharing schemes
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- Ideal hierarchical secret sharing schemes
- Access structures determined by uniform polymatroids
- How to share a secret
- Optimal linear secret sharing schemes for graph access structures on six participants
- Secret sharing based on quantum Fourier transform
- Ideal secret sharing schemes for useful multipartite access structures
- Succinct computational secret sharing
- Sharing one secret vs. sharing many secrets.
- On secret sharing schemes, matroids and polymatroids
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
- Some open problems in information-theoretic cryptography
- Secret sharing on regular bipartite access structures
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Secret-Sharing Schemes: A Survey
- Local bounds for the optimal information ratio of secret sharing schemes
- Bipartite secret sharing and staircases
This page was built for publication: The size of a share must be large
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382142)
