-
Article
Distributed color QR code with high-capability and fast decoding
Considering incompatibility between the color QR code and the standard QR code decoder and insecurity of information storage in the open network environment, this paper proposes a distributed color QR code by ...
-
Article
A two-level QR code scheme based on polynomial secret sharing
Quick Response codes (QR codes) are common two-dimensional machine readable codes used extensively in all walks of life due to their high reading speeds, high data density, and strong error correction capabili...
-
Article
Rich QR code with three-layer information using visual secret sharing scheme
Owing to efficient machine recognition, QR codes have been widely used in many aspects such as information management, electronic identity and mobile payment. Any QR code reader has access to the message conta...
-
Article
Improved schemes for visual secret sharing based on random grids
Random grid (RG) is an alternative approach to realize a visual secret sharing (VSS) scheme. RG-based VSS has merits such as no pixel expansion and no tailor-made matrix requirement. Recently, many investigati...
-
Article
Perfect recovery of XOR-based visual cryptography scheme
Visual cryptography is an interesting secret sharing scheme, in which participants can observe the secret image by stacking their shares. However, the size expansion and distorted visual effect are two disadva...
-
Article
A new two-level QR code with visual cryptography scheme
The Quick Response (QR) code is designed for information storage recognizable by machine vision. With the popularity of QR code applications, the security of QR codes becomes hot issues concerned by many schol...
-
Article
Visual cryptograms of random grids via linear algebra
Two visual models of image secret sharing have been studied: visual cryptography schemes (VCS), introduced by Naor and Shamir, and visual cryptograms of random grids (VCRG), introduced by Kafri and Keren. VCRG...
-
Article
Perfect contrast XOR-based visual cryptography schemes via linear algebra
XOR-based visual cryptography scheme (XVCS) was proposed to solve the poor visual quality problem without darkening the background in the reconstructed secret image. However, investigations on XVCS are not suf...
-
Article
New insight into linear algebraic technique to construct visual cryptography scheme for general access structure
The most essential advantage of applying linear algebra to construct visual cryptography scheme (VCS) lies in that it only requires solving linear equations in the construction of initial basis matrices, which...
-
Chapter and Conference Paper
Halftone Visual Cryptography with Complementary Cover Images
By the addition of halftone techniques, halftone visual cryptography scheme (HVCS) embeds a secret image into halftone shares taking meaningful visual information. In this paper, we propose a (k, n)-HVCS using co...
-
Article
General construction for XOR-based visual cryptography and its extended capability
A visual cryptography scheme (VCS) can be realized by Boolean operations OR and XOR, respectively. The monotone property of OR operation reduces the visual quality of recovered image. To overcome this problem,...
-
Article
Optimal pixel expansion of deterministic visual cryptography scheme
The optimal pixel expansion is an important parameter of deterministic visual cryptography scheme (DVCS). There are many researches have been done under different access structures and stacking operations. How...
