The following pages link to Secret-Sharing Schemes: A Survey (Q3005578):
Displaying 50 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← links)
- Secure computation without computers (Q517015) (← links)
- Secret sharing schemes for compartmented access structures (Q520077) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls (Q1633460) (← 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)
- Distributive weighted threshold secret sharing schemes (Q1671693) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Constructing ideal secret sharing schemes based on Chinese remainder theorem (Q1710679) (← links)
- Smart elements in combinatorial group testing problems (Q1752611) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- Classes of matroids closed under minors and principal extensions (Q1786053) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Finding the maximal adversary structure from any given access structure (Q1999100) (← links)
- Secret sharing schemes based on graphical codes (Q2016393) (← links)
- Secret sharing and duality (Q2033511) (← links)
- Tag-based ABE in prime-order groups via pair encoding (Q2043416) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Lower bounds for leakage-resilient secret sharing (Q2055623) (← links)
- Generic negation of pair encodings (Q2061950) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Abelian sharing, common informations, and linear rank inequalities (Q2168805) (← links)
- New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q]/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications (Q2185049) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
- Secret sharing schemes for infinite sets of participants: a new design technique (Q2227498) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- Cooperative secret sharing using QR codes and symmetric keys (Q2331807) (← links)
- Efficient explicit constructions of compartmented secret sharing schemes (Q2334444) (← links)
- Roughly weighted hierarchical simple games (Q2349411) (← links)
- Practical (fully) distributed signatures provably secure in the standard model (Q2354772) (← links)
- Secret-sharing for NP (Q2397445) (← links)
- Local bounds for the optimal information ratio of secret sharing schemes (Q2416938) (← links)
- Algebraic manipulation detection codes (Q2438532) (← links)
- Secure message transmission on directed networks (Q2442837) (← links)
- Long term confidentiality: a survey (Q2448088) (← 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)
- Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 (Q2673979) (← links)
- Semi-quantum cryptography (Q2677162) (← links)
- Ideal hierarchical secret sharing and lattice path matroids (Q2697480) (← links)
