Skip to main content
SpringerLink
Log in

Comments on Harn–Lin’s cheating detection scheme

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

Abstract

Detection of cheating and identification of cheaters in threshold schemes has been well studied, and several solid solutions have been provided in the literature. This paper analyses Harn and Lin’s recent work on cheating detection and identification of cheaters in Shamir’s threshold scheme. We will show that, in a broad area, Harn–Lin’s scheme fails to detect cheating and even if the cheating is detected cannot identify the cheaters. In particular, in a typical Shamir (t, n)-threshold scheme, where n = 2t − 1 and up to t − 1 of participants are corrupted, their scheme neither can detect nor can identify the cheaters. Moreover, for moderate size of groups their proposed cheaters identification scheme is not practical.

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. Benaloh J.: Secret sharing homomorphisms: keeping shares of a secret secret. In: Odlyzko A. (ed.) Advances in Cryptology—Proceedings of CRYPTO’86. Lecture Notes in Computer Science, vol. 263, pp. 251–260. Springer-Verlag, Heidleberg (1987).

  2. Blakley G.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317 (1979).

  3. Cormen T., Leiserson C.E., Rivest R., Stein C.: Introduction to Algorithms, Second edn. MIT Press, USA (2001)

    MATH  Google Scholar 

  4. Harn L., Lin C.: Detection and identification of cheaters in (t, n) secret sharing scheme. In: Designs, Codes and Cryptography, vol. 52, pp. 15–24 (2009).

  5. Rabin T.: Robust sharing of secrets when the dealer is honest or cheating. J. ACM 41(6), 1089–1109 (1994)

    Article  MathSciNet  Google Scholar 

  6. Shamir A.: How to share a secret. Commun. ACM 22, 612–613 (November) (1979).

  7. Tompa M., Woll H.: How to share a secret with cheaters. J. Cryptol. 1(2), 133–138 (1988)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business and Information Technology, James Cook University, Townsville, QLD, 4811, Australia

    Hossein Ghodosi

Authors
  1. Hossein Ghodosi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hossein Ghodosi.

Additional information

Communicated by P. Wild.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghodosi, H. Comments on Harn–Lin’s cheating detection scheme. Des. Codes Cryptogr. 60, 63–66 (2011). https://doi.org/10.1007/s10623-010-9416-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-010-9416-6

Keywords

Mathematics Subject Classification (2000)

Search

Navigation