Skip to main content
Springer Nature Link
Log in

Providing Anonymity in Unconditionally Secure Secret Sharing Schemes

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

Abstract

We discuss the concept of anonymity in an unconditionally secure secret sharing scheme, proposing several types of anonymity and situations in which they might arise. We present a foundational framework and provide a range of general constructions of unconditionally secure secret sharing schemes offering various degrees of anonymity.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. G. R. Blakley, Safeguarding cryptographic keys, In Proceedings of AFIPS 1979 National Computer Conference, Vol. 48 (1979) pp. 313–317.

  2. C. Blundo and D. R. Stinson, Anonymous secret sharing schemes, Discrete Applied Mathematics, Vol. 77 (1997) pp. 13–28.

    Google Scholar 

  3. E. F. Brickell, Some ideal secret sharing schemes, J. Combin. Math. Combin. Comput.,Vol. 9 (1989) pp. 105–113.

    Google Scholar 

  4. E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology, Vol. 5 (1992) pp. 153–166.

    Google Scholar 

  5. M. van Dijk, A linear construction of secret sharing schemes, Des. Codes Cryptogr., Vol. 12 (1997) pp. 161–201.

    Google Scholar 

  6. C. Gehrmann, Topics in Authentication Theory, Ph.D. Thesis, Lund University (1997).

  7. M. Ito, A. Saito and T. Nishizeki, Secret sharing schemes realizing general access structure, J. Cryptology, Vol. 6 (1993) pp. 15–20.

    Google Scholar 

  8. W.-A. Jackson and K. M. Martin, Combinatorial models for perfect secret sharing schemes, J. Combin. Math. Combin. Comput., Vol. 28 (1998) pp. 249–265.

    Google Scholar 

  9. K. M. Martin, Discrete Structures in the Theory of Secret Sharing, Ph.D. Thesis, University of London (1991).

  10. A. Shamir, How to share a secret, Comm. ACM, Vol. 22, No. 11 (1979) pp. 612–613.

    Google Scholar 

  11. G. J. Simmons, How to (really) share a secret, Adv. in Cryptology—CRYPTO' 88, Lecture Notes in Comput. Sci., Vol. 403 (1990) pp. 390–448.

    Google Scholar 

  12. G. J. Simmons, W.-A. Jackson and K. Martin, The geometry of shared secret schemes, Bull. Inst. Combin. Appl., Vol. 1 (1991) pp. 71–88.

    Google Scholar 

  13. D. R. Stinson, An explication of secret sharing schemes, Des. Codes Cryptogr., Vol. 2 (1992) pp. 357–390.

    Google Scholar 

  14. D. R. Stinson and S. A. Vanstone, A combinatorial approach to threshold schemes, SIAM Journal of Discrete Mathematics, Vol. 1 (1988) pp. 230–236.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Technology Institute, Ateneo de Manila University, Rockwell Center, Makati City, Philippines

    Mida Guillermo

  2. Information Security Group, Royal Holloway, University of London, Egham, Surrey, TW20 0EX, U.K.

    Keith M. Martin

  3. Department of Pure Mathematics, The University of Adelaide, SA, 5005, Australia

    Christine M. O'Keefe

Authors
  1. Mida Guillermo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keith M. Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christine M. O'Keefe
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guillermo, M., Martin, K.M. & O'Keefe, C.M. Providing Anonymity in Unconditionally Secure Secret Sharing Schemes. Designs, Codes and Cryptography 28, 227–245 (2003). https://doi.org/10.1023/A:1024198519111

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024198519111

Search

Navigation