Information steganography method based on AMBTC compressed code and tampering detection system

Abstract

The invention discloses an information steganography method based on AMBTC compressed codes and a tampering detection system. According to the invention, the AMBTC compression processing is carried out on the original image to generate the AMBTC compression code, and the verification information is steganographically written into the AMBTC compression code. During decoding, verification needs to be carried out, and the data integrity can be confirmed only when verification information is completely matched. The method aims at bit level application, is different from a traditional method mainly oriented to AMBTC compressed images, focuses on processing of AMBTC compressed codes, and has remarkable advantages. Experimental results show that tampering attacks of different degrees can be effectively detected, the detection rate is extremely high, and meanwhile the zero false alarm rate is achieved.

Description

Technical Field

[0001] The present invention belongs to the fields of data compression, steganography, and protection, and specifically relates to an information steganography method and tampering detection system based on AMBTC compression codes. Background Art

[0002] With the rapid development of Internet technology, a large number of images are transmitted and stored every day. As an efficient technology, image compression is widely used in various scenarios. However, with the increasing demand for image usage, its security issues have gradually attracted attention. Traditional compressed image protection technologies usually focus on the image content itself. However, in practical applications, tampering often occurs at the bit level rather than directly on the meaningful content of the image. Therefore, traditional methods are difficult to comprehensively deal with complex tampering scenarios. The present invention proposes an innovative method based on information steganography. By embedding the self-information of the compressed image into the compression code, both tampering detection and effective verification of data integrity can be achieved. Compared with traditional methods, this technology is more in line with actual needs, has significant novelty and innovation, and shows broad application potential in the fields of copyright protection, ownership authentication, and confidential communication. Summary of the Invention

[0003] The object of the present invention is to propose an information steganography and tampering detection method based on the compression code of absolute moment block truncation coding (AMBTC, Absolute Moment Block Truncation Coding).

[0004] The technical solution of the present invention is as follows:

[0005] In a first aspect, the present invention provides an information steganography method based on AMBTC compression codes, and the specific steps are as follows:

[0006] S1: Divide the original image into image blocks of 4×4 size, and each image block is compressed by the AMBTC algorithm to generate a 32-bit compression code composed of an 8-bit high value, an 8-bit low value, and a 16-bit bitmap.

[0007] S2: For each image block, cut the 16-bit bitmap into three parts in order. The sizes of the first part, the second part, and the third part are 7 bits, 7 bits, and 2 bits respectively. Connect the third part with the high value and the low value corresponding to the image block to form an 18-bit data, and input it into a hash function seeded with a steganography key to generate 6-bit verification information.

[0008] S3: Use the scrambling key as a seed to perform a pseudo-random scrambling mapping pairing on all the image blocks segmented from the original image, and form a one-to-one mapping pairing relationship for all the image blocks.

[0009] S4: Traverse all image blocks, and use the matrix coding algorithm to steganographically embed the verification information corresponding to the current image block into the first part and the second part of the bitmap of the image block mapped and paired with the current image block; after traversing and processing all image blocks, combine the 32-bit compressed codes with the verification information steganographically embedded corresponding to all image blocks in order, and finally generate an AMBTC steganographic compressed code containing the verification information for tampering detection and image reconstruction.

[0010] Preferably, for the first aspect above, the specific method of S3 is as follows: Input the indices of all image blocks, perform pseudo-random scrambling on all indices using the scrambling key as a seed, equally divide the scrambled index sequence into two subsequences, and then pair the image block indices with the same positions in the two subsequences. Each two indices form a set of mapping and pairing relationships.

[0011] Preferably, for the first aspect above, in S4, for each current image block during the traversal process, the specific method of embedding the verification information using the matrix coding algorithm is as follows:

[0012] S41: According to the mapping and pairing relationship, split the 6-bit verification information of the paired image block of the current image block into two segments, each segment being 3 bits; take the first part and the second part of the bitmap of the current image block as two 7-bit first vectors respectively, and use the matrix coding algorithm to multiply the parity check matrices of size 3×7 with the two first vectors respectively to obtain two segments of 3-bit intermediate information, and then perform XOR operations on the two segments of 3-bit verification information and the two segments of 3-bit intermediate information respectively to obtain two 3-bit combined codes;

[0013] S42: According to the two calculated combined codes, determine the coset leader corresponding to each combined code respectively according to the matrix coding cosets of the parity check matrix, and perform XOR operations on the first part and the second part of the bitmap of the current image block with the corresponding coset leaders respectively, so that 1 bit of each part is flipped, and obtain a new first part and a new second part to replace the original first part and the second part in the bitmap, thereby steganographically embedding the verification information of the paired image block into the bitmap of the 32-bit compressed code of the current image block;

[0014] S43: After completing the steganographic embedding of the verification information for all image block compressed codes, splice and combine all the 32-bit compressed codes with the verification information steganographically embedded to obtain an AMBTC steganographic compressed code containing the verification information.

[0015] Preferably, in the matrix coding cosets of the parity check matrix, when the syndrome codes are 000, 001, 010, 011, 100, 101, 110, and 111, the corresponding coset leaders are 0000000, 1000000, 0100000, 0010000, 0001000, 0000100, 0000010, and 0000001 respectively.

[0016] In a second aspect, the present invention provides an information decoding and tampering detection system based on an AMBTC compressed code. After receiving the AMBTC steganographic compressed code generated by the sender according to the information steganography method based on the AMBTC compressed code described in any one of the above first aspects, the detection system uses the inverse process of the matrix coding algorithm to extract the verification information embedded in the bitmap of each image block, verify the data integrity, and reconstruct the AMBTC compressed image.

[0017] Preferably, in the detection system, the specific method for extracting the verification information, verifying the data integrity, and reconstructing the AMBTC compressed image is as follows:

[0018] S51: After receiving the AMBTC steganographic compressed code, the decoding detection system cuts it into segments of 32 bits each. Each segment represents an image block, which contains a 16-bit bitmap, an 8-bit high value, and an 8-bit low value. The 16-bit bitmap is cut into three parts: a 7-bit first part, a 7-bit second part, and a 2-bit third part. The third part of the bitmap is concatenated with the high value and the low value to form an 18-bit data. Then, the 18-bit data and the steganographic key are input into a preset hash function to generate 6-bit information to be verified.

[0019] S52: Using the scrambling key as a seed, perform pseudo-random scrambling mapping pairing on all the image blocks segmented from the original image to restore the one-to-one mapping pairing relationship formed between all the image blocks.

[0020] S53: Traverse all the image blocks cut from the AMBTC steganographic compressed code. Use the first part and the second part of the bitmap of the image block paired with the current image block as the second vectors respectively. Using the matrix coding algorithm, multiply the parity check matrix of size 3×7 with the two second vectors respectively to decode and obtain two 3-bit verification information, and combine the two segments of verification information into a 6-bit verification information.

[0021] S54: For each image block, match the information to be verified obtained in S51 with the verification information obtained in S53. If they are exactly the same, it is considered that the mapping pairing relationship between the image block and the paired image block has not been tampered with. If there is an inconsistency, it is considered that the mapping pairing relationship between the image block and the paired image block has been tampered with.

[0022] S55: If none of the image blocks are tampered with, the original image is obtained by reconstructing the image according to the AMBTC algorithm.

[0023] In a third aspect, the present invention provides a computer program product, including computer programs / instructions, characterized in that when the computer programs / instructions are executed by a processor, they can implement the information steganography method based on the AMBTC compression code as described in any one of the above first aspects.

[0024] In a fourth aspect, the present invention provides a computer program product, including computer programs / instructions, characterized in that when the computer programs / instructions are executed by a processor, they can implement the information decoding and tampering detection system based on the AMBTC compression code as described in any one of the above first aspects.

[0025] In a fifth aspect, the present invention provides a computer-readable storage medium, characterized in that a computer program is stored on the storage medium, and when the computer program is executed by a processor, it implements the information steganography method based on the AMBTC compression code as described in any one of the above first aspects, or implements the information decoding and tampering detection system based on the AMBTC compression code as described in the above second aspect.

[0026] In a sixth aspect, the present invention provides a computer electronic device, characterized in that it includes a memory and a processor;

[0027] The memory is used to store computer programs;

[0028] The processor is used to, when executing the computer program, implement the information steganography method based on the AMBTC

[0029] compression code as described in any one of the above first aspects, or implement the information decoding and tampering detection system based on the AMBTC compression code as described in the above second aspect.

[0030] Compared with the prior art, the advantages and beneficial effects of the present invention are as follows:

[0031] The present invention combines compression technology with steganography technology, and realizes the functions of data integrity verification and tampering detection. For bit-level applications, the present invention is different from traditional methods mainly facing the characteristics of AMBTC compressed images, focuses on the processing of AMBTC compression codes, and has significant innovation. The present invention can effectively detect different degrees of tampering attacks, has an extremely high detection rate, and at the same time realizes a zero false alarm rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 It is a schematic diagram of the steps of the information steganography method based on the AMBTC compression code;

[0033] Figure 2 is the method flow chart of the present invention;

[0034] Figure 3 is the compression steganography effect diagram;

[0035] Figure 4 is the decoding detection effect diagram in the embodiment of the present invention;

[0036] Figure 5 is the schematic diagram of the computer electronic device in the embodiment of the present invention. Detailed implementation manners

[0037] To facilitate the understanding and implementation of the present invention by those of ordinary skill in the art, the following further describes its embodiments with reference to the accompanying drawings. It should be clear that the embodiments are only one possibility, illustrative and explanatory, and do not constitute a limitation to the present invention.

[0038] The following further describes in detail the specific implementation manners of the present invention with reference to the accompanying drawings:

[0039] In a preferred embodiment of the present invention, a method for information steganography and tampering detection based on AMBTC compression code is provided. The specific approach is as follows: First, the original image is compressed using the AMBTC algorithm, verification information is generated based on the compression code, and the verification information is embedded into the image using a key. During the information decoding process, the verification information is extracted through the key, and thus integrity verification can be performed while reconstructing the AMBTC compressed image. Therefore, the present invention includes an information steganography method based on AMBTC compression code and a corresponding information decoding and tampering detection method based on AMBTC compression code, which are introduced separately below.

[0040] As Figure 1 shown, the specific steps of the information steganography method based on AMBTC compression code are as follows:

[0041] S1: Compress the original image using the AMBTC algorithm. Specifically, the original image is divided into image blocks of 4×4 size, and each image block is compressed through the AMBTC algorithm to generate a 32-bit compression code composed of an 8-bit high value, an 8-bit low value, and a 16-bit bitmap.

[0042] In step S1 of this embodiment, the method for compressing the original image using the AMBTC algorithm is as follows:

[0043] S11: Divide the original image into a series of image blocks of 4×4 size and perform subsequent processing separately;

[0044] S12: Calculate the average value of the pixels within each image block;

[0045] S13: For each image block, pixels greater than the average value within the image block are marked as 1, and pixels less than or equal to the average value are marked as 0, thereby generating a 16-bit bitmap;

[0046] S14: For each image block, calculate the average value of the pixels marked as 1 as the high value and represent it with 8 bits; calculate the average value of the pixels marked as 0 as the low value and represent it with 8 bits;

[0047] S15: For each image block, a 32-bit compression code is composed of an 8-bit high value, an 8-bit low value, and a 16-bit bitmap. After processing all image blocks, a complete AMBTC compression code composed of the compression codes of all image blocks can be generated.

[0048] S2: For each image block, the 16-bit bitmap is sequentially cut into three parts. The sizes of the first part, the second part, and the third part are 7 bits, 7 bits, and 2 bits respectively. The third part is connected to the high value and the low value corresponding to the image block to form an 18-bit data, and is input into a hash function seeded with the steganographic key to generate 6-bit verification information.

[0049] The specific implementation method of step S2 in this embodiment is as follows:

[0050] S21: For the 32-bit compression code of each image block, the 16-bit bitmap is spliced into a 16-bit data stream in the bitmap scanning order, and then the data stream is sequentially cut into three parts with sizes of 7 bits, 7 bits, and 2 bits, which are denoted as the first part, the second part, and the third part in sequence;

[0051] S22: For each image block, the third part of the bitmap is connected to the high value and the low value to form an 18-bit data. The 18-bit data is input into a hash function seeded with the steganographic key to generate 6-bit verification information. It should be noted that the steganographic key in the present invention is a preset key, which is the same at the sender and the receiver, so that the receiver can restore the corresponding verification information subsequently.

[0052] S3: Using the scrambling key as a seed, perform a pseudo-random scrambling mapping pairing on all the image blocks segmented from the original image, and form a mapping pairing relationship for all the image blocks one by one. It should be noted that the scrambling key in the present invention is a preset key, which is the same at the sender and the receiver, so that the receiver can restore the corresponding mapping pairing relationship subsequently.

[0053] In step S3 of this embodiment, the specific method is as follows:

[0054] S31: Input the indices of all image blocks, perform pseudo-random scrambling on all the indices using the scrambling key as the seed, equally divide the scrambled index sequence into two subsequences, and then pair the image block indices at the same positions in the two subsequences. Each pair of two indices forms a set of mapping pairing relationships. Taking 6 image blocks as an example, their indices are {1, 2, 3, 4, 5, 6}. After performing pseudo-random scrambling on them using the scrambling key as the seed, the obtained sequence is {3, 4, 6, 2, 5, 1}. Then the two equally divided subsequences are {3, 4, 6} and {2, 5, 1}. After pairing according to the positions, three sets of mapping pairing relationships {3→2}, {4→5}, and {6→1} can be obtained. During the subsequent traversal process, for each traversed image block denoted as the current image block, each current image block can find another image block based on its own mapping pairing relationship, denoted as the paired image block.

[0055] S32: Keep the mapping pairing of all image block indices for subsequent calls during the matrix encoding process. The number of such mapping pairing relationships is the total number of all image blocks divided by 2.

[0056] S4: Traverse all image blocks, and use the matrix encoding algorithm to steganographically embed the verification information corresponding to the current image block into the first part and the second part of the bitmap of the image block mapped and paired with the current image block; after traversing and processing all image blocks, orderly combine the 32-bit compressed codes with the steganographed verification information corresponding to all image blocks, and finally generate the AMBTC steganographic compressed code containing the verification information for tampering detection and image reconstruction.

[0057] In step S4 of this embodiment, the specific method for generating the AMBTC steganographic compressed code containing the verification information is as follows:

[0058] S41: According to the mapping pairing relationship, split the 6-bit verification information of the paired image block of the current image block into two segments, each segment being 3 bits; take the first part and the second part of the bitmap of the current image block as two 7-bit first vectors respectively, and use the matrix encoding algorithm to multiply the parity check matrix of size 3×7 with the two first vectors respectively to obtain two segments of 3-bit intermediate information, and then perform XOR operations on the two segments of 3-bit verification information and the two segments of 3-bit intermediate information in a one-to-one correspondence manner to obtain two 3-bit comprehensive codes.

[0059] In the matrix encoding algorithm used in the present invention, a 3×7 parity check matrix H needs to be preset in advance, and its form in the embodiment of the present invention is as follows:

[0060]

[0061] For each 3-bit verification information m split from the above 6-bit verification information, calculate the syndrome using the following formula:

[0062]

[0063] In the formula: v represents the 7-bit first vector. It should be noted that there are two 7-bit first vectors v and two 3-bit verification information m, which need to be used in one-to-one correspondence during the calculation of the syndrome. Assuming that the first 3 bits of the 6-bit verification information split from the paired image block are recorded as the first segment, and the last 3 bits are recorded as the second segment, then a syndrome needs to be calculated using the 3-bit verification information m of the first segment and the 7-bit first vector v corresponding to the first part in the bitmap, and another syndrome needs to be calculated using the 3-bit verification information m of the second segment and the 7-bit first vector v corresponding to the second part in the bitmap.

[0064] S42: According to the two calculated syndromes, determine the coset leader corresponding to each syndrome according to the matrix encoding coset of the parity check matrix, and perform an exclusive OR operation on the first part and the second part in the bitmap of the current image block with the corresponding coset leader respectively, so that 1 bit in each part is flipped, and the new first part and the new second part are obtained and replaced with the original first part and the second part in the bitmap, so as to hide the verification information of the paired image block into the bitmap of the 32-bit compressed code of the current image block.

[0065] In the matrix encoding coset of the parity check matrix used in the present invention, the coset leaders corresponding to different syndromes are recorded. When the syndromes are 000, 001, 010, 011, 100, 101, 110, 111, the corresponding coset leaders are 0000000, 1000000, 0100000, 0010000, 0001000, 0000100, 0000010, 0000001 respectively, as shown in Table 1 for details:

[0066] Table 1 Matrix encoding coset of parity check matrix H

[0067]

[0068] The coset leader in this table determines the position of 1 bit in the 7-bit vector v that needs to be flipped. By performing the flip operation, another 7-bit vector v' can be updated:

[0069]

[0070] The new 7-bit vector v' is the vector after embedding the verification information. For the 7-bit vectors v corresponding to the first part and the second part in the bitmap respectively, the new 7-bit vector v' can be calculated through the above formula, and then the new first part and the new second part are obtained. The 7-bit vector modified based on the matrix coding coset is overwritten at the corresponding position of the bitmap to generate a bitmap containing the auxiliary information of the steganographic mapping paired image blocks.

[0071] S43: After completing the steganography of the verification information for all the image block compression codes, splice and combine all the 32-bit compression codes with the steganographed verification information to obtain the AMBTC steganographic compression code containing the verification information. This AMBTC steganographic compression code can be used for tamper detection and image reconstruction.

[0072] The above steps S1 to S4 describe the process of generating the AMBTC steganographic compression code by a method of information steganography and tamper detection based on the AMBTC compression code. This process can be executed by the sender and the generated AMBTC steganographic compression code is sent to the receiver.

[0073] Therefore, based on the same inventive concept, in an embodiment of the present invention, an information decoding and tamper detection system based on the AMBTC compression code can be further provided. After receiving the AMBTC steganographic compression code generated by the sender according to the information steganography method of the AMBTC compression code described in the above steps S1 to S4, the decoding and detection system extracts the verification information embedded in the bitmap of each image block by using the inverse process of the matrix coding algorithm, verifies the data integrity, and reconstructs the AMBTC compressed image. The overall steganography, decoding, and integrity verification process between the sender and the receiver is as Figure 2 shown. Figure 3 Shows an exemplary original image, the corresponding AMBTC compressed image, and the AMBTC steganographic compressed image.

[0074] In step S5 of this embodiment, the specific method for the decoding system to extract the verification information, verify the data integrity, and reconstruct the AMBTC compressed image is as follows:

[0075] S51: After receiving the AMBTC steganographic compression code, the decoding and detection system cuts it into segments of 32 bits each. Each segment represents an image block, which contains a 16-bit bitmap, an 8-bit high value, and an 8-bit low value. The 16-bit bitmap is cut into three parts, namely a 7-bit first part, a 7-bit second part, and a 2-bit third part. The third part of the bitmap is connected with the high value and the low value to form an 18-bit data, and then this 18-bit data and the steganographic key are input into a preset hash function to generate 6-bit information to be verified.

[0076] S52: Using the same scrambling key as in S31 as the seed, perform pseudo-random scrambling mapping pairing on all the image blocks segmented from the original image to restore the one-to-one mapping pairing relationship formed between all the image blocks. Similarly, in this step, the indexes of all the image blocks can also be input, and the pseudo-random scrambling is performed on all the indexes using the scrambling key as the seed. The scrambled index sequence is equally divided into two subsequences, and then the image block indexes at the same positions in the two subsequences are paired, so that every two indexes form a group of mapping pairing relationships to establish the pairing between the image blocks.

[0077] S55: Traverse all the image blocks obtained by cutting in the AMBTC steganographic compression code. For each current image block during the traversal, according to the restored mapping pairing relationship, determine the paired image block of the current image block. Take the first part and the second part of the bitmap of the paired image block as the second vectors respectively. Using the matrix encoding algorithm, multiply the parity check matrix of size 3×7 with the two second vectors respectively to decode and obtain two 3-bit verification messages m′, and combine the two verification messages into a 6-bit verification message. The decoding formula for calculating the verification message in the matrix encoding algorithm can be expressed as follows:

[0078] m′ = Hv′

[0079] S56: For each image block, match the verification message to be verified obtained in S51 with the verification message obtained in S53. If they are exactly the same, it is considered that the mapping pairing relationship between the image block and the paired image block has not been tampered with. If there is an inconsistency, it is considered that the mapping pairing relationship between the image block and the paired image block has been tampered with, and it can be marked as the tampering position. After traversing the complete compression code, the parts with abnormal data integrity can be detected.

[0080] S57: If all the image blocks have not been tampered with, perform image reconstruction according to the AMBTC algorithm to obtain the original image. It should be noted that the image reconstruction in this step adopts the original reconstruction method of AMBTC, that is, covering the pixels with bitmap 1 with high values and covering the pixels with bitmap 0 with low values to complete the reconstruction of the AMBTC compressed image, which belongs to the prior art and will not be elaborated here.

[0081] The method proposed by the present invention realizes an extremely high detection rate and a zero false alarm rate by steganographically embedding the verification message into the local bitmap of the AMBTC compression code.

[0082] It should be further noted that those skilled in the art can clearly understand that for the convenience and conciseness of description, the specific working process of the system described above can refer to the corresponding process in the foregoing method embodiments, and will not be elaborated herein. In the embodiments provided in the present application, the division of steps or modules in the system and method is only a logical function division, and there may be other division methods in actual implementation. For example, multiple modules or steps can be combined or integrated together, and a module or step can also be split.

[0083] To further illustrate the technical effects of the present invention, the experimental results of the proposed method are specifically shown through specific data sets below. As shown in Table 2, this embodiment mainly evaluates the visual quality indicators peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). In the experiment, it is defined that an attack of 100 bits is a mild attack, an attack of 1000 bits is a moderate attack, and an attack of 10000 bits is a severe attack. The experimental results show that the bit-level attack has a small impact on the visual quality, and with the increase of the attack intensity, PSNR and SSIM only decrease slightly. Although the attack will introduce a certain degree of distortion, the main content of the image is still retained, as Figure 4 shown.

[0084] Table 2 Visual quality evaluation of the present invention under different attack intensities.

[0085]

[0086]

[0087] As shown in Table 3, this embodiment evaluates the integrity verification ability. Under the mild attack intensity, the detection rate of the present invention for all test images reaches 100%; under other attack intensities, the detection rate is also close to 100%. At the same time, the false alarm rate is 0% and the accuracy is 100%. It should be noted that in the actual application scenario, as long as the detection rate is greater than 0, it can be determined that the compressed code has been tampered with. The detection rate is used to represent the specific position effect of tampering detection, rather than the probability of successful tampering detection. The present invention achieves a detection rate close to 100% and reaches a zero false alarm rate.

[0088] Table 3 Integrity verification evaluation of the present invention under different intensity attacks.

[0089]

[0090]

[0091] It can be seen that in the method of the present invention, the original image is pre-processed by AMBTC compression to generate an AMBTC compression code, and the verification information is embedded into the AMBTC compression code. During decoding, verification is required. Only when the verification information completely matches can the data integrity be confirmed. Different from the traditional method which mainly focuses on AMBTC compressed images, the present invention focuses on the processing of AMBTC compression codes for bit-level applications and has significant advantages. The experimental results show that the present invention can effectively detect tampering attacks of different degrees, has an extremely high detection rate, and at the same time achieves a zero false alarm rate.

[0092] Similarly, based on the same inventive concept, the present invention provides a computer program product, including a computer program / instructions, which when executed by a processor, can implement the information steganography method based on AMBTC compression codes as described above, or implement the information decoding and tampering detection system based on AMBTC compression codes as described above.

[0093] In addition, when the logical instructions in the above-mentioned memory are implemented in the form of software functional units and sold or used as an independent product, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention.

[0094] Therefore, based on the same inventive concept, the present invention provides a computer-readable storage medium corresponding to the information steganography method based on AMBTC compression codes. A computer program is stored on the storage medium, and when the computer program is executed by a processor, it can implement the information steganography method based on AMBTC compression codes as described above, or implement the information decoding and tampering detection system based on AMBTC compression codes as described above.

[0095] Therefore, based on the same inventive concept, as Figure 5 shown, the present invention also provides a computer electronic device corresponding to the information steganography method based on AMBTC compression codes provided in the above embodiment, which includes a memory and a processor;

[0096] The memory is used to store a computer program;

[0097] The processor is used to, when executing the computer program, implement the information steganography method based on AMBTC compression codes as described above, or implement the information decoding and tampering detection system based on AMBTC compression codes as described above.

[0098] Specifically, in the computer-readable storage media of the above three embodiments, the stored computer program is executed by a processor, and the steps of S1 to S4 can be executed.

[0099] It can be understood that the above storage medium may include a random access memory (RAM), and may also include a non-volatile memory (NVM), such as at least one disk memory. At the same time, the storage medium may also be various media that can store program codes, such as a USB flash drive, a mobile hard disk, a magnetic disk, or an optical disc.

[0100] It can be understood that the above-mentioned processor may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

[0101] In addition, it should be noted that those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working process of the above-described system can refer to the corresponding process in the foregoing method embodiments, and will not be elaborated herein. In each of the embodiments provided in the present application, the division of steps or modules in the system and method is only a logical function division, and there may be other division methods in actual implementation. For example, multiple modules or steps can be combined or integrated together, and a module or step can also be split.

[0102] The above-described embodiments are only the preferred solutions of the present invention and are not used to limit the present invention. Those of ordinary skill in the technical field can still make various changes, substitutions, or improvements without departing from the spirit and scope of the claims of the present invention. Therefore, any technical solution obtained by equivalent substitution or equivalent transformation shall be regarded as falling within the protection scope of the present invention.

Claims

1. An information steganography method based on AMBTC compression code, characterized in that: The specific steps are as follows: S1: The original image is divided into 4×4 image blocks. Each image block is compressed using the AMBTC algorithm to generate a 32-bit compression code consisting of an 8-bit high value, an 8-bit low value, and a 16-bit bitmap. S2: For each image block, the 16-bit bitmap is sequentially cut into three parts, the sizes of the first part, the second part and the third part are 7 bits, 7 bits and 2 bits respectively, the third part is connected with the high value and the low value corresponding to the image block to form an 18-bit data, and is input into a hash function with the steganographic key as the seed to generate 6-bit verification information; S3: Using the scrambling key as a seed, perform pseudo-random scrambling mapping pairing on all image blocks segmented from the original image, and form a one-to-one mapping pairing relationship for all image blocks; S4: traverse all image blocks, and use a matrix coding algorithm to steganographically embed the verification information corresponding to the current image block into the first and second parts of the bitmap of the image block paired with the current image block mapping; after traversing and processing all image blocks, combine the 32-bit compressed codes corresponding to all image blocks with steganographic verification information in sequence, and finally generate an AMBTC steganographic compression code containing the verification information for tampering detection and image reconstruction.

2. The information steganography method based on AMBTC compression code according to claim 1 is characterized in that: The specific method of S3 is as follows: input the indexes of all image blocks, use the scrambling key as a seed to pseudo-randomly scramble all indexes, divide the scrambled index sequence into two subsequences, and then pair the image block indexes with the same position in the two subsequences, so that every two indexes form a mapping pairing relationship.

3. The information steganography method based on AMBTC compression code according to claim 1 is characterized in that: In S4, for each current image block in the traversal process, a specific method of embedding verification information using a matrix coding algorithm is as follows: S41: according to the mapping pairing relationship, split the 6-bit verification information of the paired image block of the current image block into two segments, each of which is 3 bits; use the first part and the second part of the bitmap of the current image block as two 7-bit first vectors respectively, and use a matrix coding algorithm to multiply a parity check matrix of size 3×7 by the two first vectors respectively to obtain two segments of 3-bit intermediate information, and then perform an XOR operation on the two segments of 3-bit verification information and the two segments of 3-bit intermediate information respectively to obtain two 3-bit comprehensive codes; S42: according to the two calculated composite codes, according to the matrix coding coset of the parity check matrix, respectively determine the coset leader corresponding to each composite code, perform an XOR operation on the first part and the second part in the bitmap of the current image block and the corresponding coset leader, respectively, so that 1 bit of each of the two parts is flipped, and a new first part and a new second part are obtained and replace the original first part and the second part in the bitmap, so as to steganographically write the verification information of the paired image block into the bitmap of the 32-bit compressed code of the current image block; S43: After completing the steganographic verification information of all image block compression codes, all 32-bit compression codes that have steganographic verification information are concatenated and combined to obtain an AMBTC steganographic compression code containing the verification information.

4. The information steganography method based on AMBTC compression code according to claim 1 is characterized in that: In the matrix coding coset of the parity check matrix, when the composite codes are 000, 001, 010, 011, 100, 101, 110, and 111, the corresponding coset heads are 0000000, 1000000, 0100000, 001000, 000100, 0000010, and 0000001 respectively.

5. An information decoding and tampering detection system based on AMBTC compression code, characterized in that: After receiving the AMBTC steganographic compression code generated by the sender according to the information steganography method based on AMBTC compression code as described in any one of claims 1 to 4, the detection system uses the inverse process of the matrix coding algorithm to extract the verification information embedded in the bitmap of each image block, verify the data integrity, and reconstruct the AMBTC compressed image.

6. The information decoding and tampering detection system based on AMBTC compression code according to claim 5 is characterized in that: In the detection system, the specific method of extracting verification information, verifying data integrity, and reconstructing the AMBTC compressed image is as follows: S51: After receiving the AMBTC steganographic compression code, the decoding detection system cuts it into segments of 32 bits each, each segment representing an image block, which includes a 16-bit bitmap, an 8-bit high value, and an 8-bit low value; the 16-bit bitmap is cut into three parts, namely a first part of 7 bits, a second part of 7 bits, and a third part of 2 bits, and the third part of the bitmap is connected with the high value and the low value to form 18-bit data, and then the 18-bit data is input into a preset hash function together with the steganographic key to generate 6 bits of information to be verified; S52: using the scrambling key as a seed, performing pseudo-random scrambling mapping pairing on all image blocks obtained by segmentation in the original image, and restoring the one-to-one mapping pairing relationship between all image blocks; S53: traverse all image blocks cut from the AMBTC steganographic compression code, use the first part and the second part of the bitmap of the image block mapped to the current image block as the second vector respectively, use the matrix coding algorithm to multiply the parity check matrix of size 3×7 by the two second vectors respectively to decode and obtain two 3-bit verification information, and combine the two verification information into one 6-bit verification information; S54: For each image block, the information to be verified obtained in S51 is matched with the verification information obtained in S53. If they are completely consistent, it is considered that the mapping pairing relationship between the image block and the paired image block has not been tampered with. If there is inconsistency, it is considered that the mapping pairing relationship between the image block and the paired image block has been tampered with. S55: If all image blocks have not been tampered with, the image is reconstructed according to the AMBTC algorithm to obtain the original image.

7. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instruction is executed by the processor, it can implement the information steganography method based on AMBTC compression code as described in any one of claims 1 to 4.

8. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instruction is executed by the processor, it can implement the information decoding and tampering detection system based on AMBTC compression code as described in any one of claims 4 or 5.

9. A computer-readable storage medium, characterized in that: A computer program is stored on the storage medium. When the computer program is executed by the processor, it implements the information steganography method based on the AMBTC compression code as described in any one of claims 1 to 4, or implements the information decoding and tampering detection system based on the AMBTC compression code as described in claim 5 or 6.

10. A computer electronic device, characterized in that: including memory and processor; The memory is used to store computer programs; The processor is used to implement the information steganography method based on AMBTC compression code as described in any one of claims 1 to 3, or to implement the information decoding and tampering detection system based on AMBTC compression code as described in claim 5 or 6 when executing the computer program.

Images