On the feasibility and security of image secret sharing scheme to identify cheaters
Qian Kong, Peng Li, Yanpeng Ma · J. Inf. Hiding Multim. Signal Process. · 2013
Zhao et al. (A new image secret sharing scheme to identify cheaters, Com- puter Standards & Interfaces, vol.31, no.1, pp.252 − 257, 2009) proposed a (t, n) thresh- old image secret sharing scheme to identify cheaters. The scheme is based on Thien- Lin scheme and the intractability of discrete logarithm. It allows honest participants to identify cheaters, and each participant only needs to save her/his own secret shadow. Unfortunately, their scheme has a serious feasibility problem, and is insecure for image sharing. In this paper, the feasibility and security of the scheme are analyzed. It is proved that the scheme may be infeasible with probability 1 − 251!=(251 n (251 − n)!). This prob- ability increases with larger value of n, and reaches 96:26% when n is equal to 40. We also prove that the scheme is easy to crack when it is suffered from a brute force attack, especially when t is a small integer. The main weaknesses of feasibility and security are proved and shown by theoretical analysis and some experiments.