A Novel Visual Secret Sharing Scheme Based on QR Codes

2017 ◽  
Vol 9 (3) ◽  
pp. 38-48 ◽  
Author(s):  
Song Wan ◽  
Yuliang Lu ◽  
Xuehu Yan ◽  
Lintao Liu

In this paper, a novel visual secret sharing (VSS) scheme using QR codes is investigated. The proposed visual secret sharing scheme based on QR codes(VSSQR) can visually reveal secret image by stacking sufficient (shadow images) shares as well as scan the QR code by a QR code reader. Our VSSQR exploits the error correction mechanism in the QR code structure, to embed the bits corresponding to shares generated by VSS from a secret bit into the same locations of QR codes in the processing of encoding QR. Each output share is a valid QR code, which may reduce the likelihood of attracting the attention of potential attackers. The secret image can be recovered by stacking sufficient QR code shares based on the human visual system without any computation. In addition, it can assist alignment for VSS recovery. The experiment results show the effectiveness of our scheme.

2019 ◽  
Vol 79 (9-10) ◽  
pp. 5719-5741 ◽  
Author(s):  
Longdan Tan ◽  
Yuliang Lu ◽  
Xuehu Yan ◽  
Lintao Liu ◽  
Xuan Zhou

AbstractQuick response (QR) codes are becoming increasingly popular in various areas of life due to the advantages of the error correction capacity, the ability to be scanned quickly and the capacity to contain meaningful content. The distribution of dark and light modules of a QR code looks random, but the content of a code can be decoded by a standard QR reader. Thus, a QR code is often used in combination with visual secret sharing (VSS) to generate meaningful shadows. There may be some losses in the process of distribution and preservation of the shadows. To recover secret images with high quality, it is necessary to consider the scheme’s robustness. However, few studies examine robustness of VSS combined with QR codes. In this paper, we propose a robust (k, n)-threshold XOR-ed VSS (XVSS) scheme based on a QR code with the error correction ability. Compared with OR-ed VSS (OVSS), XVSS can recover the secret image losslessly, and the amount of computation needed is low. Since the standard QR encoder does not check if the padding codewords are correct during the encoding phase, we replace padding codewords by initial shadows shared from the secret image using XVSS to generate QR code shadows. As a result, the shadows can be decoded normally, and their error correction abilities are preserved. Once all the shadows have been collected, the secret image can be recovered losslessly. More importantly, if some conventional image attacks, including rotation, JPEG compression, Gaussian noise, salt-and-pepper noise, cropping, resizing, and even the addition of camera and screen noises are performed on the shadows, the secret image can still be recovered. The experimental results and comparisons demonstrate the effectiveness of our scheme.


Author(s):  
Nikita Bhoskar

Abstract: The quick response code (QR) has become most popular barcode because of its larger data capacity and increased damage resistance. Barcode scanners can easily extract information hidden in the QR code when scanning data forms. However, some confidential data stored directly in QR codes are not secure in real world QR apps. To proposed approach to visual secret sharing scheme to encode a secret QR code into distinct shares. In assessment with other techniques, the shares in proposed scheme are valid QR codes that may be decoded with some unique that means of a trendy QR code reader, so that escaping increases suspicious attackers. An existing sharing technique is subjected to loss of security. On this premise, consider the strategy for (k, n) get to structures by using the (k, k) sharing occurrence on each k-member subset dependent on specific relationship. In addition, the secret message is recovered with the aid of XOR-ing the qualified shares. This operation which can effortlessly be achieved the use of smartphones or different QR scanning gadgets. Contribution work is, working on optimal partitioning methods and compare original message with shared message using hashing techniques. Keywords: Hashing, partitioning algorithm, error correction capacity, high security, Quick Response code, visual secret sharing scheme


2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Longdan Tan ◽  
Kesheng Liu ◽  
Xuehu Yan ◽  
Lintao Liu ◽  
Tianqi Lu ◽  
...  

Different color patterns of quick response (QR) codes, such as RGB, grayscale, and binary QR codes, are widely used in applications. In this paper, we propose a novel XOR-based visual secret sharing (VSS) scheme using grayscale QR codes as cover images and binary QR code as secret image. First, all the codewords of the secret QR code image are encoded into n temporary binary QR code images, which are substituted for the second significant bit planes of the grayscale QR code cover images to generate n shares. Each share is a grayscale QR code image, which can be decoded by a standard QR code decoder, so that it may not attract the attention of potential attackers when distributed in the public channel. The secret image can be recovered by XORing the codewords regions of QR codes which are extracted from the second significant bit planes of the grayscale shares. More importantly, the proposed scheme is robust to JPEG compression, addition of different noises, rotation, resizing, and cropping, which is useful in practice. The effectiveness and robustness of our scheme are shown by the experimental results. The application of QR code is suitable for wireless multimedia data security.


2019 ◽  
Vol 79 (3-4) ◽  
pp. 2789-2811
Author(s):  
Song Wan ◽  
Lanlan Qi ◽  
Guozheng Yang ◽  
Yuliang Lu ◽  
Xuehu Yan ◽  
...  

2019 ◽  
Vol 8 (2) ◽  
pp. 4284-4288

QR code is a quick response code which is used to store information. In QR code, the information is stored in encoded form. To access information present in QR code , we need to decode information with the help of scanner. The information which is present in QR code is accessible to anybody. Private data is not safe in such scenario. This paper presents a visual secret sharing scheme to encode a secret QR code into distinct shares. Visual secret sharing scheme is a method of distributing secrete amongst a group of participants. The secret message is recovered by XOR-ing the shares. Secret message can be generated only when enough number of shares are combined. This provides security for private message using visual secret sharing scheme. Proposed system provides higher security to messages and it also provides more flexible access structure. Computational cost of proposed scheme is low


Sign in / Sign up

Export Citation Format

Share Document