GF(2<6>) finite-field multi-threshold progressive secrete image sharing and reconstruction methods

Abstract

The invention provides GF(2<6>) finite-field multi-threshold progressive secrete image sharing and reconstruction methods. A secret key is shared by combining a random participation value, and an MD5 value corresponding to the shared secrete key and participation value is published to prevent cheating; 8*8 frequency domain transformation is carried out on a secret image, sub-block frequency domain coefficients are quantified randomly, a specific code length distribution list is represented in a binary manner, multiple division frequency bands are formed according to a similar Z-shaped scanning sequence and frequency band recombination, and a frequency band backup is formed by scrambling; and frequency band, frequency band backup and authentication information is shared in multiple thresholds in the GF(2<6>) finite-field, and 2-bit authentication information is added to reconstruct a distribution shadow image. During recovery, the MD5 value is detected, a reconstructable frequency band is determined by combining the multiple thresholds, primary and secondary frequency band backup tables are reconstructed via dual authentication, a corresponding frequency band is reconstructed, and the reconstructed frequency band is used to reconstruct a secret image. Compared with existing methods, the distribution shadow image can be used fully to share the secret image progressively, and the visual reconstruction quality is improved.

Description

technical field [0001] The invention belongs to the intersecting field of image information security and digital image signal processing, relates to an information sharing method, in particular to a GF(2 6 ) Finite-field multi-threshold progressive secret image sharing and reconstruction method. Background technique [0002] The existing image information sharing technology is mainly derived from the secret sharing in cryptography. Combined with the secret sharing scheme, the image information sharing scheme based on (K, N) threshold has been widely proposed. The early image information sharing scheme based on (K, N) threshold There is no authentication measure in the information sharing scheme, so the authenticity of the final reconstructed secret image cannot be verified. Aiming at the potential safety hazards in the use of image sharing schemes without authentication measures, some literatures also discuss image sharing with authentication. For example, Lin C C, 2004 (L...

AI Technical Summary

Problems solved by technology

But the proposed method is to use 2 8-bit secret pixels and 2 4-bit backup image pixels totaling 24 bits as the initial 3-time 8-cell to construct a reversible cellular automaton for sharing. The problem caused by this is: it is not The real (3,N) threshold scheme requires at least 3 shared storage units with consecutive numbers to recover 2 secret pixels of the secret image and 2 backup pixels of the backup image; any pixel in the 2×4 block Attacked, that is, the 24-bit information of the 2 secret pixels and the 2 pixels of the backup image is unavailable, so the method cannot resist any small noise attack

[0006] Kong J,2007(Kong J,Zhang Y,Meng X,et al.A Scalable Secret ImageSharing Method Based on Discrete Wavelet Transform[C]//Bio-Inspired Computational Intelligence and Applications,International Conference on LifeSyste

Images