Skip to main content
SpringerLink
Log in

How to avoid the cheaters succeeding in the key sharing scheme

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

Abstract

In this paper the Rational Interpolation is presented as a solution to the problem caused by a cheater using the Threshold Scheme. We will implement this scheme by using the Berlekamp-Massey algorithm.

The first version we present does not try to detect the cheaters, as in [3], [9] or [10]. This version tries to prevent their knowledge of the correct keyD while the other participants are aware only of the false keyD′ computed in the threshold scheme.

The second version we present is to detect the existence of cheaters.

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. Asmuth, C. and Bloom, J. 1980. A Modular Approach to Key Safeguarding, Math. Dpt., Texas A&M University, College Station, Texas.

    Google Scholar 

  2. Blakely, G.R. 1979. Safeguarding cryptographic keys, NCC 79, AFIPS, 313–317.

  3. Brickell, E.F. and Stinson, D.R. The detection of cheaters in threshold schemes,LNCS. 403, CRYTO'88, Berlin, New York: Springer-Verlag, pp. 564–577.

  4. Davida, G.I., Demilo, R.A. and Lipton, R.J. 1980. Protecting shared cryptographic keys. Proc. 1980 Symp. on Security and Privacy,IEEE Computers Society. 100–102.

  5. McEliece, R.J. and Sarwate, D.V. 1981. On sharing secrets and reed-solomon codes.Comm. of the ACM. 24:583–584.

    Google Scholar 

  6. McEliece, R.J., 1977.The Theory of Information and Coding, Reading, MA: Addison-Wesley.

    Google Scholar 

  7. MacWilliams, F.J. and Sloane, N.J.A. 1983.The Theory of Error Correcting and Codes, North-Holland, Amsterdam, N.Y., Oxford.

    Google Scholar 

  8. Shamir, A. 1979. How to share a secret, comm.ACM, 122:612.

    Google Scholar 

  9. Simmons, G. 1988. An introduction to Shared Secret Schemes and their Applications, Sandia Reports, SAND 88–2298.

  10. Tompa, M. and Woll, H. 1988. How to share a secret with cheaters.J. of Cryptology I. 133–138.

Download references

Author information

Authors and Affiliations

  1. Department d'Informatica, Universitat Autònoma de Barcelona, 08193, Bellaterra, Spain

    Josep Rifa-Coma

Authors
  1. Josep Rifa-Coma
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by D. Jungnickel

This work was partially supported by Spanish CICYT Grant TIC91-0472.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rifa-Coma, J. How to avoid the cheaters succeeding in the key sharing scheme. Des Codes Crypt 3, 221–228 (1993). https://doi.org/10.1007/BF01388483

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01388483

Keywords

Search

Navigation