Pages that link to "Item:Q1310452"
From MaRDI portal
The following pages link to On the size of shares for secret sharing schemes (Q1310452):
Displaying 50 items.
- More information theoretical inequalities to be used in secret sharing? (Q287126) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On secret sharing schemes (Q293172) (← links)
- A novel group key transfer for big data security (Q298626) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← 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)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- A note on secret sharing schemes with three homogeneous access structure (Q845987) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← 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)
- Strongly secure ramp secret sharing schemes for general access structures (Q1045894) (← links)
- General information dispersal algorithms (Q1274915) (← 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)
- 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)
- 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)
- 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)
- 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 lower bound on the encoding length in lossy transmission (Q1818962) (← 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)
- On the information rate of perfect secret sharing schemes (Q1894277) (← links)
- The complexity of the graph access structures on six participants (Q1943986) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Quantum strongly secure ramp secret sharing (Q2018190) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← 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)
- 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)
- A general approach to robust web metering (Q2486871) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
