Pages that link to "Item:Q1203951"
From MaRDI portal
The following pages link to An explication of secret sharing schemes (Q1203951):
Displaying 50 items.
- Lower bounds for robust secret sharing schemes (Q287197) (← links)
- On secret sharing schemes (Q293172) (← links)
- Robust vector space secret sharing schemes (Q293422) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum (Q490225) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← links)
- A new secret sharing scheme (Q509279) (← links)
- Secret sharing schemes for compartmented access structures (Q520077) (← 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)
- Multi-party computation with conversion of secret sharing (Q664384) (← 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)
- A secure scheme to share secret color images (Q709824) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions (Q845708) (← links)
- A note on secret sharing schemes with three homogeneous access structure (Q845987) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- All inequalities for the relative entropy (Q883003) (← links)
- A multisecret sharing scheme for color images based on cellular automata (Q955248) (← links)
- New schemes for sharing points on an elliptic curve (Q1004845) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- Geometric secret sharing schemes and their duals (Q1321560) (← links)
- A note on dynamic threshold schemes (Q1350356) (← links)
- Anonymous secret sharing schemes (Q1364776) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← 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)
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls (Q1633460) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Constructing ideal secret sharing schemes based on Chinese remainder theorem (Q1710679) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- New secret sharing scheme based on linear code (Q1764386) (← links)
- Secret sharing schemes with three or four minimal qualified subsets (Q1766095) (← 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)
- Shared generation of pseudo-random functions (Q1827581) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- A note on optimal metering schemes. (Q1853163) (← links)
- Some democratic secret sharing schemes (Q1893162) (← links)
- On the information rate of perfect secret sharing schemes (Q1894277) (← 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)
