The optimal linear secret sharing scheme for any given access structure
From MaRDI portal
Publication:2440328
DOI10.1007/S11424-013-2131-4zbMATH Open1301.94138OpenAlexW2057324245MaRDI QIDQ2440328FDOQ2440328
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
Recommendations
Cites Work
- How to share a secret
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal vectors in linear codes
- Secure Computation from Random Error Correcting Codes
- General secure multi-party computation from any linear secret-sharing scheme
- How to build robust shared control systems
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Secret Sharing Schemes from Two-Weight Codes
- Leakproof secret sharing protocols with applications to group identification scheme
- Secret sharing schemes with nice access structures
- Title not available (Why is that?)
Cited In (14)
- On the composition of secret sharing schemes related to codes
- Title not available (Why is that?)
- 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
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Linear secret sharing schemes and rearrangements of access structures
- Optimal binary linear codes from posets of the disjoint union of two chains
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
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)
