A new online extended visual cryptography scheme for STS access structures

2008 ◽  
Vol 11 (3) ◽  
pp. 357-374 ◽  
Author(s):  
Sucheta Chakrabarti ◽  
S. K. Pal
Keyword(s):  
Visual Cryptography ◽  
Access Structures ◽  
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.

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 On the Pixel Expansion of Visual Cryptography Scheme

Cryptography ◽  
2020 ◽  
pp. 537-544
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.

Security Concern and Countermeasures for Cheating in Visual Cryptography

2018 ◽  
Vol 6 (8) ◽  
pp. 277
Author(s):  
Ekta Y
Keyword(s):  
Communication System ◽  
Visual Cryptography ◽  
Detection Methods ◽  
Information Communication ◽  
New Approach ◽  
The World ◽  
Visual Cryptography Scheme ◽  
Prevention Methods ◽  
Security Concern

As IT sector is ruling the world now,confidentiality and security of information has become the most important inseparable aspect in information communication system. Keeping in view the same, a new approach called Visual Cryptography (VC) has been suggested by many researchers but there are some limitations with this scheme and cheating is one of the main problem among them. This paper intends to show the basis of cheating in VC in terms of cheating process, its detection methods and its prevention methods suggested by various researchers along with their merits and demerits. Finally, a good Cheating Immune Visual Cryptography Scheme (CIVCS) has been discussed which states the properties to be adopted by every Visual Cryptography scheme to make it immune to cheating attacks.

Sign in / Sign up

Export Citation Format

Share Document