Color image sharing method based on Lagrange's interpolating polynomial

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In order to solve the problem of security during transmission of the large secret true color image, It is proposed that the secret image sharing method based on the Lagrange's interpolating polynomial, the n shadow images of the secret image were made by compressiong, substitute, encoding and disassemble to the secret image, each shadow image is hidden in an ordinary image so as not to attract an attacker's attention, the size of each stego image (in which a shadow image is hidden) is about 1/t of the secret image. Any t images in the n stego images can be used to recover the original secret image. The sharing principle and the recovery fomula are brought, the speed of the image sharing and recovery is heightened in this way, and the process of calculation is simplified. The method is discussed in different Galois domain, drawn the conditions that image block should satisfy, the best way to control the ratio of data expansion effectively and the relationships between security and anti-destructive. If the image as a mass of data, the method can be applied to the secure transmission and storage of huge amounts of data in the cloud computing. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Chen, G., Liu, J., & Wang, L. (2012). Color image sharing method based on Lagrange’s interpolating polynomial. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7231 LNCS, pp. 63–75). https://doi.org/10.1007/978-3-642-29361-0_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free