Efficient explicit constructions of compartmented secret sharing schemes

DOI10.1007/S10623-019-00657-2MaRDI QIDQ2334444zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

compartmented access structuresgabidulin codesmatroidsmultipartite access structurespolymatroidssecret sharing schemes

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

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

Cites work

• Characterizing Ideal Weighted Threshold Secret Sharing
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Discrete polymatroids
• General secure multi-party computation from any linear secret-sharing scheme
• Hierarchical threshold secret sharing
• How to share a secret
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 5296403 (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
• On 2-level secret sharing
• On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
• On the classification of ideal secret sharing schemes
• On the representability of the biuniform matroid
• Secret sharing over infinite domains
• Secret sharing schemes with bipartite access structure
• Secret-Sharing Schemes: A Survey
• Theory of codes with maximum rank distance
• Three-level secret sharing schemes from the twisted cubic
• Universally ideal secret-sharing schemes

Cited in

(6)

• Efficient explicit constructions of multipartite secret sharing schemes
• Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
• Ideal uniform multipartite secret sharing schemes
• A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
• Efficient representation of lattice path matroids
• Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions

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)