Next Article in Journal
Symmetry Analysis, Explicit Solutions, and Conservation Laws of a Sixth-Order Nonlinear Ramani Equation
Previous Article in Journal
A Three-Dimensional Constrained Ordered Weighted Averaging Aggregation Problem with Lower Bounded Variables
Previous Article in Special Issue
Steganalysis of Inactive Voice-Over-IP Frames Based on Poker Test
Article Menu
Issue 8 (August) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(8), 340; https://doi.org/10.3390/sym10080340

Chinese Remainder Theorem-Based Secret Image Sharing with Small-Sized Shadow Images

National University of Defense Technology, Hefei 230037, China
*
Author to whom correspondence should be addressed.
Received: 7 July 2018 / Revised: 6 August 2018 / Accepted: 13 August 2018 / Published: 15 August 2018
(This article belongs to the Special Issue Emerging Data Hiding Systems in Image Communications)
Full-Text   |   PDF [1675 KB, uploaded 17 August 2018]   |  

Abstract

Secret image sharing (SIS) with small-sized shadow images has many benefits, such as saving storage space, improving transmission time, and achieving information hiding. When adjacent pixel values in an image are similar to each other, the secret image will be leaked when all random factors of an SIS scheme are utilized for achieving small sizes of shadow images. Most of the studies in this area suffer from an inevitable problem: auxiliary encryption is crucial in ensuring the security of those schemes. In this paper, an SIS scheme with small-sized shadow images based on the Chinese remainder theorem (CRT) is proposed. The size of shadow images can be reduced to nearly 1 / k of the original secret image. By adding random bits to binary representations of the random factors in the CRT, auxiliary encryption is not necessary for this scheme. Additionally, reasonable modifications of the random factors make it possible to incorporate all advantages of the CRT as well, including a ( k , n ) threshold, lossless recovery, and low computation complexity. Analyses and experiments are provided to demonstrate the effectiveness of the proposed scheme. View Full-Text
Keywords: secret image sharing; Chinese remainder theorem; no pre-encryption; lossless recovery; small shadow images secret image sharing; Chinese remainder theorem; no pre-encryption; lossless recovery; small shadow images
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Chen, J.; Liu, K.; Yan, X.; Liu, L.; Zhou, X.; Tan, L. Chinese Remainder Theorem-Based Secret Image Sharing with Small-Sized Shadow Images. Symmetry 2018, 10, 340.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top