A note on secret sharing schemes with three homogeneous access structure

https://doi.org/10.1016/j.ipl.2006.08.016Get rights and content

Abstract

A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. This paper deals with these problems for 3-homogeneous access structures, that is, whenever the minimal qualified subsets have exactly three participants.

References (14)

  • C. Blundo et al.

    Tight bounds on the information rate of secret sharing schemes

    Des. Codes Cryptogr.

    (1997)
  • C. Blundo et al.

    On the information rate of secret sharing schemes

  • C. Blundo et al.

    Graph decompositions and secret sharing schemes

    J. Cryptology

    (1995)
  • E.F. Brickell

    Some ideal secret sharing schemes

    J. Combin. Math. Combin. Comput.

    (1989)
  • E.F. Brickell et al.

    On the classification of ideal secret sharing schemes

    J. Cryptology

    (1991)
  • E.F. Brickell et al.

    Some improved bounds on the information rate of perfect secret sharing schemes

    J. Cryptology

    (1992)
  • R.M. Capocelli et al.

    On the size of shares of secret sharing schemes

    J. Cryptology

    (1993)
There are more references available in the full text version of this article.

This work was partially supported by the Spanish Ministerio de Ciencia y Tecnología under project TIC 2003-00866.

View full text