Efficient explicit constructions of compartmented secret sharing schemes
From MaRDI portal
Publication:2334444
DOI10.1007/s10623-019-00657-2zbMath1423.94125OpenAlexW2950110275WikidataQ127677744 ScholiaQ127677744MaRDI QIDQ2334444
Zhiqiang Lin, Qi Chen, Chun-Ming Tang
Publication date: 7 November 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00657-2
matroidspolymatroidssecret sharing schemesgabidulin codescompartmented access structuresmultipartite access structures
Related Items (2)
Ideal uniform multipartite secret sharing schemes ⋮ A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ideal multipartite secret sharing schemes
- Three-level secret sharing schemes from the twisted cubic
- 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
- On 2-level secret sharing
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Discrete polymatroids
- Secret sharing schemes with bipartite access structure
- On the Representability of the Biuniform Matroid
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Characterizing Ideal Weighted Threshold Secret Sharing
- Universally ideal secret-sharing schemes
- Ideal Hierarchical Secret Sharing Schemes
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
- Natural Generalizations of Threshold Secret Sharing
This page was built for publication: Efficient explicit constructions of compartmented secret sharing schemes
