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

Abstract

In a (t, n) secret sharing scheme, a secret s is divided into n shares and shared among a set of n shareholders by a mutually trusted dealer in such a way that any t or more than t shares will be able to reconstruct this secret; but fewer than t shares cannot know any information about the secret. When shareholders present their shares in the secret reconstruction phase, dishonest shareholder(s) (i.e. cheater(s)) can always exclusively derive the secret by presenting faked share(s) and thus the other honest shareholders get nothing but a faked secret. Cheater detection and identification are very important to achieve fair reconstruction of a secret. In this paper, we consider the situation that there are more than t shareholders participated in the secret reconstruction. Since there are more than t shares (i.e. it only requires t shares) for reconstructing the secret, the redundant shares can be used for cheater detection and identification. Our proposed scheme uses the shares generated by the dealer to reconstruct the secret and, at the same time, to detect and identify cheaters. We have included discussion on three attacks of cheaters and bounds of detectability and identifiability of our proposed scheme under these three attacks. Our proposed scheme is an extension of Shamir's secret sharing scheme. Communicated by P. Wild.

BVPSMS: A Batch Verification Protocol for End-to-End Secure SMS for Mobile Users

“…Now, we assume that j (n ≥ j ≥ t) number of participants are involved in a secret reconstruction out of n. Then, we have j −t legitimate shares in a secret reconstruction. When j − t > t (j ≥ t + 1), there are j−t t cases that will construct the legitimate secret [65]. This attack of not being able to reconstruct the secret succeeds only when j − t < t.…”

Analyzing Extended Secret Sharing Schemes based on Share Size

“…There are some schemes which support this feature. Harn and Lin [15] proposed cheater identification method for Shamir's scheme. Zhao et al [16] proposed new lossless secret sharing scheme to identify cheaters in image secret sharing.…”

(k,n) secret image sharing scheme capable of cheating detection

“…Many works have focused on solving the cheating problem in secret sharing schemes. Some [10][11][12] were interested in detecting the cheating behavior, and some works [13][14][15] focused on not only detecting the cheating behavior, but also identifying the cheaters. The cheating identifiable schemes have stronger capability to resist cheating; it results that the shares are larger and the schemes are more complicated than those cheating detectable schemes.…”