By Topic

A new secret image sharing technique based on Asmuth Bloom's scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mustafa Ulutas ; Dept. of Computer Engineering, Ondokuz Mayis University, Samsun, Turkey ; Vasif V. Nabiyev ; Guzin Ulutas

The Chinese Remainder Theorem (CRT) is used for secret sharing by both Mignotte and Asmuth Bloom in 1983. Then Shyu et al. used Mignotte's scheme in the field of secret image sharing in 2008. However, their method use a Pseudo Random Number Generator (PRNG) with a seed to generate different pixel values for the consecutive secret pixels that have the same value. The need to distribute the seed and PRNG function to participants in order to reconstruct the secret image is a drawback of their method. A modified secret image sharing technique based on Asmuth Bloom's secret sharing scheme is proposed in this paper. It does not require to distribute the seed or PRNG like Shyu et al.'s technique. In addition, PRNG function is not used during decoding. Therefore, drawbacks in Shyu et al.'s scheme is eliminated by the proposed method using Asmuth Bloom's scheme as can be seen in the results.

Published in:

Application of Information and Communication Technologies, 2009. AICT 2009. International Conference on

Date of Conference:

14-16 Oct. 2009