Friendly progressive visual secret sharing using generalized random grids

Shang Kuan Chen

doi:10.1117/1.3262345

1 November 2009 Friendly progressive visual secret sharing using generalized random grids

Shang Kuan Chen

Author Affiliations +

Optical Engineering, Vol. 48, Issue 11, 117001 (November 2009). https://doi.org/10.1117/1.3262345

Abstract

A random grid is a two-dimensional binary array in which entries, 0 or 1, are determined in 50% to 50%. A generalized random grid is also a 2-D binary array in which entries are determined but not necessarily 50% to 50%. Using generalized random grids for visual secret sharing, friendly meaningful transparencies, also called shares, can be generated, and the size of each share is the same with the secret image size. In the decoding phase, stacking at least two friendly meaningful shares together, the content of the secret image can be revealed without any computation, and the more shares stacked, the clearer the result. The proposed method can also be implemented for gray and color images.

©(2009) Society of Photo-Optical Instrumentation Engineers (SPIE)

Citation Download Citation

Shang Kuan Chen "Friendly progressive visual secret sharing using generalized random grids," Optical Engineering 48(11), 117001 (1 November 2009). https://doi.org/10.1117/1.3262345

Published: 1 November 2009

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE