The optimal linear secret sharing scheme for any given access structure

DOI10.1007/S11424-013-2131-4MaRDI QIDQ2440328zbMATH OpenOpenAlexFDO

Authors Shuhong Gao, Chengli Zhang, Chun-Ming Tang

Publication date 18 March 2014

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-013-2131-4

zbMATH Keywords

cryptographylinear codesecret sharingadversary structureaccess structure

Mathematics Subject Classification ID

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

Recommendations

• Secret sharing schemes from binary linear codes
• scientific article; zbMATH DE number 1024000
• Secret sharing schemes from three classes of linear codes
• scientific article; zbMATH DE number 1088900
• scientific article; zbMATH DE number 2040937

Cites work

• scientific article; zbMATH DE number 1023999 (Why is no real title available?)
• scientific article; zbMATH DE number 1057740 (Why is no real title available?)
• scientific article; zbMATH DE number 2040937 (Why is no real title available?)
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
• General secure multi-party computation from any linear secret-sharing scheme
• How to build robust shared control systems
• How to share a secret
• Leakproof secret sharing protocols with applications to group identification scheme
• Minimal vectors in linear codes
• Secret Sharing Schemes from Two-Weight Codes
• Secret sharing schemes with nice access structures
• Secure Computation from Random Error Correcting Codes

Cited in

(14)

• On the composition of secret sharing schemes related to codes
• scientific article; zbMATH DE number 2040937 (Why is no real title available?)
• Finding the maximal adversary structure from any given access structure
• Linear secret-sharing schemes for forbidden graph access structures
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Ideal access structures based on a class of minimal linear codes
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
• Optimal assignment schemes for general access structures based on linear programming
• The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
• Linear secret sharing schemes and rearrangements of access structures
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
• A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
• Optimal binary linear codes from posets of the disjoint union of two chains

This page was built for publication: The optimal linear secret sharing scheme for any given access structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440328)