Comments on Harn---Lin's cheating detection scheme

Authors:
Hossein Ghodosi
Affiliations:
School of Business and Information Technology, James Cook University, Townsville, Australia 4811
Venue:
Designs, Codes and Cryptography
Year:
2011

Citing 6
Cited 0

Secret sharing homomorphisms: keeping shares of a secret secret

Proceedings on Advances in cryptology---CRYPTO '86
How to share a secret with cheaters

Journal of Cryptology
Robust sharing of secrets when the dealer is honest or cheating

Journal of the ACM (JACM)
How to share a secret

Communications of the ACM
Introduction to Algorithms

Introduction to Algorithms
Detection and identification of cheaters in (t, n) secret sharing scheme

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.