Statistics – Applications
Scientific paper
Mar 2011
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2011opten..50c7004w&link_type=abstract
Optical Engineering, Volume 50, Issue 3, pp. 037004-037004-8 (2011).
Statistics
Applications
Cryptography, Image Coding, Polynomials, Image Forming And Processing
Scientific paper
This paper proposes a polynomial-style region incremental multisecret image sharing (PBRIMSIS), for sharing multiple secrets in an image among n participants. The method enables the dealer to distribute the content of an image S to multiple regions, where each region is associated with a certain level of secrecy. In the proposed n-level PBRIMSIS scheme, input image S is encoded to n+1 shadow images that exhibit the following features: a. each shadow image cannot reveal any region in S, b. any t (2 <= t <= n + 1) shadow images can be used to reveal these regions associated with up to t - 1 secret levels, and c. S can be completely reconstructed when all of the n+1 shadow images are available. A discrete cosine transform-based PBRIMSIS with a smaller shadow image scheme is designed to improve the transmission and storage of the generated shadow images. The property of incremental disclosure to the region-based secrets in an image is applicable to image sharing in diverse applications that require the sharing of multiple secrets with different secrecy priorities, such as in cooperative working or in military secrets.
Lin Yung-Yi
Wang Ran-Zan
No associations
LandOfFree
Polynomial-style region incremental multisecret image sharing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Polynomial-style region incremental multisecret image sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial-style region incremental multisecret image sharing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1402429