Ideal Multipartite Secret Sharing Schemes
From MaRDI portal
Recommendations
Cited in
(21)- Efficient explicit constructions of multipartite secret sharing schemes
- Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
- Natural generalizations of threshold secret sharing
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Three-level secret sharing schemes from the twisted cubic
- A novel group key transfer for big data security
- Ideal multipartite secret sharing schemes
- On the classification of ideal secret sharing schemes
- Multipartite secret sharing by bivariate interpolation
- Strongly ideal secret sharing schemes
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- An impossibility result on graph secret sharing
- Ideal uniform multipartite secret sharing schemes
- scientific article; zbMATH DE number 4195886 (Why is no real title available?)
- A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
- Ideal secret sharing schemes with multiple secrets
- Ideal hierarchical secret sharing schemes
- New method to compute bounds on the optimal information rate of secret sharing schemes
- Ideal secret sharing schemes for useful multipartite access structures
- A new polynomial for polymatroids
- Multipartite Secret Sharing by Bivariate Interpolation
This page was built for publication: Ideal Multipartite Secret Sharing Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429406)