Paper 2013/189

Ideal and Perfect Hierarchical Secret Sharing Schemes based on MDS codes

Appala Naidu Tentu, Prabal Paul, and V Ch Venkaiah

Abstract

An ideal conjunctive hierarchical secret sharing scheme, constructed based on the Maximum Distance Separable (MDS) codes, is proposed in this paper. The scheme, what we call, is computationally perfect. By computationally perfect, we mean, an authorized set can always reconstruct the secret in polynomial time whereas for an unauthorized set this is computationally hard. Also, in our scheme, the size of the ground field is independent of the parameters of the access structure. Further, it is efficient and requires $O(n^3)$, where $n$ is the number of participants. Keywords: Computationally perfect, Ideal, Secret sharing scheme, Conjunctive hierarchical access structure, Disjunctive hierarchical access structure, MDS code.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
secret sharing
Contact author(s)
naidunit @ gmail com
History
2013-04-02: received
Short URL
https://ia.cr/2013/189
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/189,
      author = {Appala Naidu Tentu and Prabal Paul and V Ch Venkaiah},
      title = {Ideal and Perfect Hierarchical Secret Sharing Schemes based on MDS codes},
      howpublished = {Cryptology ePrint Archive, Paper 2013/189},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/189}},
      url = {https://eprint.iacr.org/2013/189}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.