Pages that link to "Item:Q3596383"
From MaRDI portal
The following pages link to On Secret Sharing Schemes, Matroids and Polymatroids (Q3596383):
Displaying 22 items.
- On secret set schemes (Q294774) (← links)
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid (Q533769) (← links)
- On-line secret sharing (Q664393) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← 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)
- On the diameter of matroid ports (Q1010684) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- The free product of M-fuzzifying matroids1 (Q2988582) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- A note on duality in linear secret sharing schemes (Q3126447) (← links)
- Ideal Hierarchical Secret Sharing Schemes (Q3408196) (← links)
- (Q4441208) (← links)
- (Q5171139) (← links)
- (Q5442167) (← links)
- Matroids Can Be Far from Ideal Secret Sharing (Q5445507) (← links)
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes (Q5451034) (← links)
- Theory of Cryptography (Q5898370) (← links)
- (Q6059372) (← links)