Showing papers by "Wenjiang Ji published in 2017"
01 Oct 2017
TL;DR: This paper considers a situation that there are k -–2 or less cheaters in secret reconstruction, and proposes a (k, n) secret sharing scheme secure against such cheating, which is efficient respect to the size of shares and secure regardless of the probability distribution of the secret.
Abstract: In 1989, Tompa and Woll first introduced a cheating problem in Shamir's (k, n) secret sharing scheme, such that malicious shareholders (cheaters) aim to cheat honest shareholders by pooling forged shares during secret reconstruction. They succeed if honest shareholders accept a forged secret. In this cheating, even a single cheater can deceive other k – 1 honest shareholders with high probability. In this paper, we consider a situation that there are k -–2 or less cheaters in secret reconstruction, and propose a (k, n) secret sharing scheme secure against such cheating. Our scheme is efficient respect to the size of shares. Furthermore, our scheme is secure regardless of the probability distribution of the secret.
3 citations