Skip to main content
SpringerLink
Log in

Sharing Multiple Secrets: Models, Schemes and Analysis

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

Abstract

A multi-secret sharing scheme is a protocol to share more than one secret among a set of participants, where each secret may have a distinct family of subsets of participants (also called ‘access structure’) that are qualified to recover it. In this paper we use an information-theoretic approach to analyze two different models for multi-secret sharing schemes. The proposed models generalize specific models which have already been considered in the literature. We first analyze the relationships between the security properties of the two models. Afterwards, we show that the security property of a multi-secret sharing scheme does not depend on the particular probability distribution on the sets of secrets. This extends the analogous result for the case of single-secret sharing schemes and implies that the bounds on the size of the information distributed to participants in multi-secret sharing schemes can all be strengthened. For each of the two models considered in this paper, we show lower bounds on the size of the shares distributed to participants. Specifically, for the general case in which the secrets are shared according to a tuple of arbitrary (and possibly different) access structures, we show a combinatorial condition on these structures that is sufficient to require a participant to hold information of size larger than a certain subset of secrets. For specific access structures of particular interest, namely, when all access structures are threshold structures, we show tight bounds on the size of the information distributed to participants.

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

  1. J. C. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, In Advances in Cryptology—CRYPTO ’88, Lecture Notes in Computer Science, Vol. 403, Springer-Verlag, Berlin (1990) pp. 27–35.

  2. G. R. Blaley, Safeguarding cryptographic keys, Proceedings AFIPS 1979 National Computer Conference, (June 1979) pp. 313–317.

  3. C. Blundo A. Santis ParticleDe R. Simone ParticleDe U. Vaccaro (1997) ArticleTitleTight bounds on the information rate of secret sharing schemes Design, Codes and Cryptography 11 IssueID2 235–259

    Google Scholar 

  4. C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia and U. Vaccaro, Multi-secret sharing schemes, In Advances in Cryptology—CRYPTO ’94, Lecture Notes in Computer Science, Vol. 839, Springer-Verlag, Berlin (1994) pp. 150–163.

  5. C. Blundo A. Santis ParticleDe L. Gargano U. Vaccaro (1996) ArticleTitleOn the information rate of secret sharing schemes Theoretical Computer Science 154 283–306 Occurrence Handle10.1016/0304-3975(95)00065-8 Occurrence Handle97g:94019

    Article  MathSciNet  Google Scholar 

  6. C. Blundo A. Santis ParticleDe A. Giorgio Gaggia U. Vaccaro (1995) ArticleTitleNew bounds on the information rate of secret sharing schemes IEEE Transactions on Information Theory 41 549–554 Occurrence Handle10.1109/18.370169

    Article  Google Scholar 

  7. C. Blundo A. Santis ParticleDe A. Herzberg S. Kutten U. Vaccaro M. Yung (1998) ArticleTitlePerfectly-secure key distribution for dynamic conference Information and Computation 146 IssueID1 1–23 Occurrence Handle10.1006/inco.1998.2717 Occurrence Handle99j:94039

    Article  MathSciNet  Google Scholar 

  8. C. Blundo A. Santis ParticleDe D. R. Stinson U. Vaccaro (1995) ArticleTitleGraph decomposition and secret sharing schemes Journal of Cryptology 8 39–64 Occurrence Handle10.1007/BF00204801

    Article  Google Scholar 

  9. C. Blundo, A. De Santis and U. Vaccaro, Efficient sharing of many secrets, In Proceedings of STACS ’93 (10th Symp. on Theoretical Aspects of Computer Science), Lecture Notes in Computer Science, Vol. 665, Springer-Verlag, Berlin (1993) pp. 692–703.

  10. C. Blundo A. Santis ParticleDe U. Vaccaro (1998) ArticleTitleOn secret sharing schemes Information Processing Letters 65 IssueID1 25–32 Occurrence Handle10.1016/S0020-0190(97)00194-4 Occurrence Handle99e:94031

    Article  MathSciNet  Google Scholar 

  11. E. F. Brickell D. R. Stinson (1992) ArticleTitleImproved bounds on the information rate of perfect secret sharing schemes Journal of Cryptology 5 IssueID3 153–166 Occurrence Handle93j:94021

    MathSciNet  Google Scholar 

  12. R. M. Capocelli A. Santis ParticleDe L. Gargano U. Vaccaro (1993) ArticleTitleOn the size of shares for secret sharing schemes Journal of Cryptology 6 57–167 Occurrence Handle10.1007/BF00198463

    Article  Google Scholar 

  13. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons (1991).

  14. L. Csirmaz (1997) ArticleTitleThe size of a share must be large Journal of Cryptology 10 IssueID4 223–231 Occurrence Handle10.1007/s001459900029 Occurrence Handle0897.94012 Occurrence Handle98k:94008

    Article  MATH  MathSciNet  Google Scholar 

  15. A. Santis ParticleDe B. Masucci (1999) ArticleTitleMultiple ramp schemes IEEE Transactions on Information Theory 45 IssueID5 1720–1728

    Google Scholar 

  16. M. Dijk Particlevan (1995) ArticleTitleOn the information rate of perfect secret sharing schemes Design, Codes, and Cryptography 6 143–169 Occurrence Handle0829.94006

    MATH  Google Scholar 

  17. M. Franklin and M. Yung, Communication complexity of secure computation, Proceedings of 24th Annual ACM Symposium on Theory of Computing, (1992) pp. 699–710.

  18. R. L. Graham D. E. Knuth O. Patashnik (1988) Concrete Mathematics. A Foundation for Computer Science Addison Wesley Reading, MA, USA

    Google Scholar 

  19. M. Ito, A. Saito and T. Nishizeki, Secret sharing scheme realizing general access structure, Proceedings of IEEE Global Telecommunications Conference— GLOBECOM 87, Tokyo, Japan, (1987) pp. 99–102.

  20. M. Ito A. Saito T. Nishizeki (1993) ArticleTitleMultiple assignment scheme for sharing secret Journal of Cryptology 6 15–20 Occurrence Handle94b:94018

    MathSciNet  Google Scholar 

  21. W.-A. Jackson, K. M. Martin and C. M. O’Keefe, Multisecret threshold schemes, In Advances in Cryptology—CRYPTO ’93, Lecture Notes in Computer Science, Vol. 773, Springer-Verlag, Berlin (1994) pp. 126–135.

  22. W.-A. Jackson, K. M. Martin and C. M. O’Keefe, On sharing many secrets, In Advances in Cryptology—ASIACRYPT ’94, Lecture Notes in Computer Science , Vol. 917, Springer-Verlag, Berlin, (1995) pp. 42–54.

  23. W.-A. Jackson, K. M. Martin and C. M. O’Keefe, A construction for multisecret threshold schemes, Design, Codes and Cryptography, Vol. 9, No. 3 (November 1996) pp. 287–303.

  24. W.-A. Jackson K. M. Martin C. M. O’Keefe (1996) ArticleTitleIdeal secret sharing schemes with multiple secrets Journal of Cryptology 9 233–250 Occurrence Handle98e:94019

    MathSciNet  Google Scholar 

  25. E. D. Karnin J. W. Greene M. E. Hellman (1983) ArticleTitleOn secret sharing systems IEEE Transactions on Information Theory 29 IssueID1 35–41 Occurrence Handle84i:94044

    MathSciNet  Google Scholar 

  26. A. Shamir. How to share a secret, Communications of the ACM, Vol. 22, No. 11 (November 1979) pp. 612–613.

  27. G.J. Simmons (1991) An introduction to shared secret and/or shared control schemes and their applications. Contemporary Cryptology IEEE Press New York 441–497

    Google Scholar 

  28. D. R. Stinson (1992) ArticleTitleAn explication of secret sharing schemes Design, Codes, and Cryptography 2 357–390 Occurrence Handle0793.68111 Occurrence Handle93m:94021

    MATH  MathSciNet  Google Scholar 

  29. D. R. Stinson (1994) ArticleTitleDecomposition constructions for secret sharing schemes IEEE Transactions on Information Theory 40 118–125 Occurrence Handle10.1109/18.272461 Occurrence Handle0803.94017 Occurrence Handle95e:94047

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica ed Applicazioni, Universitá di Salerno, 84081, Baronissi, (SA), Italy

    Barbara Masucci

Authors
  1. Barbara Masucci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Barbara Masucci.

Additional information

Communicated by: P. Wild

Rights and permissions

Reprints and permissions

About this article

Cite this article

Masucci, B. Sharing Multiple Secrets: Models, Schemes and Analysis. Des Codes Crypt 39, 89–111 (2006). https://doi.org/10.1007/s10623-005-2761-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-2761-1

Keywords

AMS Classification

Search

Navigation