The visual secret sharing scheme proposed by Naor and Shamir provides a way to encrypt a secret black-white image into shares. A qualified group of participants can recover the secret message without using any cryptog...The visual secret sharing scheme proposed by Naor and Shamir provides a way to encrypt a secret black-white image into shares. A qualified group of participants can recover the secret message without using any cryptographic computation. But the original scheme can easily be corrupted by malicious participant. We propose an extension of VSS(visual secret sharing) to identify cheaters before the secret is recovered. Without the need for any additional information and cryptographic computation, every participant can verify the validity of shares of other participants, thus the security of VSS is enhanced.展开更多
Visual cryptographic scheme is specially designed for secret image sharing in the form of shadow images.The basic idea of visual cryptography is to construct two or more secret shares from the original image in the fo...Visual cryptographic scheme is specially designed for secret image sharing in the form of shadow images.The basic idea of visual cryptography is to construct two or more secret shares from the original image in the form of chaotic image.In this paper,a novel secret image communication scheme based on visual cryptography and Tetrolet tiling patterns is proposed.The proposed image communication scheme will break the secret image into more shadow images based on the Tetrolet tiling patterns.The secret image is divided into 4×4 blocks of tetrominoes and employs the concept of visual cryptography to hide the secret image.The main feature of the proposed scheme is the selection of random blocks to apply the tetrolet tilling patterns from the fundamental tetrolet pattern board.Single procedure is used to perform both tetrolet transform and the scheme of visual cryptography.Finally,the experimental results showcase the proposed scheme is an extraordinary approach to transfer the secret image and reconstruct the secret image with high visual quality in the receiver end.展开更多
Visual cryptography scheme （VCS） is a secure method that encrypts a secret image by subdividing it into shadow images. Due to the nature of encryption VCS is categorized into two types： the deterministic VCS （DVCS...Visual cryptography scheme （VCS） is a secure method that encrypts a secret image by subdividing it into shadow images. Due to the nature of encryption VCS is categorized into two types： the deterministic VCS （DVCS） and the probabilistie VCS （PVCS）. For the DVCS, we use m （known as the pixel expansion） subpixels to represent a secret pixel. The PVCS uses only one subpixel to represent a secret pixel, while the quality of reconstructed image is degraded. A well-known construction of （k, n）-PVCS is obtained from the （k, n）-DVCS. In this paper, we show another construction of （k, n）-PVCS by extending the （k, k）-PVCS.展开更多
Visual cryptography(VC) is an encryption technique for hiding a secret image in distributed and shared images(referred to as shares). VC schemes are employed to encrypt multiple images as meaningless,noisy patterns or...Visual cryptography(VC) is an encryption technique for hiding a secret image in distributed and shared images(referred to as shares). VC schemes are employed to encrypt multiple images as meaningless,noisy patterns or meaningful images. However,decrypting multiple secret images using a unique share is difficult with traditional VC. We propose an approach to hide multiple images in meaningful shares. We can decrypt multiple images simultaneously using a common share, which we refer to as a magic sheet. The magic sheet decrypts multiple secret images depending on a given share. The shares are printed on transparencies, and decryption is performed by physically superimposing the transparencies. We evaluate the proposed method using binary, grayscale,and color images.展开更多
Differently from pure data encryption,secret image sharing(SIS)mainly focuses on image protection through generating a secret image into n shadow images(shares)distributed to n associated participants.The secret image...Differently from pure data encryption,secret image sharing(SIS)mainly focuses on image protection through generating a secret image into n shadow images(shares)distributed to n associated participants.The secret image can be reconstructed by collecting sufficient shadow images.In recent years,many SIS schemes are proposed,among which Shamir’s polynomial-based SIS scheme and visual secret sharing(VSS)also called visual cryptography scheme(VCS)are the primary branches.However,as the basic research issues,the security analysis and security level classification of SIS are rarely discussed.In this paper,based on the study of image feature and typical SIS schemes,four security levels are classified as well as the security of typical SIS schemes are analyzed.Furthermore,experiments are conducted to evaluate the efficiency of our analysis by employing illustrations and evaluation metrics.展开更多
Visual secret sharing(VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing(VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in ...Visual secret sharing(VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing(VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS. In VMSS, secrets are encoded into noise-like shares which have finally been stacked altogether so as to disclose each of the secrets by specific operations, such as rotating, flipping and sliding. Though the noise-like shares can be decoded by those operations, it is just like a fly in the ointment since they are hard to manage, to recognize and even to stack orderly. Based on some researches about user-friendly VSS for generating meaningful shares, a new friendly VMSS scheme is presented in this paper for achieving two main goals. One is trying to encode multiple secrets at a time and the other is making the decoding process easy to manage. The experimental results prove that our proposed scheme does work.展开更多
文摘The visual secret sharing scheme proposed by Naor and Shamir provides a way to encrypt a secret black-white image into shares. A qualified group of participants can recover the secret message without using any cryptographic computation. But the original scheme can easily be corrupted by malicious participant. We propose an extension of VSS(visual secret sharing) to identify cheaters before the secret is recovered. Without the need for any additional information and cryptographic computation, every participant can verify the validity of shares of other participants, thus the security of VSS is enhanced.
文摘Visual cryptographic scheme is specially designed for secret image sharing in the form of shadow images.The basic idea of visual cryptography is to construct two or more secret shares from the original image in the form of chaotic image.In this paper,a novel secret image communication scheme based on visual cryptography and Tetrolet tiling patterns is proposed.The proposed image communication scheme will break the secret image into more shadow images based on the Tetrolet tiling patterns.The secret image is divided into 4×4 blocks of tetrominoes and employs the concept of visual cryptography to hide the secret image.The main feature of the proposed scheme is the selection of random blocks to apply the tetrolet tilling patterns from the fundamental tetrolet pattern board.Single procedure is used to perform both tetrolet transform and the scheme of visual cryptography.Finally,the experimental results showcase the proposed scheme is an extraordinary approach to transfer the secret image and reconstruct the secret image with high visual quality in the receiver end.
基金supported in part by the Testbed@TWISC, National Science Council under the Grant No. 100-2219-E-006-001in part by National Natural Science Foundation of China under the Grant No. 60903210
文摘Visual cryptography scheme （VCS） is a secure method that encrypts a secret image by subdividing it into shadow images. Due to the nature of encryption VCS is categorized into two types： the deterministic VCS （DVCS） and the probabilistie VCS （PVCS）. For the DVCS, we use m （known as the pixel expansion） subpixels to represent a secret pixel. The PVCS uses only one subpixel to represent a secret pixel, while the quality of reconstructed image is degraded. A well-known construction of （k, n）-PVCS is obtained from the （k, n）-DVCS. In this paper, we show another construction of （k, n）-PVCS by extending the （k, k）-PVCS.
基金supported by JSPS KAKENHI Grant Nos.17J04232 and 16K12433
文摘Visual cryptography(VC) is an encryption technique for hiding a secret image in distributed and shared images(referred to as shares). VC schemes are employed to encrypt multiple images as meaningless,noisy patterns or meaningful images. However,decrypting multiple secret images using a unique share is difficult with traditional VC. We propose an approach to hide multiple images in meaningful shares. We can decrypt multiple images simultaneously using a common share, which we refer to as a magic sheet. The magic sheet decrypts multiple secret images depending on a given share. The shares are printed on transparencies, and decryption is performed by physically superimposing the transparencies. We evaluate the proposed method using binary, grayscale,and color images.
文摘Differently from pure data encryption,secret image sharing(SIS)mainly focuses on image protection through generating a secret image into n shadow images(shares)distributed to n associated participants.The secret image can be reconstructed by collecting sufficient shadow images.In recent years,many SIS schemes are proposed,among which Shamir’s polynomial-based SIS scheme and visual secret sharing(VSS)also called visual cryptography scheme(VCS)are the primary branches.However,as the basic research issues,the security analysis and security level classification of SIS are rarely discussed.In this paper,based on the study of image feature and typical SIS schemes,four security levels are classified as well as the security of typical SIS schemes are analyzed.Furthermore,experiments are conducted to evaluate the efficiency of our analysis by employing illustrations and evaluation metrics.
基金the National Science Council(Nos.NSC102-2221-E-415-014 and 102-2221-E-415-007)
文摘Visual secret sharing(VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing(VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS. In VMSS, secrets are encoded into noise-like shares which have finally been stacked altogether so as to disclose each of the secrets by specific operations, such as rotating, flipping and sliding. Though the noise-like shares can be decoded by those operations, it is just like a fly in the ointment since they are hard to manage, to recognize and even to stack orderly. Based on some researches about user-friendly VSS for generating meaningful shares, a new friendly VMSS scheme is presented in this paper for achieving two main goals. One is trying to encode multiple secrets at a time and the other is making the decoding process easy to manage. The experimental results prove that our proposed scheme does work.
基金国家自然科学基金(the National Natural Science Foundation of China under Grant No.60573171)安徽省自然科学基金(the Natural Science Foundation of Anhui Province of China under Grant No.070412051)+2 种基金安徽高校省级重点自然科学研究项目(No.KJ2007A043No.2007JYXM020)安徽大学人才队伍建议经费
