Ideal uniform multipartite secret sharing schemes
From MaRDI portal
(Redirected from Publication:6192308)
Recommendations
Cites work
- Alternative Protocols for Generalized Oblivious Transfer
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Discrete polymatroids
- Efficient explicit constructions of compartmented secret sharing schemes
- Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
- Evolving homomorphic secret sharing for hierarchical access structures
- General secure multi-party computation from any linear secret-sharing scheme
- Generalized oblivious transfer by secret sharing
- Hierarchical threshold secret sharing
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- How to share a secret
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3912274 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 4123667 (Why is no real title available?)
- Ideal Hierarchical Secret Sharing Schemes
- Ideal multipartite secret sharing schemes
- Multipartite secret sharing by bivariate interpolation
- Natural Generalizations of Threshold Secret Sharing
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
- On the classification of ideal secret sharing schemes
- Secret sharing over infinite domains
- Secret-Sharing Schemes: A Survey
- Theory of codes with maximum rank distance
- Universally ideal secret-sharing schemes
Cited in
(2)
This page was built for publication: Ideal uniform multipartite secret sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192308)