The optimal linear multi-secret sharing scheme for non-threshold access structure(student contribution)

Authors:
Shu-guang Dai;Chun-ming Tang;Yue-nai Chen
Affiliations:
Guangzhou University, Guangzhou, China;Guangzhou University & Chinese Academy of Science, Guangzhou & Beijing, China;Guangzhou University, Guangzhou, China
Venue:
Proceedings of the 4th international conference on Security of information and networks
Year:
2011

Citing 7
Cited 0

How to Build Robust Shared Control Systems

Designs, Codes and Cryptography
On sharing secrets and Reed-Solomon codes

Communications of the ACM
How to share a secret

Communications of the ACM
The access structure of some secret-sharing schemes

ACISP '96 Proceedings of the First Australasian Conference on Information Security and Privacy
Multi-Secret Sharing Schemes

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Secret sharing schemes from linear codes

Secret sharing schemes from linear codes
Minimal vectors in linear codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A linear code is optimal if the length of code is the shortest among all linear codes which realize the given access structure. It is a difficult problem how to obtain the optimal linear code for any access structure. In this paper, we firstly construct the optimal linear codes for realizing any given non-threshold multi-access structures over finite field Fq. Then, based on our optimal linear code, we construct the optimal linear multi-secret sharing scheme for any non-threshold multi-access structure.