Efficient multi-secret image sharing based on Boolean operations

Visual cryptography (VC) is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. VC takes a binary image (the secret) and divides it into two or more pieces known as shares. When the shares are printed on transparencies and then superimposed, the secret can be recovered. No computer participation is required, thus demonstrating one of the distinguishing features of VC. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the human visual system (HVS). In this survey, we will summarize the latest developments of visual cryptography since its inception in 1994, introduce the main research topics in this area and outline the current problems and possible solutions. Directions and trends for future VC work shall also be examined along with possible VC applications.

A comprehensive study of visual cryptography

Invertible secret image sharing with steganography

Random grids (RG)-based visual secret sharing (VSS) scheme can easily avoid the pixel expansion problem as well as requires no codebook design. However, previous scheme still suffers from low visual quality. In this paper, a new threshold RG-based VSS scheme aiming at improving the visual quality of the previewed image is presented. Compared with previous schemes, our scheme can gain better visual quality in the reconstructed images as well as (k, n) threshold. In addition, the factor affecting the visual quality is analyzed and the differences between related approaches are discussed.

An enhanced threshold visual secret sharing based on random grids

A secure Boolean-based multi-secret image sharing scheme

Two secret sharing schemes based on Boolean operations

This paper presents two new constructions for the secret color images sharing schemes .One is a (n, n) threshold scheme, which can be constructed based on XOR operation. The other is a (2, n) threshold scheme, which can be constructed by using AND and XOR operations. The two schemes have no pixel expansion, and the time complexity for constructing shared images is O(k1n), excluding the time needed for generating n distinct random matrices (here k1 is the size of the shared image). The reconstructed images can be obtained in the two schemes by using the XOR operation alone. The relative differences of the two schemes are 1 and 1/2, respectively. The time complexity of the recovered images is O(k1n) and O(2k1), respectively. The two schemes also provide perfect secrecy.

/pdf/secret-color-images-sharing-schemes-based-on-xor-operation-34bka6hv95.pdf

Secret color images sharing schemes based on XOR operation.

Wool Keratin Gel-Electrolyte In article number 2107163, Lei Zhang, Jingshu Hui, Yuanlong Shao, and co-workers develop a wool keratin derived hybrid biogel electrolyte to regulate the interfacial Zn-ion migration in aqueous Zn-ion battery. Thanks to the merits of keratin triggered Zn-ion transport promotion, a durable wearable quasi-solid-state Zn-ion battery is developed with depressed dendrite formation on anode and side reaction on cathode. 

Ning Ma

Papers

Two secret sharing schemes based on Boolean operations

Secret color images sharing schemes based on XOR operation.

Regulating Interfacial Ion Migration via Wool Keratin Mediated Biogel Electrolyte toward Robust Flexible Zn‐Ion Batteries (Small 10/2022)