Pages that link to "Item:Q2705984"
From MaRDI portal
The following pages link to Secret sharing schemes with bipartite access structure (Q2705984):
Displayed 33 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Ideal multipartite secret sharing schemes (Q434350) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← links)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- Three-level secret sharing schemes from the twisted cubic (Q712244) (← 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)
- Extensions of access structures and their cryptographic applications (Q989607) (← links)
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166) (← links)
- Multipartite secret sharing by bivariate interpolation (Q1015357) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← 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)
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. (Q1853095) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Efficient explicit constructions of compartmented secret sharing schemes (Q2334444) (← links)
- A rational threshold signature model and protocol based on different permissions (Q2336193) (← links)
- Secret sharing schemes on access structures with intersection number equal to one (Q2489950) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Ideal hierarchical secret sharing and lattice path matroids (Q2697480) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures (Q3005583) (← links)
- How to share a secret (Q3050283) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- Ideal Hierarchical Secret Sharing Schemes (Q3408196) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (Q4958087) (← links)
- Approximation and decomposition in lattices of clutters (Q6041563) (← links)
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures (Q6104673) (← links)
- Bipartite secret sharing and staircases (Q6124455) (← links)
- A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations (Q6199502) (← links)