Generalised cheater detection and identification

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Cheater detection and identification are important issues in the process of secret reconstruction. To detect and identify cheaters most of the algorithms need the dealer to generate and distribute additional information to shareholders. Recently, algorithms have been proposed to detect and identify cheaters. If more than t (i.e. the threshold) shares, for example j (i.e. t < j) shares in the secret reconstruction, then redundancy of shares can be used to detect and identify cheaters. The detectability and identifiability of cheaters are proportional to the number of redundant shares. However, the number of redundant shares, j ? t is fixed if original shares are used in the secret reconstruction. So, a threshold changeable verifiable secret sharing (TCVSS) has been developed, which allows shareholders working together to change the threshold t into a new threshold t? (i.e. t? < j) and generate new shares; whereas at the same time, maintain the original secret. The verifiability of the proposed TCVSS enables shareholders to verify that their new shares have been properly generated. The number of redundant shares can be changed to j ? t? if new shares are used in the secret reconstruction. Discussion on how to determine the new threshold t? in order to detect and identify cheaters successfully has also been included. © The Institution of Engineering and Technology 2014.

Cite

CITATION STYLE

APA

Harn, L. (2014). Generalised cheater detection and identification. IET Information Security, 8(3), 171–178. https://doi.org/10.1049/iet-ifs.2012.0381

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free