Converting (n, n)-Multiple Secret Sharing into More Friendly Appearance using Chinese Remainder Theorem and Boolean Operations

Abstract

This paper extends the (n, n) - Multiple Secret Sharing (MSS) into friendlier appearance. This paper modifies the (n, n)-MSS by utilizing the Chinese Remainder Theorem (CRT) and bitwise Boolean computation. It creates n shadow images from n secret images. This technique needs n shadow images in order to reveal n secret images. The proposed method produces a set of shadow images in the noise-like form (random image). It aims that malicious attacker or unauthorized party cannot recognize the content of shadow images. Later, the proposed method converts each shadow image in the noise-like form into more meaningful image (or more friendly appearance) using Boolean operation. The experiments reveals that the proposed method yields the lossless recovered secret images for n is odd and even number.