The following pages link to The size of a share must be large (Q1382142):
Displaying 50 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Secret sharing based on quantum Fourier transform (Q356899) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid (Q533769) (← links)
- An ideal multi-secret sharing scheme based on MSP (Q543828) (← links)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- The complexity of the graph access structures on six participants (Q1943986) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
- On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- On group-characterizability of homomorphic secret sharing schemes (Q2235752) (← links)
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
- Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures (Q2510652) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Secret sharing on large girth graphs (Q2632835) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not (Q2958149) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- How to share a secret (Q3050283) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- Recent Advances in Non-perfect Secret Sharing Schemes (Q3188243) (← links)
- Ideal Hierarchical Secret Sharing Schemes (Q3408196) (← links)
- Algebraic Cryptanalysis of CTRU Cryptosystem (Q3511333) (← links)
- Probabilistic secret sharing (Q5005168) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- Threshold secret sharing requires a linear-size alphabet (Q5140836) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)
