A Novel XOR-Based Threshold Visual Cryptography with Adjustable Pixel Expansion [PDF]
Applied Sciences, 2020 A ( k , n ) visual cryptography (VC) scheme encodes a secret image into n shadows that are printed on transparencies distributed among a group of n participants secretly, and reveal the secret image by stacking no less than k of them.
Yusheng Guo +3 more
doaj +3 more sources
Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion [PDF]
Applied Sciences, 2016 Visual cryptography encrypts a secret image into two meaningless random images, called shares, such that it can be decrypted by human vision without any calculations.
Justie Su-Tzu Juan +2 more
doaj +3 more sources
Towards Shift Tolerant Visual Secret Sharing Schemes without Pixel Expansion [PDF]
MATEC Web of Conferences, 2016 Naor and Shamir proposed the visual cryptography in 1995, they encrypted secret image into two meaningless random images, called shares, and it can be decrypted by human vision without any calculations.
Juan Justie Su-Tzu +2 more
doaj +3 more sources
Reversible data hiding with dual pixel-value-ordering and minimum prediction error expansion. [PDF]
PLoS ONE, 2022 Pixel Value Ordering (PVO) holds an impressive property for high fidelity Reversible Data Hiding (RDH). In this paper, we introduce a dual PVO (dPVO) for Prediction Error Expansion (PEE), and thereby develop a new RDH scheme to offer a better rate ...
Md Abdul Wahed, Hussain Nyeem
doaj +2 more sources
On the Pixel Expansion of Visual Cryptography Scheme
International Journal of Digital Crime and Forensics, 2017 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.
Teng Guo, Jian Jiao, Feng Liu, Wen Wang
openaire +2 more sources
Graph access structures with optimal pixel expansion three
Information and Computation, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arumugam, S. +2 more
openaire +3 more sources
Visual cryptography schemes with optimal pixel expansion
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo +2 more
openaire +5 more sources
Urban expansion identification and change analysis in Panjin China from 1990 to 2020 [PDF]
Scientific ReportsThis study examines the dynamic mapping of impervious surface changes in optimising urban spatial structures and fostering sustainable development. A novel deep learning model and time-spectral-texture combination optimisation method were employed to ...
Zhai Jiang +3 more
doaj +2 more sources
Maximal Independent Sets for the Pixel Expansion of Graph Access Structure
International Journal of Industrial Engineering and Production Research, 2008 : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their ...
M. Hadian Dehkordi, A. Cheraghi
doaj +3 more sources
EXTENDED VISUAL CRYPTOGRAPHY SCHEME FOR COLOR IMAGES WITH NO PIXEL EXPANSION
Proceedings of the International Conference on Security and Cryptography, 2010 A k-out-of-n Extended Visual Cryptography Scheme (EVCS) is a secret sharing scheme which hides a secret image into n shares, which are also some images. The secret image can be recovered if at least k of the shares are superimposed, while nothing can be ...
Xiaoyu Wu, D. Wong, Qing Li
openaire +2 more sources