Practical Secret Image Sharing Based on the Chinese Remainder Theorem

Longlong Li, Yuliang Lu, Lintao Liu, Yuyuan Sun and Jiayu Wang
Additional contact information
Longlong Li: College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
Yuliang Lu: College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
Lintao Liu: College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
Yuyuan Sun: College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
Jiayu Wang: College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China

Mathematics, 2022, vol. 10, issue 12, 1-18

Abstract: Compared with Shamir’s original secret image sharing (SIS), the Chinese-remainder-theorem-based SIS (CRTSIS) generally has the advantages of a lower computation complexity, lossless recovery and no auxiliary encryption. However, general CRTSIS is neither perfect nor ideal, resulting in a narrower range of share pixels than that of secret pixels. In this paper, we propose a practical and lossless CRTSIS based on Asmuth and Bloom’s threshold algorithm. To adapt the original scheme for grayscale images, our scheme shares the high seven bits of each pixel and utilizes the least significant bit (LSB) matching technique to embed the LSBs into the random integer that is generated in the sharing phase. The chosen moduli are all greater than 255 and the share pixels are in the range of [0, 255] by a screening operation. The generated share pixel values are evenly distributed in the range of [0, 255] and the selection of ( k , n ) threshold is much more flexible, which significantly improves the practicality of CRTSIS. Since color images in RGB mode are made up of three channels, it is easy to extend the scheme to color images. Theoretical analysis and experiments are given to validate the effectiveness of the proposed scheme.

Keywords: secret image sharing; Chinese remainder theorem; ( k , n ) threshold; practical; lossless (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/12/1959/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/12/1959/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:12:p:1959-:d:833333

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().