The following pages link to On secret sharing systems (Q4739795):
Displaying 50 items.
- Combinatorial lower bounds for secret sharing schemes (Q286957) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On secret sharing schemes (Q293172) (← links)
- On secret set schemes (Q294774) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Linear threshold multisecret sharing schemes (Q456082) (← links)
- A new secret sharing scheme (Q509279) (← links)
- Secure computation without computers (Q517015) (← 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)
- On-line secret sharing (Q664393) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Error-correcting codes and cryptography (Q937222) (← links)
- Linear multi-secret sharing schemes based on multi-party computation (Q998657) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Multipartite secret sharing by bivariate interpolation (Q1015357) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- Strongly secure ramp secret sharing schemes for general access structures (Q1045894) (← links)
- Summing over a network without revealing summands (Q1119609) (← links)
- An explication of secret sharing schemes (Q1203951) (← links)
- Shared secret reconstruction (Q1265229) (← links)
- General information dispersal algorithms (Q1274915) (← links)
- Ideal homomorphic secret sharing schemes over cyclic groups (Q1286658) (← links)
- On the size of shares for secret sharing schemes (Q1310452) (← links)
- A note on dynamic threshold schemes (Q1350356) (← links)
- On identification secret sharing schemes. (Q1401951) (← links)
- Probability of shares in secret sharing schemes (Q1607017) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- On the bound for anonymous secret sharing schemes (Q1613401) (← 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)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Ideal ramp schemes and related combinatorial objects (Q1685978) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Timed-release computational secret sharing and threshold encryption (Q1692147) (← links)
- Improvement of assurance including security for wireless sensor networks using dispersed data transmission (Q1757826) (← links)
- New secret sharing scheme based on linear code (Q1764386) (← links)
- An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme (Q1774928) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- A perfect threshold secret sharing scheme to identify cheaters (Q1804974) (← links)
- Generation of key predistribution schemes using secret sharing schemes (Q1811107) (← links)
- A lower bound on the encoding length in lossy transmission (Q1818962) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- Some democratic secret sharing schemes (Q1893162) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
