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.展开更多
With the rise of the Internet of Things(IoT),various devices in life and industry are closely linked.Because of its high payload,stable error correction capability,and convenience in reading and writing,Quick Response...With the rise of the Internet of Things(IoT),various devices in life and industry are closely linked.Because of its high payload,stable error correction capability,and convenience in reading and writing,Quick Response(QR)code has been widely researched in IoT.However,the security of privacy data in IoT is also a very important issue.At the same time,because IoT is developing towards low-power devices in order to be applied to more fields,the technology protecting the security of private needs to have the characteristics of low computational complexity.Visual Secret Sharing(VSS),with its features of safety and low computational cost,can fully meet the requirements of communication security in IoT.Therefore,a VSS scheme with QR code(VSS-QR)was proposed and has been applied to some extent.In VSS-QR,the secret is shared into a series of shares.These shares are usually common QR codes,which cannot cause the attention of the attacker.However,if there is dishonesty among participants,the secret cannot be recovered,which will lead to VSS-QR cannot be widely used due to its inadequate security.In this paper,we propose a visual secret sharing scheme with authentication based on QR code(VSSA-QR).Both the reconstructed secret QR code and shares can be verified whether they are forged by attackers.The above-mentioned operations conveniently are performed on low-power QR scanning devices.Not only does the proposed scheme prevent some dishonest participants or attackers from cheating,but also prevent all participants from conspiring.In addition,the payload is the QR code itself,which is higher than other schemes.Theoretical analysis and experiments prove that the proposed scheme is effective.展开更多
Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to...Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to the characteristics of the human vision system. Considering the issue of sharing the secret image at multiple image resolutions with the meaningful shadows, in this paper, we present a friendly progressive visual secret sharing scheme without expanding the image size in the shadows and the reconstructed secret image based on applying a 2x2-sized block-wise operation to generate the shadows block by block. The proposed method can achieve these benefits： 1） the generated shadows are meaningful, and their sizes are not expanded, and 2） the secret image can be recovered at different resolutions by stacking different quantities of shadows together. The experimental results also show that the proposed method is superior to other compared schemes.展开更多
A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify h...A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.展开更多
A lossless image secret sharing using a simple Boolean operation is proposed. The concept of visual cryptography in the secret sharing scheme is used to redesign a lossless secret sharing scheme. To ensure that the re...A lossless image secret sharing using a simple Boolean operation is proposed. The concept of visual cryptography in the secret sharing scheme is used to redesign a lossless secret sharing scheme. To ensure that the reconstructed image is the true secret image, an authentication mechanism is imported into the proposed scheme to verify whether the shadows are authentic before reconstructing the secret image. The proposed scheme delivers much more effective performance than Chen and Wu＇s scheme.展开更多
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 secret sharing (VSS) is one of the cryptographic techniques of Image secret sharing scheme (ISSS) that performs encoding of secret message image (text or picture) into noise like black and white images, which a...Visual secret sharing (VSS) is one of the cryptographic techniques of Image secret sharing scheme (ISSS) that performs encoding of secret message image (text or picture) into noise like black and white images, which are called as shares. Shares are stacked together and secret message image is decoded using human visual system. One of the major drawbacks of this scheme is its poor contrast of the recovered image, which improves if computational device is available while decoding. In this paper, we propose to improve poor contrast of classical VSS schemes for text or alphanumeric secret messages and low entropy images. Initially, stacked image is binarized using dynamic threshold value. A mathematical morphological operation is applied on the stacked image to enhance contrast of the reconstructed image. Moreover, a method is proposed that allows the size of the structuring element to change according to the contrast and the size of a stacked image. We perform experiments for different types of VSS schemes, different share patterns, different share types (rectangle and circle), and low entropy images. Experimental results demonstrate the efficacy of the proposed scheme.展开更多
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.展开更多
In this paper,a novel secret data-driven carrier-free(semi structural formula)visual secret sharing(VSS)scheme with(2,2)threshold based on the error correction blocks of QR codes is investigated.The proposed scheme is...In this paper,a novel secret data-driven carrier-free(semi structural formula)visual secret sharing(VSS)scheme with(2,2)threshold based on the error correction blocks of QR codes is investigated.The proposed scheme is to search two QR codes that altered to satisfy the secret sharing modules in the error correction mechanism from the large datasets of QR codes according to the secret image,which is to embed the secret image into QR codes based on carrier-free secret sharing.The size of secret image is the same or closest with the region from the coordinate of(7,7)to the lower right corner of QR codes.In this way,we can find the QR codes combination of embedding secret information maximization with secret data-driven based on Big data search.Each output share is a valid QR code which can be decoded correctly utilizing a QR code reader and it may reduce the likelihood of attracting the attention of potential attackers.The proposed scheme can reveal secret image visually with the abilities of stacking and XOR decryptions.The secret image can be recovered by human visual system(HVS)without any computation based on stacking.On the other hand,if the light-weight computation device is available,the secret image can be lossless revealed based on XOR operation.In addition,QR codes could assist alignment for VSS recovery.The experimental results show the effectiveness of our scheme.展开更多
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 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.
基金This work was supported in part by the Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology under Grant 2016r055in part by the Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions.
文摘With the rise of the Internet of Things(IoT),various devices in life and industry are closely linked.Because of its high payload,stable error correction capability,and convenience in reading and writing,Quick Response(QR)code has been widely researched in IoT.However,the security of privacy data in IoT is also a very important issue.At the same time,because IoT is developing towards low-power devices in order to be applied to more fields,the technology protecting the security of private needs to have the characteristics of low computational complexity.Visual Secret Sharing(VSS),with its features of safety and low computational cost,can fully meet the requirements of communication security in IoT.Therefore,a VSS scheme with QR code(VSS-QR)was proposed and has been applied to some extent.In VSS-QR,the secret is shared into a series of shares.These shares are usually common QR codes,which cannot cause the attention of the attacker.However,if there is dishonesty among participants,the secret cannot be recovered,which will lead to VSS-QR cannot be widely used due to its inadequate security.In this paper,we propose a visual secret sharing scheme with authentication based on QR code(VSSA-QR).Both the reconstructed secret QR code and shares can be verified whether they are forged by attackers.The above-mentioned operations conveniently are performed on low-power QR scanning devices.Not only does the proposed scheme prevent some dishonest participants or attackers from cheating,but also prevent all participants from conspiring.In addition,the payload is the QR code itself,which is higher than other schemes.Theoretical analysis and experiments prove that the proposed scheme is effective.
文摘Visual secret sharing has received more and more attention over the past years due to the fact that neither complex computation nor cryptographic knowledge is required to decrypt the secret image directly according to the characteristics of the human vision system. Considering the issue of sharing the secret image at multiple image resolutions with the meaningful shadows, in this paper, we present a friendly progressive visual secret sharing scheme without expanding the image size in the shadows and the reconstructed secret image based on applying a 2x2-sized block-wise operation to generate the shadows block by block. The proposed method can achieve these benefits： 1） the generated shadows are meaningful, and their sizes are not expanded, and 2） the secret image can be recovered at different resolutions by stacking different quantities of shadows together. The experimental results also show that the proposed method is superior to other compared schemes.
文摘A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.
基金supported by the National Science Council under Grant No. NSC100-2218-E-468-002-MY2
文摘A lossless image secret sharing using a simple Boolean operation is proposed. The concept of visual cryptography in the secret sharing scheme is used to redesign a lossless secret sharing scheme. To ensure that the reconstructed image is the true secret image, an authentication mechanism is imported into the proposed scheme to verify whether the shadows are authentic before reconstructing the secret image. The proposed scheme delivers much more effective performance than Chen and Wu＇s scheme.
文摘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 secret sharing (VSS) is one of the cryptographic techniques of Image secret sharing scheme (ISSS) that performs encoding of secret message image (text or picture) into noise like black and white images, which are called as shares. Shares are stacked together and secret message image is decoded using human visual system. One of the major drawbacks of this scheme is its poor contrast of the recovered image, which improves if computational device is available while decoding. In this paper, we propose to improve poor contrast of classical VSS schemes for text or alphanumeric secret messages and low entropy images. Initially, stacked image is binarized using dynamic threshold value. A mathematical morphological operation is applied on the stacked image to enhance contrast of the reconstructed image. Moreover, a method is proposed that allows the size of the structuring element to change according to the contrast and the size of a stacked image. We perform experiments for different types of VSS schemes, different share patterns, different share types (rectangle and circle), and low entropy images. Experimental results demonstrate the efficacy of the proposed scheme.
文摘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.
文摘In this paper,a novel secret data-driven carrier-free(semi structural formula)visual secret sharing(VSS)scheme with(2,2)threshold based on the error correction blocks of QR codes is investigated.The proposed scheme is to search two QR codes that altered to satisfy the secret sharing modules in the error correction mechanism from the large datasets of QR codes according to the secret image,which is to embed the secret image into QR codes based on carrier-free secret sharing.The size of secret image is the same or closest with the region from the coordinate of(7,7)to the lower right corner of QR codes.In this way,we can find the QR codes combination of embedding secret information maximization with secret data-driven based on Big data search.Each output share is a valid QR code which can be decoded correctly utilizing a QR code reader and it may reduce the likelihood of attracting the attention of potential attackers.The proposed scheme can reveal secret image visually with the abilities of stacking and XOR decryptions.The secret image can be recovered by human visual system(HVS)without any computation based on stacking.On the other hand,if the light-weight computation device is available,the secret image can be lossless revealed based on XOR operation.In addition,QR codes could assist alignment for VSS recovery.The experimental results show the effectiveness of our scheme.
基金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.
基金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.
