Efficient explicit constructions of compartmented secret sharing schemes
From MaRDI portal
Publication:2334444
DOI10.1007/S10623-019-00657-2zbMATH Open1423.94125OpenAlexW2950110275WikidataQ127677744 ScholiaQ127677744MaRDI QIDQ2334444FDOQ2334444
Authors: Qi Chen, Zhiqiang Lin, 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
Recommendations
- Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
- Efficient explicit constructions of multipartite secret sharing schemes
- Secret sharing schemes for compartmented access structures
- scientific article; zbMATH DE number 969190
- Decomposition constructions for secret-sharing schemes
- scientific article; zbMATH DE number 1107673
- scientific article; zbMATH DE number 1676641
- scientific article; zbMATH DE number 637269
matroidssecret sharing schemesgabidulin codescompartmented access structurespolymatroidsmultipartite access structures
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- How to share a secret
- Title not available (Why is that?)
- Theory of codes with maximum rank distance
- On the classification of ideal secret sharing schemes
- Secret sharing over infinite domains
- Secret sharing schemes with bipartite access structure
- Secret-Sharing Schemes: A Survey
- General secure multi-party computation from any linear secret-sharing scheme
- Title not available (Why is that?)
- Ideal multipartite secret sharing schemes
- Universally ideal secret-sharing schemes
- On 2-level secret sharing
- Discrete polymatroids
- Three-level secret sharing schemes from the twisted cubic
- Multipartite secret sharing by bivariate interpolation
- Characterizing Ideal Weighted Threshold Secret Sharing
- Title not available (Why is that?)
- Hierarchical threshold secret sharing
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
- On the representability of the biuniform matroid
- Ideal Hierarchical Secret Sharing Schemes
- Natural Generalizations of Threshold Secret Sharing
Cited In (5)
- Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- Ideal uniform multipartite secret sharing schemes
- A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
- Efficient explicit constructions of multipartite secret sharing schemes
This page was built for publication: Efficient explicit constructions of compartmented secret sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334444)
