Paper 2011/147

The Optimal Linear Secret Sharing Scheme for Any Given Access Structure

Tang Chunming, Gao Shuhong, and Zhang Chengli

Abstract

Any linear code can be used to construct a linear secret sharing scheme. In this paper, it is shown how to decide optimal linear codes (i.e., with the biggest information rate) realizing a given access structure over finite fields. It amounts to solving a system of quadratic equations constructed from the given access structure and the corresponding adversary structure. The system becomes a linear system for binary codes. An algorithm is also given for finding the adversary structure for any given access structure.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
ctang @ gzhu edu cn
History
2011-03-27: received
Short URL
https://ia.cr/2011/147
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/147,
      author = {Tang Chunming and Gao Shuhong and Zhang Chengli},
      title = {The Optimal Linear Secret Sharing Scheme for Any Given Access Structure},
      howpublished = {Cryptology ePrint Archive, Paper 2011/147},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/147}},
      url = {https://eprint.iacr.org/2011/147}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.