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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
E. F. Brickell and D.M. Davenport. On the Classification of Ideal Secret Sharing Schemes. J. Cryptology, 4: 123–134, 1991.
E. F. Brickell and D. R. Stinson. Some Improved Bounds on Information Rate of Perfect Sharing Schemes J. Cryptology, 5: 153–166, 1992. 254
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
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
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
F. J. MacWilliams and N. J.A. Sloane. The theory of error-correcting codes. North-Holland, Amsterdam, Seventh Impression 1992. 255, 261
V. C. Pless and W.C. Hu.man, Editors. Handbook of Coding Theory, Elsevier Science B.V., 1998. 255, 261
A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, November 1979. 254, 262
S. Roman. Coding and Information Theory. Springer-Verlag, Berlin, Heidelberg, New York, 1992. 255, 259, 261
M. Tompa and H. Woll. How to share a secret with cheaters. Journal of Cryptology, 1(2):133–138, 1988. 258
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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