An ideal multi-secret sharing scheme based on  minimal privileged coalitions

Yun Song; Zhihui Li

Paper 2012/719

An ideal multi-secret sharing scheme based on minimal privileged coalitions

Yun Song and Zhihui Li

Abstract

How to construct an ideal multi-secret sharing scheme for general access structures is difficult. In this paper, we solve an open problem proposed by Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342], namely to design an algorithm of privileged coalitions of any length if such coalitions exist. Furthermore, in terms of privileged coalitions, we show that most of the existing multi-secret sharing schemes based on Shamir threshold secret sharing are not perfect by analyzing Yang et al.'s scheme and Pang et al.'s scheme. Finally, based on the algorithm mentioned above, we devise an ideal multi-secret sharing scheme for families of access structures, which possesses more vivid authorized sets than that of the threshold scheme.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Published elsewhere. Unknown where it was published
Keywords: secret sharing
Contact author(s): snnulzh @ 25yahoo com cn
History: 2012-12-27: received
Short URL: https://ia.cr/2012/719
License: CC BY

BibTeX

@misc{cryptoeprint:2012/719,
      author = {Yun Song and Zhihui Li},
      title = {An ideal multi-secret sharing scheme based on  minimal privileged coalitions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/719},
      year = {2012},
      url = {https://eprint.iacr.org/2012/719}
}