Skip to main content
SpringerLink
Log in

Secret Sharing Schemes with Three or Four Minimal Qualified Subsets

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

abstract

In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • G. R. Blakley (1979) ArticleTitleSafeguarding cryptographic keys AFIPS Conf. Proc. 48 313–317

    Google Scholar 

  • C. Blundo A. Santis ParticleDe R. Simone ParticleDe U. Vaccaro (1997) ArticleTitleTight bounds on the information rate of secret sharing schemes Designs, Codes Cryptography 11 107–122

    Google Scholar 

  • C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, On the information rate of secret sharing schemes. Advances in Cryptology CRYPTO’92, Lecture Notes in Comput. Sci. Vol. 740 pp. 148–167.

  • C. Blundo A. Santis ParticleDe D. R. Stinson U. Vaccaro (1995) ArticleTitleGraph decompositions and secret sharing schemes J. Cryptol. 8 39–64

    Google Scholar 

  • E. F. Brickell (1989) ArticleTitleSome ideal secret sharing schemes J. Comb. Math. Comb. Comput. 9 105–113

    Google Scholar 

  • E. F. Brickell D. M. Davenport (1991) ArticleTitleOn the classification of ideal secret sharing schemes J. Cryptol. 4 123–134

    Google Scholar 

  • E. F. Brickell D. R. Stinson (1992) ArticleTitleSome improved bounds on the information rate of perfect secret sharing schemes J. Cryptol. 5 153–166

    Google Scholar 

  • R. M. Capocelli A. Santis ParticleDe L. Gargano U. Vaccaro (1993) ArticleTitleOn the size of shares of secret sharing schemes J. Cryptol. 6 157–168

    Google Scholar 

  • M. Ito A. Saito T. Nishizeki (1987) ArticleTitleSecret sharing scheme realizing any access structure Proc. IEEE Globecom 87 99–102

    Google Scholar 

  • W. A. Jackson K. M. Martin (1994) ArticleTitleGeometric secret sharing schemes and their duals Designs, Codes Cryptograph. 4 83–95

    Google Scholar 

  • W. A. Jackson K. M. Martin (1996) ArticleTitlePerfect secret sharing schemes on five participants Designs, Codes Cryptograph. 9 267–286

    Google Scholar 

  • C. Padró G. Sáez (2000) ArticleTitleSecret sharing schemes with bipartite access structure IEEE Trans. Inform. Theory 46 IssueID7 2596–2604

    Google Scholar 

  • A. Shamir (1979) ArticleTitleHow to share a secret Commun. ACM 22 612–613

    Google Scholar 

  • G. J. Simmons, An introduction to shared secret and/or shared control schemes and their application, Contemporary Cryptology. The Science of Information Integrity, IEEE Press (1991) pp. 441–497.

  • D.R. Stinson (1992) ArticleTitleAn explication of secret sharing schemes Design, Codes Cryptograph. 2 357–390

    Google Scholar 

  • D. R. Stinson (1994) ArticleTitleDecomposition constructions for secret-sharing schemes IEEE Trans. Inform. Theory 40 118–125

    Google Scholar 

  • D. R Stinson (1955) Cryptography: Theory and Practice CRC Press Inc. Boca Raton

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona 1-3, Mòdul C3, Campus Nord, 08034, Barcelona, Spain

    Jaume Martí-Farré

  2. Dept. Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona 1-3, Mòdul C3, Campus Nord, 08034, Barcelona, Spain

    Carles Padró

Authors
  1. Jaume Martí-Farré
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carles Padró
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaume Martí-Farré.

Additional information

Communicated by P. Wild

AMS Classification 94A62

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martí-Farré, J., Padró, C. Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. Des Codes Crypt 34, 17–34 (2005). https://doi.org/10.1007/s10623-003-4192-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-003-4192-1

Keywords

Search

Navigation