Comments on Harn-Lin's cheating detection scheme
Ghodosi, Hossein (2011) Comments on Harn-Lin's cheating detection scheme. Designs, Codes and Cryptography , 60 (1). pp. 63-66.
PDF (Published Version)
- Published Version
Restricted to Repository staff only
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.
|Item Type:||Article (Refereed Research - C1)|
|Keywords:||threshold secret sharing schemes; cheating detection; cheaters identification|
|Date Deposited:||20 Jun 2011 23:13|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0804 Data Format > 080401 Coding and Information Theory @ 100%|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8903 Information Services > 890399 Information Services not elsewhere classified @ 100%|
|Citation Count from Web of Science||