The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures

DOI10.1007/S10255-014-0431-7zbMATH Open1301.94137OpenAlexW2118828116MaRDI QIDQ477568FDOQ477568

Authors: Chun-Ming Tang, Shu-Guang Dai 

Publication date: 9 December 2014

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-014-0431-7

Recommendations

• Linear threshold multisecret sharing schemes
• Linear threshold multisecret sharing schemes
• scientific article; zbMATH DE number 512874
• Linear multi-secret sharing schemes
• Secret sharing and duality

zbMATH Keywords

complexitylinear coderandomnesssecret sharingmulti-secret sharing schemenon-threshold multi-access structure

Mathematics Subject Classification ID

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

Cites Work

• How to share a secret
• Minimal vectors in linear codes
• How to build robust shared control systems
• Title not available (Why is that?)
• The optimal linear secret sharing scheme for any given access structure
• Linear threshold multisecret sharing schemes
• Linear secret sharing schemes and rearrangements of access structures
• Linear multi-secret sharing schemes

Cited In (4)

• Linear multi-secret sharing schemes based on multi-party computation
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• On the Power of Nonlinear Secret-Sharing
• Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming

This page was built for publication: The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures

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