Skip to main content
SpringerLink
Log in

Ideal Threshold Schemes from MDS Codes

  • Conference paper
  • First Online:
Information Security and Cryptology — ICISC 2002 (ICISC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2587))

Included in the following conference series:

Abstract

We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the correct secret. The construction is later generalised so the resulting secret sharing is resistant against the Tompa-Woll cheating.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.R. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 National Computer Conference, pages 313–317. AFIPS, 1979. 254 E. F. Brickell and D.R. Stinson.

    Google Scholar 

  2. E. F. Brickell and D.M. Davenport. On the Classification of Ideal Secret Sharing Schemes. J. Cryptology, 4: 123–134, 1991.

    MATH  Google Scholar 

  3. E. F. Brickell and D. R. Stinson. Some Improved Bounds on Information Rate of Perfect Sharing Schemes J. Cryptology, 5: 153–166, 1992. 254

    MATH  MathSciNet  Google Scholar 

  4. M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. In Proceedings IEEE Globecom’ 87, pages 99–102. IEEE, 1987. 254

    Google Scholar 

  5. E.D. Karnin, J. W. Greene, and M.E. Hellman. On secret sharing systems. IEEE Transactions on Information Theory, IT-29:35–41, 1983. 262

    Article  MATH  MathSciNet  Google Scholar 

  6. R. J. McEliece and D.V. Sarwate. On Sharing Secrets and Reed-Solomon Codes. Communications of the ACM, Vol. 24, 1981, pp 583–584. 262

    Article  MathSciNet  Google Scholar 

  7. F. J. MacWilliams and N. J.A. Sloane. The theory of error-correcting codes. North-Holland, Amsterdam, Seventh Impression 1992. 255, 261

    Google Scholar 

  8. V. C. Pless and W.C. Hu.man, Editors. Handbook of Coding Theory, Elsevier Science B.V., 1998. 255, 261

    Google Scholar 

  9. A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, November 1979. 254, 262

    Google Scholar 

  10. S. Roman. Coding and Information Theory. Springer-Verlag, Berlin, Heidelberg, New York, 1992. 255, 259, 261

    Google Scholar 

  11. M. Tompa and H. Woll. How to share a secret with cheaters. Journal of Cryptology, 1(2):133–138, 1988. 258

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Advanced Computing - Algorithms and Cryptography Department of Computing, Macquarie University, 2109, Sydney, NSW, Australia

    Josef Pieprzyk & Xian-Mo Zhang

Authors
  1. Josef Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xian-Mo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Pohnag University of Science and Technology, San 31, Hyoja-dong, Nam-gu, Pohang, 790-784, Kyungbuk, Korea

    Pil Joong Lee

  2. Sejong University, 98, Gunja-dong, Gwangjin-gu, 143-747, Seoul, Korea

    Chae Hoon Lim

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pieprzyk, J., Zhang, XM. (2003). Ideal Threshold Schemes from MDS Codes. In: Lee, P.J., Lim, C.H. (eds) Information Security and Cryptology — ICISC 2002. ICISC 2002. Lecture Notes in Computer Science, vol 2587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36552-4_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-36552-4_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00716-6

  • Online ISBN: 978-3-540-36552-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation