Analysis of an Image Secret Sharing Scheme to Identify Cheaters
نویسندگان
چکیده
Secret image sharing mechanisms have been widely applied to the military, ecommerce, and communications fields. Zhao et al. introduced the concept of cheater detection into image sharing schemes recently. This functionality enables the image owner and authorized members to identify the cheater in reconstructing the secret image. Here, we provide an analysis of Zhao et al.’s method: an authorized participant is able to restore the secret image by him/herself. This contradicts the requirement of secret image sharing schemes. The authorized participant utilizes an exhaustive search to achieve the attempt, though, simulation results show that it can be done within a reasonable time period.
منابع مشابه
On the feasibility and security of image secret sharing scheme to identify cheaters
Zhao et al. [A new image secret sharing scheme to identify cheaters, Computer Standards & Interfaces, vol.31, no.1, pp.252− 257, 2009] proposed a (t, n) threshold image secret sharing scheme to identify cheaters. The scheme is based on ThienLin scheme and the intractability of discrete logarithm. It allows honest participants to identify cheaters, and each participant only needs to save her/his...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملMDS secret-sharing scheme secure against cheaters
For the problem of cheaters in secret sharing schemes, we introduce d cheat which is more appropriate than the minimum Hamming distance d min of the related error correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identify the cheaters in the scheme). We then prove that d min d cheat = n ? max B6 2? jBj; where ? denotes the access structure.
متن کاملA (t, n) Threshold Secret Sharing System with Efficient Identification of Cheaters
In this paper, we propose a new (t, n) threshold scheme. The scheme allows a user to divide portions of a secret among the designated group. Any t or more participants from a designated group of n members can cooperate to reconstruct the secret while (t−1) or less participants can not. Furthermore, the scheme provides an efficient mechanism to detect and identify cheaters. From the security ana...
متن کاملAlmost Optimum t-Cheater Identifiable Secret Sharing Schemes
In Crypto’95, Kurosawa, Obana and Ogata proposed a kout-of-n secret sharing scheme capable of identifying up to t cheaters with probability 1 − under the condition t ≤ (k − 1)/3 . The size of share |Vi| of the scheme satisfies |Vi| = |S|/ , which was the most efficient scheme known so far. In this paper, we propose new k-out-ofn secret sharing schemes capable of identifying cheaters. The propos...
متن کامل