# Data Hiding Based on Mini Program Code

Authors: Jia Chen; Quankai Qi; Yongjie Wang; Xuehu Yan; Longlong Li
Journal: Security and Communication Networks
 (2021)

---

## Abstract

A mini program code (also known as sunflower code) comes with WeChat mini program APPs. With the popularization of mini program APPs, mini program codes have become more and more widely used. As a new carrier, the study of information hiding technology based on mini program code is of great significance for the expansion of covert communication carriers and can also deal with security problems in advance. At present, to the best of our knowledge, there is no steganographic research based on mini program codes. In this paper, we propose a scheme to embed secret information into mini program codes for the first time. After studying the construction of mini program codes, a coordinate system is constructed to represent its module coordinates. Then, a binary stream of the secret message is embedded into the encoding region or the edge patch. Experiments show that the proposed data hiding scheme is effective and feasible. The embedded secret message could be extracted while keeping the readability of the mini program code. Moreover, the secret payloads of the encoding region and the edge patch for the V-36 mini program code are 72 bits and 29 bits, respectively.


---

## Body

## 1. Introduction

A mini program code comes with a WeChat mini program app [1]. Mini programs are “miniapplications” built within the WeChat platform. They are instantly loaded and easy to use. WeChat allows third party to develop mini programs and bundle features and capabilities into a single native mobile App. WeChat mini programs provide convenient life services, such as public welfare, online shopping, tourism transportation, and other fields. WeChat mini program relies on WeChat, a super App with about one billion users. Since its launch on 9 January, 2017, it has attracted much attention. By July 2020, there are more than 3.2 million WeChat mini programs, with more than 410 million daily active users and 8.5 daily use per person [2]. Meanwhile, the mini program code is also more and more popular with the widespread mini programs. After the WeChat mini program was used, Alipay and Baidu also developed their mini programs. In this paper, mini program codes refer to WeChat mini program codes unless otherwise stated.The purpose of covert communication is to transmit secret information between two parties and prevent it from being intercepted by malicious eavesdroppers. As a new carrier, the study of information hiding technology based on mini program codes is of great significance for the expansion of new covert communication. Moreover, the mini program code is a barcode. At present, the security of mini program codes has not been reported, but lots of barcode security problems have been exposed. Especially, with the widespread use of QR codes, its security issues have gradually been paid attention to, such as information leakage and embedded malicious links. Therefore, the study of information hiding technology based on mini program codes can also deal with security problems in advance.Image steganography is the technique of hiding secret information in an image. The common image steganography methods fall into two categories. The first category is in the spatial domain, and the most common method is based on the modification of least significant bit (LSB) [3]. LSB replaces image pixels with bits of secret message. Luo et al. [4] propose the LSB matching method, where the data is hidden in the edges. The other category is in the frequency domain. The secret message is hidden into the transform coefficients. There are some common techniques to obtain those coefficients, such as discrete cosine transform (DCT), discrete wavelet transform (DWT), and Fresnelet transform (FT). Chang et al. [5] propose a reversible data hiding scheme where secret messages are embedded into DCT coefficients, and Lin [6] proposes reversible data hiding in the DCT coefficient using a histogram shifting method. Other methods of information hiding, such as reversible data hiding (RDH) in images and reversible image secret sharing (RISS), are also being studied widely. Sun et al. [7] propose a reversible data hiding scheme for encrypted color halftone images. Yan et al. [8] propose a RISS algorithm for a (k, n) -threshold based on the Chinese remainder theorem-based ISS (CRTISS). Yan et al. [9] fuse the advantages of polynomial-based image secret sharing and visual secret sharing to design a common method of share authentication in image secret sharing.With the further study of QR codes, more and more secret hiding schemes based on QR codes are proposed. These schemes also can be divided into two categories. The first category is to hide the secret message by redesigning the QR module pattern. Teraura and Sakurai [10] propose a scheme in which the QR code modules are segmented into different submodules with a size of 3×3 or 5×5. Then, secret message bits are hidden in the outer of the submodules’ pattern. The other category is to hide the secret message in the data module directly by sacrificing the error correction capacity of QR codes. Chiang et al. [11] propose a steganographic method to hide the secret message in the QR code. The Wet Paper Codes’ algorithm is applied in this method. They replace the dry modules of the QR code with the secret message bits. Recently, some novel steganography schemes based on QR codes have been proposed. Pan et al. [12] propose a new image steganography algorithm hiding secret messages into an innovative embedding domain by combining compressive sensing with subsampling. Moreover, the combination of information hiding and secret sharing based on QR codes has been proposed. Wang et al. [13] propose a visual secret-sharing scheme (VSSS) with (k, n)-threshold based on QR codes. In the processing of encoding QR code, the bits corresponding to shares generated by VSS from a secret bit are embedded into the same locations of QR codes. Tan et al. [14] propose an XVSS scheme based on the QR code. The bits of shadows are embedded into the pad code words of QR codes. Cheng et al. [15] propose a VSSS to encode a secret QR code into several valid QR codes. These codes can be decoded by a standard QR code reader; meanwhile, the secret messages are recovered by XOR operation.To expand the carrier in covert communication, there are currently some steganography schemes based on new carriers [16, 17]. As a new carrier of mini program code, it is necessary to study the data-hiding scheme based on it. Steganography based on mini program codes is different from the common image steganography. A mini program code is an image, but the code should be able to be decoded successfully after embedding secret messages. Although steganography based on QR codes also requires to be decoded successfully, the mini program codes are more difficult to implement information hiding than QR codes. The module distribution of mini program codes is more restricted than QR codes. The angles between the rays on mini program codes and the module distribution on each ray are specified. That is to say, there are more stringent restrictions on embedding secret messages. Meanwhile, WeChat mini program apps are only used in WeChat, and the mini program source code is not open. Therefore, we do not know about the coding method, codeword distribution, or encryption method of mini program code. We can only rely on the WeChat scanner to decode instead of designing the decoding program according to our needs. At present, no research has been conducted on data hiding based on mini program codes.In this paper, to expand the carrier in covert communication and deal with the security problem based on mini program codes in advance, we propose a novel data-hiding scheme based on mini program codes for the first time. First, we study the function and construction of each pattern of mini program codes. Then, we construct a coordinate system to represent the module coordinates. Finally, we replace the modules with secret messages. Moreover, the secret payload of the hiding scheme is tested. Experimental results validate the effectiveness of our scheme.The contributions of our work are summarized as follows.(1)
Relevant theories on mini program codes are studied to provide experience for scheme design and follow-up research(2)
We propose the data-hiding scheme based on mini program codes for the first time(3)
We test the secret payload of the data-hiding scheme based on mini program codesThe rest of this paper is organized as follows. In Section2, we introduce the function and construction of mini program codes. The proposed scheme is described in Section 3. Section 4 gives experimental results for validating the proposed scheme. Finally, conclusions are drawn in Section 5.


## 2. Preliminaries

A module is the smallest unit of data storage in the mini program code, representing 1 bit, and one code word has 8 bits. There are three different versions of mini program codes: 36 rays, 54 rays, and 72 rays, named V-36, V-54, and V-72, respectively. As the code of V-36 is used widely, the research of this paper is mainly on the V-36 mini program codes. All the modules are evenly distributed over these rays. Figure1 shows the three versions.Figure 1
Three versions of mini program codes.
(a)(b)(c)In Figure2, there are four functional patterns, two logo areas, and an encoding region in a mini program code. The isosceles right triangle distribution of the three finder patterns is conducive to detection. Finder patterns contain numerical information about the rays. The version information pattern consists of error correction level and mask. And, modules of the version information pattern can correct themselves. The contour patch highlights the logo shape and separates the user logo area from the encoding region. The official logo area not only indicates what platform the mini program is based on but also assists in detection. To be detected from all directions and decoded successfully, these patterns must be placed in the corresponding area without errors. Of course, some patterns can be modified within a certain range without affecting the normal decoding. The user logo area improves the accessibility of the mini program code. It is easy to see what the app is at a glance. The edge patch is the outermost module of the ray, which does not carry any information and is only used to outline the pattern. The encoding region consists of data and error correction code words.Figure 2
The structure of a V-36 mini program code.When the mini program code is used, it may have some interference, such as dirt, cropping, and fouling. So, the Reed–Solomon (RS) code is applied to correct errors in mini program codes. These error correction code words correct errors and recover data. Table1 lists error correction capabilities of standard mini program codes in four levels. Corresponding to different versions, error correction levels, and different character sets, the data and error correction code words are different. A mini program code version with a lower error correction level has more data capacity. Table 2 shows the maximum encoding capacity under different conditions [18]. As the number of rays increases, so does the maximum encoding capacity, regardless of error correction levels.Table 1
Error correction levels and their durability.
Error correction levelData recovery capability (%)L10M15Q25H35Table 2
Maximum encoding capacity.
Version levelData modesNumericAlphanumeric8 bit byteV-36L633225M552922Q432217H291511V-54L874435M794132Q582923H432217V-72L1065443M964939Q723729H532721When the input messages are encoded, the data are first converted into a bit stream. Then, error correction codes are added to get the final bitstream. Next, the bitstream are padded in the encoding region according to the rule that the white and black modules represent “0” and “1,” respectively. To avoid the sparsity of black modules, one of 32 data mask patterns is selected to mask the encoding area after encoding all the code words.Like QR codes, mini program codes are encoded using error correction mechanisms that allow errors to occur during decoding. Meanwhile, mini program codes are decoded by reading the pixel value of each module in turn. Each module is judged to be a binary digit of either “1” or “0” by a certain threshold. Based on the analysis of QR code information hiding technology, we can apply relevant principles to mini program codes and then design a data-hiding scheme based on mini program codes.


## 3. The Proposed Scheme

The proposed data-hiding scheme for mini program codes can be split into a secret embedding procedure and an extraction procedure.


### 3.1. Embedding Procedure

Given a mini program code, secret messageS, and random seed k, the proposed scheme embeds the secret message S into the encoding region or the edge patch of the mini program code and retains the remaining patterns unmodified. The embedding process is given in Algorithm 1.Algorithm 1: The embedding procedure.
Input: a cover code, secret message S, and random seed kOutput: a marked code with the secret message and the length n of the secret messageStep 1: determine the center cx,cy of the mini program code and the length lcw of each moduleStep 2: establish a coordinate system and store module coordinates Px,y of encoding region in an arrayStep 3: convert the secret message S into a binary stream and compute its length n: n=lenBinS.Step 4: choose the embedded region based on the secret length n, and determine the module to start modification according to the random number generated by random seed kStep 5: replace modules with BinS from the start modification module continuouslyStep 6: repeat Step 5 until all the bits are hidden in the cover codeBy modifying mini program code modules, the secret messages can be embedded. Meanwhile, the marked code could be decoded successfully when the embedding capacity is within the error correction capability.


### 3.2. Extraction Procedure

In the extraction procedure in Algorithm2, the receiver can recover the secret message S from the marked code according to the random seed k by our extract program.Algorithm 2: The extraction procedure.
Input: a marked code with the secret message S, the length n of the secret message S, and random seed kOutput: the secret messages SStep 1: determine the center cx,cy of the mini program code and the length lcw of each moduleStep 2: establish a coordinate system and store module coordinates Px,y of encoding region in an arrayStep 3: determine the embedded region and the start modification module based on n and the random number generated by random seed kStep 4: read the module pixel of the marked code from the start modification module; if the module is white, the secret message is 0; otherwise, it is 1Step 5: repeat step 4 until all the secret bits have been extracted


### 3.3. Specific Implementation

#### 3.3.1. Determine Center and Module Segmentation

Looking at mini program code visually, the code blooms from inside to outside like a sunflower, and all modules are evenly distributed over each ray. The first thing is to determine the centercx,cy of the mini program code and the length lcw of the module. We adopt the Hough transform [19] to detect the circle. For a given cover code, by setting the radius range of the detection circle, the radii and centers of three finder patterns and the official logo area can be obtained and represented by c1x,c1y,rf1, c2x,c2y,rf2, c3x,c3y,rf3, and c4x,c4y,rol. According to the design in [18], cx,cy and lcw can be computed by equations (1) and (2), respectively:(1)cx,cy=c1x+c2x2,c1y+c3y2,(2)lcw=rol10.After obtaininglcw, we can draw concentric circles which start with the circle in the area of the user’s logo and take the center of the circle as the center and the length of the code word as the increasing radius. Thus, all the modules are segmented by the concentric circles, as shown in Figure 3.Figure 3
The diagram of (a) determine center and (b) module segmentation.
(a)(b)


#### 3.3.2. Establishing Coordinate System

To conveniently represent the position of each module, we need to establish a coordinate system and keep it consistent with the actual pixel coordinates. The positions of the modules can be determined by the number of rays and the order of modules on the rays. We start from the ray between the center of the user logo area and the center of the finder pattern in the upper right corner and then number of the rays counterclockwise.The established coordinate system has undergone four transformations. Figure4 shows the three transformations of the established coordinate system.Figure 4
Four transformations of the established coordinate system.First, we usePi,j to denote the module coordinates which represent the ith ray and the jth module on the ray.Second, we establish a coordinate system according to the location relationship among the three finder patterns to form an isosceles right triangle. Take the line between the center of the user logo area and the center of the finder pattern in the upper right corner asx′ axis and the line between the center of the user logo area and the center of the finder pattern in the upper left corner as y′ axis. Then, the coordinate of P in the coordinate system x′o′y′ is Px′,y′ computed by(3)x′=r+j∗lcw∗cosi∗θ,y′=r+j∗lcw∗sini∗θ.Then, the coordinate systemx′o′y′ is rotated by α radian clockwise to the coordinate system x″o′y″, where α=π/4. Px″,y″ can be obtained by(4)x″=x′cosα−y′sinα,y″=x′sinα+y′cosα.Finally, we translate the coordinate systemx″o′y″ to the upper left corner of the image xoy to keep xoy consistent with the actual pixel coordinates. Therefore, the final coordinate Px,y can be computed by equation.(5)x=x″+cx,y=cy−y″.


#### 3.3.3. Modified Strategy

To better embed the secret message, we formulate a modified strategy to choose the embedded region and decide how to embed it. First, the embedded area is determined by the lengthn of the secret message and the number ne of modules in the edge patch of each version of the mini program code. As ne is fixed, if n>ne, the secret message should be embedded in the encoding region or the combination of the encoding region and the edge patch. When n≤ne, we can choose the encoding region or the edge patch to embed.Then, we choose direct substitution to embed the secret message. This is to replace the modules withBinS. The black and white modules represent binary digits “1” and “0,” respectively. As we can see, the mini program code is composed of several circular modules. Some continuous circular modules are joined into a thick line. When we choose a module to modify, we need to consider the situation of the two modules before and after this one on the ray-whether they are independent modification circles or whether they need to be connected into a thick line. Specifically, if the black module needs to be modified to white, there are four cases shown in Table 3, and so for the case where the white module is modified to a black module.Table 3
Four cases of the module for “1” needs to be “0.”
CaseCover codeMarked codeBitsModulesBitsModules1(1, 1, 1)(1, 0, 1)2(0, 1, 1)(0, 0, 1)3(1, 1, 0)(1, 0, 0)4(0, 1, 0)(0, 0, 0)—Note: represents the modified module.


### 3.4. Capacity Analyses

The embedding capacity of a secret message depends on many factors. When we use a module or a pixel value in a module to represent a bit of the message, the embedding capacity is different. Moreover, the size of the image and secret message encoding method also affects the embedding capacity. Essentially, the embedding capacity is related to the number of modules available to be modified in the mini program code. In the structure of the mini program code, the RS error correction algorithm is employed. The encoding region consists of data code words and error correction code words by using the RS code. From Chen [20], we could know that there may be 20 code words in the data area and 18 code words in the error correction area in the V-36 mini program code. According to the error correction principle of RS error correction code, two RS error correction code words can correct one code word error [21]. Therefore, in the V-36 mini program code, 18 error correction code words can correct 9 code words. That is to say, we could embed up to 9 code words of secret messages. In this scheme, modules in the region area are directly replaced to embed information without data encoding. This is the simplest embedding method which can only deal with general noise interference. The secret message could not be recovered for interference, such as dirt, cropping, and fouling, in the scheme.


## 3.1. Embedding Procedure

Given a mini program code, secret messageS, and random seed k, the proposed scheme embeds the secret message S into the encoding region or the edge patch of the mini program code and retains the remaining patterns unmodified. The embedding process is given in Algorithm 1.Algorithm 1: The embedding procedure.
Input: a cover code, secret message S, and random seed kOutput: a marked code with the secret message and the length n of the secret messageStep 1: determine the center cx,cy of the mini program code and the length lcw of each moduleStep 2: establish a coordinate system and store module coordinates Px,y of encoding region in an arrayStep 3: convert the secret message S into a binary stream and compute its length n: n=lenBinS.Step 4: choose the embedded region based on the secret length n, and determine the module to start modification according to the random number generated by random seed kStep 5: replace modules with BinS from the start modification module continuouslyStep 6: repeat Step 5 until all the bits are hidden in the cover codeBy modifying mini program code modules, the secret messages can be embedded. Meanwhile, the marked code could be decoded successfully when the embedding capacity is within the error correction capability.


## 3.2. Extraction Procedure

In the extraction procedure in Algorithm2, the receiver can recover the secret message S from the marked code according to the random seed k by our extract program.Algorithm 2: The extraction procedure.
Input: a marked code with the secret message S, the length n of the secret message S, and random seed kOutput: the secret messages SStep 1: determine the center cx,cy of the mini program code and the length lcw of each moduleStep 2: establish a coordinate system and store module coordinates Px,y of encoding region in an arrayStep 3: determine the embedded region and the start modification module based on n and the random number generated by random seed kStep 4: read the module pixel of the marked code from the start modification module; if the module is white, the secret message is 0; otherwise, it is 1Step 5: repeat step 4 until all the secret bits have been extracted


## 3.3. Specific Implementation

### 3.3.1. Determine Center and Module Segmentation

Looking at mini program code visually, the code blooms from inside to outside like a sunflower, and all modules are evenly distributed over each ray. The first thing is to determine the centercx,cy of the mini program code and the length lcw of the module. We adopt the Hough transform [19] to detect the circle. For a given cover code, by setting the radius range of the detection circle, the radii and centers of three finder patterns and the official logo area can be obtained and represented by c1x,c1y,rf1, c2x,c2y,rf2, c3x,c3y,rf3, and c4x,c4y,rol. According to the design in [18], cx,cy and lcw can be computed by equations (1) and (2), respectively:(1)cx,cy=c1x+c2x2,c1y+c3y2,(2)lcw=rol10.After obtaininglcw, we can draw concentric circles which start with the circle in the area of the user’s logo and take the center of the circle as the center and the length of the code word as the increasing radius. Thus, all the modules are segmented by the concentric circles, as shown in Figure 3.Figure 3
The diagram of (a) determine center and (b) module segmentation.
(a)(b)


### 3.3.2. Establishing Coordinate System

To conveniently represent the position of each module, we need to establish a coordinate system and keep it consistent with the actual pixel coordinates. The positions of the modules can be determined by the number of rays and the order of modules on the rays. We start from the ray between the center of the user logo area and the center of the finder pattern in the upper right corner and then number of the rays counterclockwise.The established coordinate system has undergone four transformations. Figure4 shows the three transformations of the established coordinate system.Figure 4
Four transformations of the established coordinate system.First, we usePi,j to denote the module coordinates which represent the ith ray and the jth module on the ray.Second, we establish a coordinate system according to the location relationship among the three finder patterns to form an isosceles right triangle. Take the line between the center of the user logo area and the center of the finder pattern in the upper right corner asx′ axis and the line between the center of the user logo area and the center of the finder pattern in the upper left corner as y′ axis. Then, the coordinate of P in the coordinate system x′o′y′ is Px′,y′ computed by(3)x′=r+j∗lcw∗cosi∗θ,y′=r+j∗lcw∗sini∗θ.Then, the coordinate systemx′o′y′ is rotated by α radian clockwise to the coordinate system x″o′y″, where α=π/4. Px″,y″ can be obtained by(4)x″=x′cosα−y′sinα,y″=x′sinα+y′cosα.Finally, we translate the coordinate systemx″o′y″ to the upper left corner of the image xoy to keep xoy consistent with the actual pixel coordinates. Therefore, the final coordinate Px,y can be computed by equation.(5)x=x″+cx,y=cy−y″.


### 3.3.3. Modified Strategy

To better embed the secret message, we formulate a modified strategy to choose the embedded region and decide how to embed it. First, the embedded area is determined by the lengthn of the secret message and the number ne of modules in the edge patch of each version of the mini program code. As ne is fixed, if n>ne, the secret message should be embedded in the encoding region or the combination of the encoding region and the edge patch. When n≤ne, we can choose the encoding region or the edge patch to embed.Then, we choose direct substitution to embed the secret message. This is to replace the modules withBinS. The black and white modules represent binary digits “1” and “0,” respectively. As we can see, the mini program code is composed of several circular modules. Some continuous circular modules are joined into a thick line. When we choose a module to modify, we need to consider the situation of the two modules before and after this one on the ray-whether they are independent modification circles or whether they need to be connected into a thick line. Specifically, if the black module needs to be modified to white, there are four cases shown in Table 3, and so for the case where the white module is modified to a black module.Table 3
Four cases of the module for “1” needs to be “0.”
CaseCover codeMarked codeBitsModulesBitsModules1(1, 1, 1)(1, 0, 1)2(0, 1, 1)(0, 0, 1)3(1, 1, 0)(1, 0, 0)4(0, 1, 0)(0, 0, 0)—Note: represents the modified module.


## 3.3.1. Determine Center and Module Segmentation

Looking at mini program code visually, the code blooms from inside to outside like a sunflower, and all modules are evenly distributed over each ray. The first thing is to determine the centercx,cy of the mini program code and the length lcw of the module. We adopt the Hough transform [19] to detect the circle. For a given cover code, by setting the radius range of the detection circle, the radii and centers of three finder patterns and the official logo area can be obtained and represented by c1x,c1y,rf1, c2x,c2y,rf2, c3x,c3y,rf3, and c4x,c4y,rol. According to the design in [18], cx,cy and lcw can be computed by equations (1) and (2), respectively:(1)cx,cy=c1x+c2x2,c1y+c3y2,(2)lcw=rol10.After obtaininglcw, we can draw concentric circles which start with the circle in the area of the user’s logo and take the center of the circle as the center and the length of the code word as the increasing radius. Thus, all the modules are segmented by the concentric circles, as shown in Figure 3.Figure 3
The diagram of (a) determine center and (b) module segmentation.
(a)(b)


## 3.3.2. Establishing Coordinate System

To conveniently represent the position of each module, we need to establish a coordinate system and keep it consistent with the actual pixel coordinates. The positions of the modules can be determined by the number of rays and the order of modules on the rays. We start from the ray between the center of the user logo area and the center of the finder pattern in the upper right corner and then number of the rays counterclockwise.The established coordinate system has undergone four transformations. Figure4 shows the three transformations of the established coordinate system.Figure 4
Four transformations of the established coordinate system.First, we usePi,j to denote the module coordinates which represent the ith ray and the jth module on the ray.Second, we establish a coordinate system according to the location relationship among the three finder patterns to form an isosceles right triangle. Take the line between the center of the user logo area and the center of the finder pattern in the upper right corner asx′ axis and the line between the center of the user logo area and the center of the finder pattern in the upper left corner as y′ axis. Then, the coordinate of P in the coordinate system x′o′y′ is Px′,y′ computed by(3)x′=r+j∗lcw∗cosi∗θ,y′=r+j∗lcw∗sini∗θ.Then, the coordinate systemx′o′y′ is rotated by α radian clockwise to the coordinate system x″o′y″, where α=π/4. Px″,y″ can be obtained by(4)x″=x′cosα−y′sinα,y″=x′sinα+y′cosα.Finally, we translate the coordinate systemx″o′y″ to the upper left corner of the image xoy to keep xoy consistent with the actual pixel coordinates. Therefore, the final coordinate Px,y can be computed by equation.(5)x=x″+cx,y=cy−y″.


## 3.3.3. Modified Strategy

To better embed the secret message, we formulate a modified strategy to choose the embedded region and decide how to embed it. First, the embedded area is determined by the lengthn of the secret message and the number ne of modules in the edge patch of each version of the mini program code. As ne is fixed, if n>ne, the secret message should be embedded in the encoding region or the combination of the encoding region and the edge patch. When n≤ne, we can choose the encoding region or the edge patch to embed.Then, we choose direct substitution to embed the secret message. This is to replace the modules withBinS. The black and white modules represent binary digits “1” and “0,” respectively. As we can see, the mini program code is composed of several circular modules. Some continuous circular modules are joined into a thick line. When we choose a module to modify, we need to consider the situation of the two modules before and after this one on the ray-whether they are independent modification circles or whether they need to be connected into a thick line. Specifically, if the black module needs to be modified to white, there are four cases shown in Table 3, and so for the case where the white module is modified to a black module.Table 3
Four cases of the module for “1” needs to be “0.”
CaseCover codeMarked codeBitsModulesBitsModules1(1, 1, 1)(1, 0, 1)2(0, 1, 1)(0, 0, 1)3(1, 1, 0)(1, 0, 0)4(0, 1, 0)(0, 0, 0)—Note: represents the modified module.


## 3.4. Capacity Analyses

The embedding capacity of a secret message depends on many factors. When we use a module or a pixel value in a module to represent a bit of the message, the embedding capacity is different. Moreover, the size of the image and secret message encoding method also affects the embedding capacity. Essentially, the embedding capacity is related to the number of modules available to be modified in the mini program code. In the structure of the mini program code, the RS error correction algorithm is employed. The encoding region consists of data code words and error correction code words by using the RS code. From Chen [20], we could know that there may be 20 code words in the data area and 18 code words in the error correction area in the V-36 mini program code. According to the error correction principle of RS error correction code, two RS error correction code words can correct one code word error [21]. Therefore, in the V-36 mini program code, 18 error correction code words can correct 9 code words. That is to say, we could embed up to 9 code words of secret messages. In this scheme, modules in the region area are directly replaced to embed information without data encoding. This is the simplest embedding method which can only deal with general noise interference. The secret message could not be recovered for interference, such as dirt, cropping, and fouling, in the scheme.


## 4. Experiment and Evaluation

In this section, some experiments are conducted to verify the feasibility and effectiveness of the proposed scheme. Two examples are given in Section4.1 to evaluate the practicability of the proposed scheme. To determine the type of modification, noise experiments are performed in Section 4.2. The secret payload of the proposed scheme is tested in Section 4.3. In Section 4.4, a subjective evaluation method is used to test the effectiveness of our scheme.


### 4.1. Examples of the Proposed Scheme

Through the above analysis, a secret message could be embedded in the edge patch and the encoding region by the proposed scheme. Two examples are given in Python to evaluate the practicability of the proposed scheme. The cover image is a V-36 mini program code of WeChat open class. The image size is512×512 pixels. When the length of the secret message is less than 29 bits, both edge patch and encoding region can be selected to embed. The secret message is the string “NUDT,” and its ASCII value is converted into a binary stream. The binary stream of the cover image is obtained by reading the code words in the embedded area sequentially.The binary streams of the secret message and the edge patch are shown as follows:(1001110101010110001001010100)(1010111101011010010001011110)The binary streams of the secret message and the encoding region are shown as follows:(1001110101010110001001010100)(0101111100001010010011111101)Figure5 shows two examples of the proposed scheme, where Figures 5(a)–5(d) show the process of embedding the secret message in edge patch and Figures 5(e)–5(h) show the process in the encoding region. Figures 5(a) and 5(e) are the cover images. The green circles in Figures 5(b) and 5(f) are the positions to embed the secret message. The embedded results are shown in Figures 5(c) and 5(g). From the binary stream, we can see how many bits are different between the secret message and the embedded area marked in bold. Also, the red circles in Figures 5(d) and 5(h) represent the modified positions.Figure 5
Two examples of the proposed scheme. (a) Cover image. (b) Embedding position. (c) Marked image. (d) Modified position. (e) Cover image. (f) Embedding position. (g) Marked image. (h) Modified position.
(a)(b)(c)(d)(e)(f)(g)(h)Both of the marked images in the example could be decoded by the WeChat scanner, and then, navigate into the mini program. The user will not notice its difference because it can be decoded and used normally. However, we can extract the secret message by reading the modules in the embedded area sequentially with our program. Through these two examples, we verify that both the edge patch and the encoding region could embed the secret message.


### 4.2. Modified-Type Test

In this section, noise experiments are performed to determine the type of modification. To perform a series of experiments based on the mini program code, we randomly collect 51 mini program codes from the Internet as a database. The decoding exception of a mini program code is defined as (i) the mini program code cannot be decoded correctly, (ii) the speed of decoding the code is slower than normal, and (iii) the scanner needs to be tilted to decode successfully.According to the analysis of the function patterns of the mini program codes, we find that the secret message could be embedded in the edge patch and the encoding region. Although we suspect that mini program codes may use the RS code to encode data, we do not know in what order the code words are arranged. Therefore, according to the effect of noise on decoding, we divide the noise into scattered point-like noise and continuous line-like noise. Furthermore, two modified types correspond to these two types of noise, namely, random average embedding (RAE) and continuous area embedding (CAE). RAE means that the modules on each ray have an equal chance to be modified. CAE is to modify the code words on the ray continuously.For RAE, we test three modifications of 10, 15, and 20 points. As for CAE, we also test three modifications of 3, 5, and 7 lines. Each line contains4∼6 consecutive points. Taking the mini program code of WeChat open class as an example, six modification versions are shown in Figure 6. Fifty-one mini program codes are tested separately, and the normal decoding rates (NDR) of six modification versions are calculated.Figure 6
Six modification versions of embedding. (a) 10 points. (b) 15 points. (c) 20 points. (d) 3 lines. (e) 5 lines. (f) 7 lines.
(a)(b)(c)(d)(e)(f)As we can see from the results in Table4, when we choose CAE, even if we modify the modules with 5 lines, which is approximately 20∼30 bits, the normal decoding rate is still 100%. With the same embedding capacity, when we modify 20 points, the normal decoding rate can only reach 44.83% by using RAE. Therefore, to improve the embedding capacity and ensure a high normal decoding rate, we choose CAE as the modified type.Table 4
The normal decoding rates of six modification versions.
RAE10 points15 points20 pointsNDR100%72.41%44.83%CAE3 lines5 lines7 linesNDR100%100%62.07%


### 4.3. The Secret Payload of the Proposed Scheme

In this section, we test the secret payload of the proposed scheme. First, according to the analysis of the function of patterns, the edge patch is used to make the appearance of the mini program code more harmonious. The modules in the edge patch have no concrete meaning. Therefore, we flip all bits in the edge patch to test the capacity. If the mini program code could be decoded normally, all bits in the edge patch can be modified. The edge patches of 51 mini program codes of the database are tested, and all codes are decoded correctly. There are 29 bits in the edge patch of the V-36 mini program code. Therefore, the embedding capacity of the edge patch is 29 bits.Secondly, we test the embedding capacity in the encoding region. At present, to the best of our knowledge, there is no official documentation on how to encode data into a mini program code. In Section4.2, we conclude that CAE should be adopted to embed secret messages. Observing the existing V-36 mini program code, we can find that there are 304 modules in the encoding region. And, according to the introduction of the mini program code in Chen [20], the encoding region is divided into two parts. There may be 160 bits in the data area and 144 bits in the error correction area. The data area is located in the top half of the mini program code, where the rays are sequenced from left to right, and the bits on each ray are encoded from inside to outside. The error correction area is located in the lower half of the mini program code followed by the data area and the error-correcting codes are encoded in the same order. All information about the data encoding method of mini program code is not officially confirmed, so we have to test our conjectures experimentally to design a secret message hiding scheme and obtain the secret payload.To obtain the maximum capacity of the encoding region, 51 mini program codes in the database are tested. Several experiments are designed on each code. We start with the first bit of the data area, and then, we continuously flip 56, 64, 72, and 80 bits. From the results in Table5, we can guess that the maximum capacity should be between 72 and 80 bits. Then, we flip the 73 or 74 continuous bits. The normal decoding rate drops significantly when the number of bits flipped switches from 72 to 73. Therefore, we can tentatively conclude that the maximum capacity is 72 bits. However, the normal decoding rate is not satisfactory when we flip 72 continuous bits from the second bit to the 73rd bit. Based on the above situation, we guess that the 8 bits of each code word are distributed continuously. According to the RS code, they have the same effect when we modify a bit and a byte. Through experiments with serial nos. 3∼19, we can determine that the embedding capacity is 9 code words and verify that every 8 continuous bits compose a code word.Table 5
The normal decoding rates of several experiments.
No.The range of bitsThe case of bytesNDR (%)11,567 bytes10021,648 bytes10031,729 bytes10041,8010 bytes0.0051,739 bytes + 1 bit27.4561,749 bytes + 2 bits3.9272,737 bits + 8 bytes + 1 bit19.6188,731 bit + 8 bytes + 1 bit70.5999,738 bytes + 1 bit100109,809 bytes100119,819 bytes + 1 bit15.691216,881 bit + 9 bytes66.671317,818 bytes + 1 bit1001417,889 bytes1001517,899 bytes + 1 bit68.631624,961 bit + 9 bytes56.861725,898 bytes + 1 bit1001825,969 bytes1001925,979 bytes + 1 bit60.78To further test the effect of different distributions of 9 code words on normal decoding rate, 51 mini program codes in the database are tested. There are 20 code words in the data area of the V-36 mini program code. We number the 20 code words from 1 to 20. Then, we design four distributions of 9 code words as follows: (i) every modified code word is followed by one code word (1M + 1I), (ii) every two modified code words are followed by one code word (2M + 1I), (iii) every three modified code words are followed by one code word (3M + 1I), and (iv) all nine code words are modified without any intervals (9M + 0I). As can be seen from the experimental results in Table6, the more intervals between 9 code words, the lower the normal decoding rate.Table 6
The success rates of decoding under four distributions of 9 code words.
TypesGroupsCode word distributionNDR (%)1M + 1I41−3−5−7−9−11−13−15−1790.192−4−6−8−10−12−14−16−18⋯⋯4−6−8−10−12−14−16−18−202M + 1I81−2−4−5−7−8−10−11−1391.912−3−5−6−8−9−11−12−14⋯⋯8−9−11−12−14−15−17−18−203M + 1I101−2−3−5−6−7−9−10−11497.062−3−4−6−7−8−10−11−1⋯⋯10−11−12−14−15−16−18−19−209M + 0I121−2−3−4−5−6−7−8−9100.002−3−4−5−6−7−8−9−10⋯⋯12−13−14−15−16−17−18−19−20Based on the above experiments, for the V-36 mini program code, we can draw the following conclusions:(1)
The secret payload in the edge patch is 29 bits.(2)
The secret payload in the encoding region could reach 9 code words, that is, we could embed up to 72 bits in the encoding region.(3)
When 72 bits of the secret message are embedded in the encoding region, modification needs to start from a specific module which is the first bit of each code word. When the length of the secret message is less than 56 bits, the starting position of modification could be any modules.(4)
Different embedding methods have different embedding capacities. We can apply steganographic code in data hiding based on mini program codes to improve the embedding capacity.


### 4.4. Subjective Evaluation

There are many statistical indicators for evaluating image quality [22], such as MSE, PSNR, and SSIM. When we use the mini program codes, the users do not know the specific design or coding of them. They usually only focus on whether the code can be decoded and used successfully. Thus, we use a subjective evaluation method to test the effectiveness of our scheme. In statistics, Dξ and Eξ are usually utilized to analyze the subjective evaluation scores. Dξ is the variance of the scores, and the mean of the scores is Eξ. The larger the Eξ is, the better the effect of our scheme is, and the smaller the Dξ is, the better the validity of this sample is. To test the effectiveness of our scheme, we conduct a subjective evaluation as follows.In the experiments, we test a total of 50 different mini program codes with a size of512×512 and different embedding capacities n through a questionnaire online. The 50 different mini program codes contain 10 types of modification, among which 8 are modified in the encoding region area and 2 are modified in the edge patch. Each type consists of 5 codes. We use “10e” and “20e” to represent that 10 bit and 20 bit modules are modified in the edge patch, respectively. We send questionnaires to a specific group of students and teachers with ages between 18 and 45, normal visual abilities, and no knowledge of the mini program code. According to several cases of decoding exceptions, we design criteria to evaluate the user experience of the marked code as follows: whether it can be correctly decoded and the speed of recognition, whether the modification trace can be seen, etc. One mini program code of each modification type is displayed, and part of mini program codes from the questionnaire is shown in Figure 7. After viewing each modified code, each participant of the questionnaire marks a score following Table 7 to evaluate the user experience of mini program codes. There are four levels in the scoring system including disastrous, poor, moderate, and comfortable corresponding to the scores from 1 to 4.Figure 7
Part of mini program codes from the questionnaire. (a) Cover (10). (b) Modified (10). (c) Cover (10e). (d) Modified (10e). (e) Cover (20). (f) Modified (20). (g) Cover (20e). (h) Modified (20e). (i) Cover (30). (j) Modified (20). (k) Cover (40). (l) Modified (40). (m) Cover (50). (n) Modified (50). (o) Cover (60). (p) Modified (60). (q) Cover (70). (r) Modified (70).
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)(m)(n)(o)(p)(q)(r)Table 7
Scoring system in the subjective evaluation.
ScoresDescriptions4Comfortable3Moderate2Poor1DisastrousFinally, 33 questionnaires were collected and all of them are valid. The statistics of the subjective evaluation are shown in Table8. The frequency of samples is too high and Dξ of all samples is very small, so the actual reference significance of Dξ is not significant. Therefore, the evaluation of the proposed scheme considers the average scores Eξ. The statistical analysis results are shown in Figure 8. We can draw the following conclusions from the histogram:(1)
The average scores of normal codes and modified codes are 3.61 and 3.40, respectively, with a decline rate of 5.81%. It indicates that the modified codes have little impact on the use of mini program codes. Furthermore, it shows that our scheme is effective.(2)
With the same embedding capacity, the embedding effect in the encoding region is better than that in the edge patch.(3)
Excluding some human factors, the embedding effect decreases with the increment of embedding capacity.Table 8
The subjective evaluation result.
CapacityScoresEξDξ43210120301143.611.129510116341143.591.102310e92531373.390.993320104461143.521.008720e82661073.350.88213081581973.290.924540102441273.461.08035098421963.411.06976087512073.320.98927083552343.320.9012Figure 8
The statistical analysis results. (a) Different codes. (b) Different area. (c) Different capacity.
(a)(b)(c)


## 4.1. Examples of the Proposed Scheme

Through the above analysis, a secret message could be embedded in the edge patch and the encoding region by the proposed scheme. Two examples are given in Python to evaluate the practicability of the proposed scheme. The cover image is a V-36 mini program code of WeChat open class. The image size is512×512 pixels. When the length of the secret message is less than 29 bits, both edge patch and encoding region can be selected to embed. The secret message is the string “NUDT,” and its ASCII value is converted into a binary stream. The binary stream of the cover image is obtained by reading the code words in the embedded area sequentially.The binary streams of the secret message and the edge patch are shown as follows:(1001110101010110001001010100)(1010111101011010010001011110)The binary streams of the secret message and the encoding region are shown as follows:(1001110101010110001001010100)(0101111100001010010011111101)Figure5 shows two examples of the proposed scheme, where Figures 5(a)–5(d) show the process of embedding the secret message in edge patch and Figures 5(e)–5(h) show the process in the encoding region. Figures 5(a) and 5(e) are the cover images. The green circles in Figures 5(b) and 5(f) are the positions to embed the secret message. The embedded results are shown in Figures 5(c) and 5(g). From the binary stream, we can see how many bits are different between the secret message and the embedded area marked in bold. Also, the red circles in Figures 5(d) and 5(h) represent the modified positions.Figure 5
Two examples of the proposed scheme. (a) Cover image. (b) Embedding position. (c) Marked image. (d) Modified position. (e) Cover image. (f) Embedding position. (g) Marked image. (h) Modified position.
(a)(b)(c)(d)(e)(f)(g)(h)Both of the marked images in the example could be decoded by the WeChat scanner, and then, navigate into the mini program. The user will not notice its difference because it can be decoded and used normally. However, we can extract the secret message by reading the modules in the embedded area sequentially with our program. Through these two examples, we verify that both the edge patch and the encoding region could embed the secret message.


## 4.2. Modified-Type Test

In this section, noise experiments are performed to determine the type of modification. To perform a series of experiments based on the mini program code, we randomly collect 51 mini program codes from the Internet as a database. The decoding exception of a mini program code is defined as (i) the mini program code cannot be decoded correctly, (ii) the speed of decoding the code is slower than normal, and (iii) the scanner needs to be tilted to decode successfully.According to the analysis of the function patterns of the mini program codes, we find that the secret message could be embedded in the edge patch and the encoding region. Although we suspect that mini program codes may use the RS code to encode data, we do not know in what order the code words are arranged. Therefore, according to the effect of noise on decoding, we divide the noise into scattered point-like noise and continuous line-like noise. Furthermore, two modified types correspond to these two types of noise, namely, random average embedding (RAE) and continuous area embedding (CAE). RAE means that the modules on each ray have an equal chance to be modified. CAE is to modify the code words on the ray continuously.For RAE, we test three modifications of 10, 15, and 20 points. As for CAE, we also test three modifications of 3, 5, and 7 lines. Each line contains4∼6 consecutive points. Taking the mini program code of WeChat open class as an example, six modification versions are shown in Figure 6. Fifty-one mini program codes are tested separately, and the normal decoding rates (NDR) of six modification versions are calculated.Figure 6
Six modification versions of embedding. (a) 10 points. (b) 15 points. (c) 20 points. (d) 3 lines. (e) 5 lines. (f) 7 lines.
(a)(b)(c)(d)(e)(f)As we can see from the results in Table4, when we choose CAE, even if we modify the modules with 5 lines, which is approximately 20∼30 bits, the normal decoding rate is still 100%. With the same embedding capacity, when we modify 20 points, the normal decoding rate can only reach 44.83% by using RAE. Therefore, to improve the embedding capacity and ensure a high normal decoding rate, we choose CAE as the modified type.Table 4
The normal decoding rates of six modification versions.
RAE10 points15 points20 pointsNDR100%72.41%44.83%CAE3 lines5 lines7 linesNDR100%100%62.07%


## 4.3. The Secret Payload of the Proposed Scheme

In this section, we test the secret payload of the proposed scheme. First, according to the analysis of the function of patterns, the edge patch is used to make the appearance of the mini program code more harmonious. The modules in the edge patch have no concrete meaning. Therefore, we flip all bits in the edge patch to test the capacity. If the mini program code could be decoded normally, all bits in the edge patch can be modified. The edge patches of 51 mini program codes of the database are tested, and all codes are decoded correctly. There are 29 bits in the edge patch of the V-36 mini program code. Therefore, the embedding capacity of the edge patch is 29 bits.Secondly, we test the embedding capacity in the encoding region. At present, to the best of our knowledge, there is no official documentation on how to encode data into a mini program code. In Section4.2, we conclude that CAE should be adopted to embed secret messages. Observing the existing V-36 mini program code, we can find that there are 304 modules in the encoding region. And, according to the introduction of the mini program code in Chen [20], the encoding region is divided into two parts. There may be 160 bits in the data area and 144 bits in the error correction area. The data area is located in the top half of the mini program code, where the rays are sequenced from left to right, and the bits on each ray are encoded from inside to outside. The error correction area is located in the lower half of the mini program code followed by the data area and the error-correcting codes are encoded in the same order. All information about the data encoding method of mini program code is not officially confirmed, so we have to test our conjectures experimentally to design a secret message hiding scheme and obtain the secret payload.To obtain the maximum capacity of the encoding region, 51 mini program codes in the database are tested. Several experiments are designed on each code. We start with the first bit of the data area, and then, we continuously flip 56, 64, 72, and 80 bits. From the results in Table5, we can guess that the maximum capacity should be between 72 and 80 bits. Then, we flip the 73 or 74 continuous bits. The normal decoding rate drops significantly when the number of bits flipped switches from 72 to 73. Therefore, we can tentatively conclude that the maximum capacity is 72 bits. However, the normal decoding rate is not satisfactory when we flip 72 continuous bits from the second bit to the 73rd bit. Based on the above situation, we guess that the 8 bits of each code word are distributed continuously. According to the RS code, they have the same effect when we modify a bit and a byte. Through experiments with serial nos. 3∼19, we can determine that the embedding capacity is 9 code words and verify that every 8 continuous bits compose a code word.Table 5
The normal decoding rates of several experiments.
No.The range of bitsThe case of bytesNDR (%)11,567 bytes10021,648 bytes10031,729 bytes10041,8010 bytes0.0051,739 bytes + 1 bit27.4561,749 bytes + 2 bits3.9272,737 bits + 8 bytes + 1 bit19.6188,731 bit + 8 bytes + 1 bit70.5999,738 bytes + 1 bit100109,809 bytes100119,819 bytes + 1 bit15.691216,881 bit + 9 bytes66.671317,818 bytes + 1 bit1001417,889 bytes1001517,899 bytes + 1 bit68.631624,961 bit + 9 bytes56.861725,898 bytes + 1 bit1001825,969 bytes1001925,979 bytes + 1 bit60.78To further test the effect of different distributions of 9 code words on normal decoding rate, 51 mini program codes in the database are tested. There are 20 code words in the data area of the V-36 mini program code. We number the 20 code words from 1 to 20. Then, we design four distributions of 9 code words as follows: (i) every modified code word is followed by one code word (1M + 1I), (ii) every two modified code words are followed by one code word (2M + 1I), (iii) every three modified code words are followed by one code word (3M + 1I), and (iv) all nine code words are modified without any intervals (9M + 0I). As can be seen from the experimental results in Table6, the more intervals between 9 code words, the lower the normal decoding rate.Table 6
The success rates of decoding under four distributions of 9 code words.
TypesGroupsCode word distributionNDR (%)1M + 1I41−3−5−7−9−11−13−15−1790.192−4−6−8−10−12−14−16−18⋯⋯4−6−8−10−12−14−16−18−202M + 1I81−2−4−5−7−8−10−11−1391.912−3−5−6−8−9−11−12−14⋯⋯8−9−11−12−14−15−17−18−203M + 1I101−2−3−5−6−7−9−10−11497.062−3−4−6−7−8−10−11−1⋯⋯10−11−12−14−15−16−18−19−209M + 0I121−2−3−4−5−6−7−8−9100.002−3−4−5−6−7−8−9−10⋯⋯12−13−14−15−16−17−18−19−20Based on the above experiments, for the V-36 mini program code, we can draw the following conclusions:(1)
The secret payload in the edge patch is 29 bits.(2)
The secret payload in the encoding region could reach 9 code words, that is, we could embed up to 72 bits in the encoding region.(3)
When 72 bits of the secret message are embedded in the encoding region, modification needs to start from a specific module which is the first bit of each code word. When the length of the secret message is less than 56 bits, the starting position of modification could be any modules.(4)
Different embedding methods have different embedding capacities. We can apply steganographic code in data hiding based on mini program codes to improve the embedding capacity.


## 4.4. Subjective Evaluation

There are many statistical indicators for evaluating image quality [22], such as MSE, PSNR, and SSIM. When we use the mini program codes, the users do not know the specific design or coding of them. They usually only focus on whether the code can be decoded and used successfully. Thus, we use a subjective evaluation method to test the effectiveness of our scheme. In statistics, Dξ and Eξ are usually utilized to analyze the subjective evaluation scores. Dξ is the variance of the scores, and the mean of the scores is Eξ. The larger the Eξ is, the better the effect of our scheme is, and the smaller the Dξ is, the better the validity of this sample is. To test the effectiveness of our scheme, we conduct a subjective evaluation as follows.In the experiments, we test a total of 50 different mini program codes with a size of512×512 and different embedding capacities n through a questionnaire online. The 50 different mini program codes contain 10 types of modification, among which 8 are modified in the encoding region area and 2 are modified in the edge patch. Each type consists of 5 codes. We use “10e” and “20e” to represent that 10 bit and 20 bit modules are modified in the edge patch, respectively. We send questionnaires to a specific group of students and teachers with ages between 18 and 45, normal visual abilities, and no knowledge of the mini program code. According to several cases of decoding exceptions, we design criteria to evaluate the user experience of the marked code as follows: whether it can be correctly decoded and the speed of recognition, whether the modification trace can be seen, etc. One mini program code of each modification type is displayed, and part of mini program codes from the questionnaire is shown in Figure 7. After viewing each modified code, each participant of the questionnaire marks a score following Table 7 to evaluate the user experience of mini program codes. There are four levels in the scoring system including disastrous, poor, moderate, and comfortable corresponding to the scores from 1 to 4.Figure 7
Part of mini program codes from the questionnaire. (a) Cover (10). (b) Modified (10). (c) Cover (10e). (d) Modified (10e). (e) Cover (20). (f) Modified (20). (g) Cover (20e). (h) Modified (20e). (i) Cover (30). (j) Modified (20). (k) Cover (40). (l) Modified (40). (m) Cover (50). (n) Modified (50). (o) Cover (60). (p) Modified (60). (q) Cover (70). (r) Modified (70).
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)(m)(n)(o)(p)(q)(r)Table 7
Scoring system in the subjective evaluation.
ScoresDescriptions4Comfortable3Moderate2Poor1DisastrousFinally, 33 questionnaires were collected and all of them are valid. The statistics of the subjective evaluation are shown in Table8. The frequency of samples is too high and Dξ of all samples is very small, so the actual reference significance of Dξ is not significant. Therefore, the evaluation of the proposed scheme considers the average scores Eξ. The statistical analysis results are shown in Figure 8. We can draw the following conclusions from the histogram:(1)
The average scores of normal codes and modified codes are 3.61 and 3.40, respectively, with a decline rate of 5.81%. It indicates that the modified codes have little impact on the use of mini program codes. Furthermore, it shows that our scheme is effective.(2)
With the same embedding capacity, the embedding effect in the encoding region is better than that in the edge patch.(3)
Excluding some human factors, the embedding effect decreases with the increment of embedding capacity.Table 8
The subjective evaluation result.
CapacityScoresEξDξ43210120301143.611.129510116341143.591.102310e92531373.390.993320104461143.521.008720e82661073.350.88213081581973.290.924540102441273.461.08035098421963.411.06976087512073.320.98927083552343.320.9012Figure 8
The statistical analysis results. (a) Different codes. (b) Different area. (c) Different capacity.
(a)(b)(c)


## 5. Conclusions and Future Work

In this paper, based on the research of mini program codes, a data-hiding scheme for mini program codes is proposed, and the embedding capacity of the proposed scheme is tested. The proposed scheme is the first to realize information hiding based on mini program codes. This research could deal with the security issues of mini program code in advance. At present, we adopt a bit replacement technique to achieve data hiding based on mini program codes. When the embedding capacity is less than 9 code words, the secret messages could be recovered. Meanwhile, mini program codes still can be decoded correctly. This is the simplest embedding method. Other steganography coding methods could also be applied, such as syndrome-based data-hiding techniques. In practical application, the secret message could be protected by channel coding to deal with that the mini program code goes through a noisy channel. In future work, we will study different versions and error correction levels of the mini program code. More modification techniques need to be studied to improve embedding capacity, such as syndrome-based data-hiding techniques. Furthermore, we will study the way to resist steganography analysis to make the data-hiding schemes based on mini program codes more secure.



---

*Source: 5546344-2021-05-24.xml*