General Construction for Extended Visual Cryptography Scheme Using QR Codes

2019 ◽  
Vol 11 (1) ◽  
pp. 1-17
Author(s):  
Yuqiao Cheng ◽  
Zhengxin Fu ◽  
Bin Yu ◽  
Gang Shen
Keyword(s):  
Programming Model ◽  
Visual Cryptography ◽  
General Construction ◽  
Qr Code ◽  
Qr Codes ◽  
Research Attention ◽  
Access Structures ◽  
Xor Operation ◽  
Sufficient And Necessary Conditions ◽  
Visual Cryptography Scheme

This article describes how a visual cryptography scheme, with one prominent feature—decrypting simply, has attracted much research attention since it was first proposed. However, meaningless shares remain a continuing challenge in the development of VCS. In this article, an extended visual cryptography scheme (EVCS) based on XOR operation is proposed, in which QR codes are utilized as the cover images of shares. By designation, all the shares generated in the scheme can be decoded by standard QR code readers with specific meaning. In addition, to achieve high sharing efficiency, a method of simultaneously sharing a secret QR code among multiple subsets is presented. Also, sufficient and necessary conditions of the method are analyzed with an integer programming model, providing a general construction approach for EVCS under arbitrary access structures.

scholarly journals Multiple Schemes for Mobile Payment Authentication Using QR Code and Visual Cryptography

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Jianfeng Lu ◽  
Zaorang Yang ◽  
Lina Li ◽  
Wenqiang Yuan ◽  
Li Li ◽  
...  
Keyword(s):  
Visual Cryptography ◽  
Mobile Payment ◽  
Qr Code ◽  
Quick Response ◽  
Qr Codes ◽  
Response Code ◽  
Quick Response Code ◽  
Transaction Process ◽  
Visual Cryptography Scheme ◽  
Background Image

QR code (quick response code) is used due to its beneficial properties, especially in the mobile payment field. However, there exists an inevitable risk in the transaction process. It is not easily perceived that the attacker tampers with or replaces the QR code that contains merchant’s beneficiary account. Thus, it is of great urgency to conduct authentication of QR code. In this study, we propose a novel mechanism based on visual cryptography scheme (VCS) and aesthetic QR code, which contains three primary schemes for different concealment levels. The main steps of these schemes are as follows. Firstly, one original QR code is split into two shadows using VC multiple rules; secondly, the two shadows are embedded into the same background image, respectively, and the embedded results are fused with the same carrier QR code, respectively, using XOR mechanism of RS and QR code error correction mechanism. Finally, the two aesthetic QR codes can be stacked precisely and the original QR code is restored according to the defined VCS. Experiments corresponding to three proposed schemes are conducted and demonstrate the feasibility and security of the mobile payment authentication, the significant improvement of the concealment for the shadows in QR code, and the diversity of mobile payment authentication.

scholarly journals Visual Cryptography Scheme With Meaningful Shares Based on QR Codes

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 59567-59574 ◽  
Author(s):  
Zhengxin Fu ◽  
Yuqiao Cheng ◽  
Bin Yu
Keyword(s):  
Visual Cryptography ◽  
Qr Codes ◽  
Meaningful Shares ◽  
Visual Cryptography Scheme

On the Pixel Expansion of Visual Cryptography Scheme

2017 ◽  
Vol 9 (2) ◽  
pp. 38-44 ◽  
Author(s):  
Teng Guo ◽  
Jian Jiao ◽  
Feng Liu ◽  
Wen Wang
Keyword(s):  
Visual Cryptography ◽  
Upper Bounds ◽  
Graph Decomposition ◽  
Decomposition Technique ◽  
Pixel Expansion ◽  
Access Structures ◽  
Visual Cryptography Scheme ◽  
Graph Access

In this paper, we first follow Ateniese et al.'s work that provides upper bounds of the pixel expansion of visual cryptography schemes(VCSs) for more kinds of graph access structures, in which we require that a subset of parties can determine the secret if they contain an edge of the graph G. The constructive upper bounds are derived by the graph decomposition technique. Then we generalize Ateniese et al.'s method of comparing the optimal pixel expansion of VCSs with two different access structures.

A Verifiable Visual Cryptography Scheme Using Neural Networks

2013 ◽  
Vol 756-759 ◽  
pp. 1361-1365 ◽  
Author(s):  
Yu Qiao Deng ◽  
Ge Song
Keyword(s):  
Neural Networks ◽  
Large Scale ◽  
Visual Cryptography ◽  
Regular Structure ◽  
Signature Scheme ◽  
Information Communication ◽  
Training Time ◽  
Verification Method ◽  
Access Structures ◽  
Visual Cryptography Scheme

This paper proposes a new verifiable visual cryptography scheme for general access structures using pi-sigma neural networks (VVCSPSN), which is based on probabilistic signature scheme (PSS), which is considered as security and effective verification method. Compared to other high-order networks, PSN has a highly regular structure, needs a much smaller number of weights and less training time. Using PSNs capability of large-scale parallel classification, VCSPSN reduces the information communication rate greatly, makes best known upper bound polynomial, and distinguishes the deferent information in secret image.

A new two-level QR code with visual cryptography scheme

2017 ◽  
Vol 77 (16) ◽  
pp. 20629-20649 ◽  
Author(s):  
Yuqiao Cheng ◽  
Zhengxin Fu ◽  
Bin Yu ◽  
Gang Shen
Keyword(s):  
Visual Cryptography ◽  
Qr Code ◽  
Visual Cryptography Scheme

scholarly journals Visual Cryptography Scheme with Essential Participants

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 838 ◽  
Author(s):  
Peng Li ◽  
Liping Yin ◽  
Jianfeng Ma
Keyword(s):  
Integer Programming ◽  
Visual System ◽  
Human Visual System ◽  
Programming Model ◽  
Visual Cryptography ◽  
Optimal Choice ◽  
Experimental Results ◽  
Secret Image ◽  
Visual Cryptography Scheme ◽  
Computational Resources

Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows printed on transparencies. Stacking shadows can visually decode the secret image without computational resources. Specifically, a (k, n) threshold VCS ((k, n)-VCS) shares a secret image into n shadows, stacking any k shadows can reveal the secret image by human visual system, while any less than k shadows cannot decode any information regarding the secret image. In practice, some participants (essentials) play more important roles than others (non-essentials). In this paper, we propose a (t, s, k, n) VCS with essential participants (so called (t, s, k, n)-EVCS). The secret image is shared into n shadows with s essentials and n-s non-essentials. Any k shadows, including at least t essentials, can reveal the secret image. The proposed scheme is constructed from a monotonic (K, N)-VCS. The condition and optimal choice of (K, N)-VCS to construct (t, s, k, n)-EVCS are given by solving integer programming model. The experimental results are conducted to verify the feasibility of our scheme.

Sign in / Sign up

Export Citation Format

Share Document