VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches

Authors:
Sian-Jheng Lin;Ja-Chen Lin
Affiliations:
Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, ROC
Venue:
Pattern Recognition
Year:
2007

Citing 12
Cited 16

How to share a secret

Communications of the ACM
Contrast Optimal Threshold Visual Cryptography Schemes

SIAM Journal on Discrete Mathematics
Visual cryptography for gray-level images by dithering techniques

Pattern Recognition Letters
New visual secret sharing schemes using probabilistic method

Pattern Recognition Letters
Secret image sharing with steganography and authentication

Journal of Systems and Software
A new multi-secret images sharing scheme using Largrange's interpolation

Journal of Systems and Software
Size-Adjustable Visual Secret Sharing Schemes

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A novel image-hiding scheme based on block difference

Pattern Recognition
An image-hiding method with high hiding capacity based on best-block matching and k-means clustering

Pattern Recognition
Rapid and brief communication: Bit-level based secret sharing for image encryption

Pattern Recognition
Fault-tolerant and progressive transmission of images

Pattern Recognition
An image-sharing method with user-friendly shadow images

IEEE Transactions on Circuits and Systems for Video Technology

A Matrix-Based Secret Sharing Scheme for Images

CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
MTVSS: (M)isalignment (T)olerant (V)isual (S)ecret (S)haring on resolving alignment difficulty

Signal Processing
Preventing Cheating in Computational Visual Cryptography

Fundamenta Informaticae
On general construction for extended visual cryptography schemes

Pattern Recognition
Error correction of secret images by search order coding

MUSP'09 Proceedings of the 9th WSEAS international conference on Multimedia systems & signal processing
A novel user-participating authentication scheme

Journal of Systems and Software
A secret sharing scheme for digital images based on two-dimensional linear cellular automata

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability

Image and Vision Computing
Flip visual cryptography (FVC) with perfect security, conditionally-optimal contrast, and no expansion

Journal of Visual Communication and Image Representation
On converting secret sharing scheme to visual secret sharing scheme

EURASIP Journal on Advances in Signal Processing - Special issue on advanced image processing for defense and security applications
Improvements of a two-in-one image secret sharing scheme based on gray mixing model

Journal of Visual Communication and Image Representation
Robust approaches to 3d object secret sharing

ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part I
Preventing Cheating in Computational Visual Cryptography

Fundamenta Informaticae
Essential secret image sharing scheme with different importance of shadows

Journal of Visual Communication and Image Representation
A secret enriched visual cryptography

IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Sharing more information in gray visual cryptography scheme

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a novel method to combine two major branches ofimage sharing: VC and PSS. n transparencies are created for a givengray-valued secret image. If the decoding computer is temporarilynot available at (or, not connected to) the decoding scene, we canstill physically stack any t received transparencies (t≤n is athreshold value) to get a vague black-and-white view of the secretimage immediately. On the other hand, when the decoding computer isfinally available, then we can get a much finer gray-valued view ofthe secret image using the information hidden in thetransparencies. In summary, each transparency is a two-in-onecarrier of the information, and the decoding has two options.