Towards shift tolerant visual secret sharing schemes without pixel expansion

Justie Su Tzu Juan; Yung Chang Chen; Song Guo

doi:10.1051/matecconf/20167101002

Towards shift tolerant visual secret sharing schemes without pixel expansion

Justie Su Tzu Juan, Yung Chang Chen, Song Guo

Research output: Journal article publication › Conference article › Academic research › peer-review

1 Citation (Scopus)

Abstract

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. However, there would be problems in alignment when these two shares are staked by hand in practical. Therefore, this paper presents the fault-tolerant schemes of stacking two shares which are acquired from secret image encryption without pixel expansion. The main idea of these schemes is combining several pixels to be a unit, then encrypting every unit into a specific combination of pixels. It makes visual secret sharing scheme more practical.

Original language	English
Article number	01002
Journal	MATEC Web of Conferences
Volume	71
DOIs	https://doi.org/10.1051/matecconf/20167101002
Publication status	Published - 2 Aug 2016
Externally published	Yes
Event	1st International Conference on Computing and Precision Engineering, ICCPE 2015 - Sun Moon Lake Teacher's Hostel, Nantou, Taiwan Duration: 27 Nov 2015 → 29 Nov 2015

ASJC Scopus subject areas

General Chemistry
General Engineering
General Materials Science

More information

10.1051/matecconf/20167101002

Cite this

@article{2fd70b5c737344faa49827493e4dcea9,

title = "Towards shift tolerant visual secret sharing schemes without pixel expansion",

abstract = "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. However, there would be problems in alignment when these two shares are staked by hand in practical. Therefore, this paper presents the fault-tolerant schemes of stacking two shares which are acquired from secret image encryption without pixel expansion. The main idea of these schemes is combining several pixels to be a unit, then encrypting every unit into a specific combination of pixels. It makes visual secret sharing scheme more practical.",

author = "Juan, {Justie Su Tzu} and Chen, {Yung Chang} and Song Guo",

year = "2016",

month = aug,

day = "2",

doi = "10.1051/matecconf/20167101002",

language = "English",

volume = "71",

journal = "MATEC Web of Conferences",

issn = "2261-236X",

publisher = "EDP Sciences",

note = "1st International Conference on Computing and Precision Engineering, ICCPE 2015 ; Conference date: 27-11-2015 Through 29-11-2015",

}

TY - JOUR

T1 - Towards shift tolerant visual secret sharing schemes without pixel expansion

AU - Juan, Justie Su Tzu

AU - Chen, Yung Chang

AU - Guo, Song

PY - 2016/8/2

Y1 - 2016/8/2

N2 - 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. However, there would be problems in alignment when these two shares are staked by hand in practical. Therefore, this paper presents the fault-tolerant schemes of stacking two shares which are acquired from secret image encryption without pixel expansion. The main idea of these schemes is combining several pixels to be a unit, then encrypting every unit into a specific combination of pixels. It makes visual secret sharing scheme more practical.

AB - 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. However, there would be problems in alignment when these two shares are staked by hand in practical. Therefore, this paper presents the fault-tolerant schemes of stacking two shares which are acquired from secret image encryption without pixel expansion. The main idea of these schemes is combining several pixels to be a unit, then encrypting every unit into a specific combination of pixels. It makes visual secret sharing scheme more practical.

UR - http://www.scopus.com/inward/record.url?scp=84982130880&partnerID=8YFLogxK

U2 - 10.1051/matecconf/20167101002

DO - 10.1051/matecconf/20167101002

M3 - Conference article

SN - 2261-236X

VL - 71

JO - MATEC Web of Conferences

JF - MATEC Web of Conferences

M1 - 01002

T2 - 1st International Conference on Computing and Precision Engineering, ICCPE 2015

Y2 - 27 November 2015 through 29 November 2015

ER -

Towards shift tolerant visual secret sharing schemes without pixel expansion

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this