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

DOI10.1007/S10255-014-0431-7zbMath1301.94137OpenAlexW2118828116MaRDI QIDQ477568

Shu-Guang Dai, Chun-Ming Tang

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

zbMATH Keywords

complexitylinear codesecret sharingrandomnessmulti-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

• Unnamed Item
• Linear secret sharing schemes and rearrangements of access structures
• Linear multi-secret sharing schemes
• How to build robust shared control systems
• The optimal linear secret sharing scheme for any given access structure
• How to share a secret
• Minimal vectors in linear codes
• Linear Threshold Multisecret Sharing Schemes

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