A Survey on Cheating Prevention with Verifiable Scheme
نویسندگان
چکیده
Visual Cryptographic technique has become an important field of study in modern cryptography. Visual cryptography (VC) has quite a few applications and some of them are authentication and identification, steganography, and image encryption. As the era demands the need of security and Visual Secret Sharing to resist cheating scenario is a Visual Cryptographic technique. VSS is simple as it is easily detectable by human visual system. A secret image sharing scheme is used for identifying the existence of cheater. The use of verifiable scheme leads helps find the presence of a cheater. The problem of cheating prevention exists and researchers have proposed scheme like Cheating-prevention visual secret-sharing (CPVSS) schemes. This paper is based on the study of the cheating prevention happening in Visual Cryptography.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملSurvey of Cheating Prevention Techniques in Visual Cryptography
Visual cryptography (VC) is a technique of encoding a secret image into share images such that stacking a sufficient number of shares reveals the original secret image. Shares are generally presented in transparencies. So each participant holds a transparency. The original secret image is recovered after superimposing the transparencies one to other. Basically, the performance of visual cryptog...
متن کاملUnconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures
Verifiable secret sharing schemes (VSS) are secret sharing schemes dealing with possible cheating by the participants. In this paper, we propose a new unconditionally secure VSS. Then we construct a new proactive secret sharing scheme based on that VSS. In a proactive scheme, the shares are periodically renewed so that an adversary cannot get any information about the secret unless he is able t...
متن کاملAn improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme
Lin and Wu [IEE Proc. Comput. Digit. Tech. 146 (1999) 264] have proposed an efficient ðt; nÞ threshold verifiable multi-secret sharing (VMSS) scheme based on the factorization problem and the discrete logarithm modulo a large composite problem. In their scheme, the dealer can arbitrarily give any set of multiple secrets to be shared, and only one reusable secret shadow is to be kept by every pa...
متن کامل