Ideal uniform multipartite secret sharing schemes
From MaRDI portal
Publication:6192308
DOI10.1016/j.ins.2023.119907MaRDI QIDQ6192308
No author found.
Publication date: 12 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Linear codes (general theory) (94B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ideal multipartite secret sharing schemes
- Generalized oblivious transfer by secret sharing
- Hierarchical threshold secret sharing
- Multipartite secret sharing by bivariate interpolation
- Theory of codes with maximum rank distance
- On the classification of ideal secret sharing schemes
- Secret sharing over infinite domains
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Discrete polymatroids
- Evolving homomorphic secret sharing for hierarchical access structures
- Efficient explicit constructions of compartmented secret sharing schemes
- Secret-Sharing Schemes: A Survey
- How to share a secret
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Universally ideal secret-sharing schemes
- Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
- Ideal Hierarchical Secret Sharing Schemes
- Alternative Protocols for Generalized Oblivious Transfer
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
- Natural Generalizations of Threshold Secret Sharing
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
This page was built for publication: Ideal uniform multipartite secret sharing schemes
