Due to the rapid growth of information acquisition in the era of the Internet of Things (IoT) and Cloud Computing, the concern about the security of private information raises a lot of interests. This paper investigates image sharing based on the concept of (k, n)-threshold strategy according to the Chinese remainder theorem (CRT). A secret image is distributed into n noise-like shadow images preserved by n participants instead of a single carrier. Collecting at least k out of n shadows can reveal the secret image, but fewer than k shadow images could not. We discuss existing CRT-based sharing methods, proposes a simple CRT-based method and illustrates (3,5)- threshold results for RGB color images.