The image multiple secret sharing schemes without pixel expansion

Wang, Ching-Lin; Wang, Ching-Te; Chiang, Meng-Lin

doi:10.1109/icmlc.2011.6017028

Search citation statements

Order By: Relevance

Paper Sections

Select...

Literature Review1

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2017

Publication Types

Select...

Article2

Other1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ching-ling wan et al [12] proposed two image secret sharing schemes. The first scheme uses two share images to hiding three secret information images, while second scheme uses three share images to hiding four secret information images.…”

Section: Literature Reviewmentioning

confidence: 99%

Performance Evaluation of watermarking Schemes to Decide Meaningful Number of Shares

Saturwar¹,

Chaudhari²

2017

IRA-JTE

View full text Add to dashboard Cite

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Performance Evaluation of watermarking Schemes to Decide Meaningful Number of Shares

Saturwar¹,

Chaudhari²

2017

IRA-JTE

View full text Add to dashboard Cite

show abstract

“…The proposed scheme uses the concept of pseudo randomization and pixel reversal approach in all methods. Ching et al in [10] proposed two secret sharing, both of them have the characteristic that the share images they produced are with no pixel expansion. Huang and Chang in [5] introduced a scheme that combines the non-expanded scheme with the extra ability of hiding confidential data to prevent the detection of information.In this scheme, the secret image is divided into four regions, and share blocks are subsequently generated by using the block encoding method with nonexpansion ability.…”

Section: Related Workmentioning

confidence: 99%

A New Simple Non-Expansion Algorithm for (2,2) - Visual Secret Sharing Scheme

TarishAl-Tamimi¹,

Gaafar²

2015

IJCA

View full text Add to dashboard Cite

Visual cryptography (VC) is a powerful encryption technique which combines perfect secrecy and secret sharing in cryptography with respect to images. VC takes a binary image (the secret) and divides it into two or more pieces known as shares (transparencies). When the shares are superimposed, the secret can be recovered. One of the distinguishing features of VC is that it needs no computational power for decryption. All what VC needs for decryption is the human visual system (the human eye). Two main factors affect the quality of a visual cryptography scheme; the pixel expansion and the contrast. In this papers we propose a new simple non-expansion algorithm for (2,2)-visual secret sharing scheme (VSS). The shares produced by this algorithm and the reconstructed image are not expanded in size, and all have the same size as the original (secret) image. It encodes the original (secret) image a 4-pixel blockwise to 4-pixel blocks in each share.

show abstract