Pages that link to "Item:Q1310452"
From MaRDI portal
The following pages link to On the size of shares for secret sharing schemes (Q1310452):
Displayed 23 items.
- 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)
- Secret sharing schemes with partial broadcast channels (Q851779) (← 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)
- Secret sharing schemes with three or four minimal qualified subsets (Q1766095) (← 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)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- A general approach to robust web metering (Q2486871) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- How to share a secret (Q3050283) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)