Junhui He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Junhui He has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Shaohua Tang
4 shared publicationsJunxi Chen
3 shared publications- Hao-Tian Wu
Guangzhou University
2 shared publications - Jiwu Huang
Shenzhen MSU-BIT University, Shenzhen, China
2 shared publications - Shaohua Tang
School of Computer Science and Engineering, South China University of Technology, Guangzhou, China
2 shared publications - Jean-Luc Dugelay
Digital Security Department, EURECOM, Biot, France
1 shared publication
Latest Publications
- Open Access
- 14 July 2025
- Published by MDPI AG in Journal of Sensor and Actuator Networks
- Vol. 14 (4) , 72
An Improved Chosen Plaintext Attack on JPEG Encryption
Format-compatible encryption can be used to ensure the security and privacy of JPEG images. Recently, a JPEG image encryption method proved to be secure against known plaintext attacks by employing an adaptive encryption key, which depends on the histogram of the number of non-zero alternating current coefficients (ACC) in Discrete Cosine Transform (DCT) blocks. However, this scheme has been demonstrated to be vulnerable to chosen-plaintext attacks (CPA) based on the run consistency of MCUs (RCM) between the original image and the encrypted image. In this paper, an improved CPA scheme is proposed. The method of incrementing run-length values instead of permutation is utilized to satisfy the uniqueness of run sequences of different minimum coded units (MCUs). The experimental results show that the proposed method can successfully recover the outlines of plaintext images from the encrypted images, even with lower-quality factors.
- 14 July 2025
- Published by MDPI AG in Journal of Sensor and Actuator Networks
- Vol. 14 (4) , 72
Open AccessAn Improved Chosen Plaintext Attack on JPEG Encryption
Format-compatible encryption can be used to ensure the security and privacy of JPEG images. Recently, a JPEG image encryption method proved to be secure against known plaintext attacks by employing an adaptive encryption key, which depends on the histogram of the number of non-zero alternating current coefficients (ACC) in Discrete Cosine Transform (DCT) blocks. However, this scheme has been demonstrated to be vulnerable to chosen-plaintext attacks (CPA) based on the run consistency of MCUs (RCM) between the original image and the encrypted image. In this paper, an improved CPA scheme is proposed. The method of incrementing run-length values instead of permutation is utilized to satisfy the uniqueness of run sequences of different minimum coded units (MCUs). The experimental results show that the proposed method can successfully recover the outlines of plaintext images from the encrypted images, even with lower-quality factors.
- 28 April 2022
- Published by Elsevier in Signal Processing
- Vol. 198
Reversible data hiding for JPEG images based on improved mapping and frequency ordering
- 28 April 2022
- Published by Elsevier in Signal Processing
- Vol. 198
Reversible data hiding for JPEG images based on improved mapping and frequency ordering
- Open Access
- 14 April 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-15
Improved Lossless Data Hiding for JPEG Images Based on Optimized VLC Mapping
Most reversible data hiding (RDH) schemes embed data into JPEG images through DCT coefficients modification, but they will cause unavoidable visual distortion in the marked images. Lossless data hiding (LDH) can not only restore the cover JPEG images in a lossless way after extraction of the embedded data but also generate marked images without any visual distortion. For LDH schemes based on variable length code (VLC) mapping, the performance depends mainly on the mapping mode. In this paper, a new LDH scheme for JPEG images based on optimized VLC mapping is proposed. First, for a given mapping mode, a mathematical model of file size change is established. Then, based on the Run/Size frequency of a cover image and the estimation of frequency change caused by simulated data embedding, an iterative method is used to find the optimal mapping mode that leads to the smallest file size increments. Lastly, data is embedded in the cover image using the optimal VLC mapping. Experimental results show that the proposed LDH scheme based on optimized VLC mapping can achieve small increase in the file size of marked images.
- 14 April 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-15
Open AccessImproved Lossless Data Hiding for JPEG Images Based on Optimized VLC Mapping
Most reversible data hiding (RDH) schemes embed data into JPEG images through DCT coefficients modification, but they will cause unavoidable visual distortion in the marked images. Lossless data hiding (LDH) can not only restore the cover JPEG images in a lossless way after extraction of the embedded data but also generate marked images without any visual distortion. For LDH schemes based on variable length code (VLC) mapping, the performance depends mainly on the mapping mode. In this paper, a new LDH scheme for JPEG images based on optimized VLC mapping is proposed. First, for a given mapping mode, a mathematical model of file size change is established. Then, based on the Run/Size frequency of a cover image and the estimation of frequency change caused by simulated data embedding, an iterative method is used to find the optimal mapping mode that leads to the smallest file size increments. Lastly, data is embedded in the cover image using the optimal VLC mapping. Experimental results show that the proposed LDH scheme based on optimized VLC mapping can achieve small increase in the file size of marked images.
- 14 October 2020
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 80 (20) , 30863-30877
Reversible image visual transformation for privacy and content protection
- 14 October 2020
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 80 (20) , 30863-30877
Reversible image visual transformation for privacy and content protection
- 1 October 2020
- Published by Elsevier in Signal Processing
- Vol. 175
Improved block ordering and frequency selection for reversible data hiding in JPEG images
- 1 October 2020
- Published by Elsevier in Signal Processing
- Vol. 175
Improved block ordering and frequency selection for reversible data hiding in JPEG images
- Open Access
- 13 May 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (10) , 3375
Two-Dimensional Histogram Shifting-Based Reversible Data Hiding for H.264/AVC Video
Histogram shifting (HS) has been proved to be a great success in reversible data hiding (RDH). To reduce the quality loss of marked media and the increase in file size, several two-dimensional (2D) HS schemes based on the characteristics of cover media have been proposed recently. However, our analysis shows that the embedding strategies used in these methods can be further optimized. In this paper, two new 2D HS schemes for RDH in H.264/AVC video are developed, one of which uses the DCT coefficient pairs with both values 0 and the other does not. The embedding efficiency of a DCT coefficient pair in different embedding modes is firstly calculated. Then, based on the obtained embedding efficiency along with the statistical distribution of DCT coefficient pairs, two better embedding strategies are proposed. The secret data is finally embedded into the pairs of DCT coefficients of the middle and high frequencies using our proposed strategies. The comparison experiment results demonstrate that our schemes can achieve enhanced visual quality in terms of PSNR, SSIM, and entropy in most cases, and the increase in file size is smaller.
- 13 May 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (10) , 3375
Open AccessTwo-Dimensional Histogram Shifting-Based Reversible Data Hiding for H.264/AVC Video
Histogram shifting (HS) has been proved to be a great success in reversible data hiding (RDH). To reduce the quality loss of marked media and the increase in file size, several two-dimensional (2D) HS schemes based on the characteristics of cover media have been proposed recently. However, our analysis shows that the embedding strategies used in these methods can be further optimized. In this paper, two new 2D HS schemes for RDH in H.264/AVC video are developed, one of which uses the DCT coefficient pairs with both values 0 and the other does not. The embedding efficiency of a DCT coefficient pair in different embedding modes is firstly calculated. Then, based on the obtained embedding efficiency along with the statistical distribution of DCT coefficient pairs, two better embedding strategies are proposed. The secret data is finally embedded into the pairs of DCT coefficients of the middle and high frequencies using our proposed strategies. The comparison experiment results demonstrate that our schemes can achieve enhanced visual quality in terms of PSNR, SSIM, and entropy in most cases, and the increase in file size is smaller.
- 10 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 15, 2121-2133
Reversible Data Hiding in JPEG Images Based on Negative Influence Models
- 10 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 15, 2121-2133
Reversible Data Hiding in JPEG Images Based on Negative Influence Models
- 22 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 29 (12) , 3501-3515
A Novel High-Capacity Reversible Data Hiding Scheme for Encrypted JPEG Bitstreams
As cloud storage becomes more common, concerns about the invasion of privacy are increasing. When images are stored in an encrypted form in the public cloud, reversible data hiding in the encrypted domain can be applied to embed additional data within the encrypted images for ease of management. Most existing works focus on uncompressed images and are not applicable to JPEG images, which are widely used throughout the Internet. Therefore, in this paper, a novel reversible data hiding scheme for encrypted JPEG bitstreams is proposed. First, an effective method of bitstream-based JPEG image encryption is employed to encrypt plaintext JPEG images. Then, we present a reversible data hiding technique for encrypted JPEG images based on invariant zero-run length in the zero-run value pairs. In the cloud, additional data, such as labels, timestamps, origins and authentication messages, are directly embedded into the encrypted JPEG images with our proposed data hiding technique. From the marked encrypted JPEG images, the extraction of the hidden data and the recovery of the original images can be done independently. Extensive experiments performed on several typical images and three well-known image databases show that the proposed scheme can achieve much higher embedding capacity than that of most recent schemes, and the file sizes of the marked encrypted JPEG images are well preserved compared to those of the related methods. In addition, we provide further analysis to show that the proposed scheme has good format compatibility and low computational complexity.
- 22 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 29 (12) , 3501-3515
A Novel High-Capacity Reversible Data Hiding Scheme for Encrypted JPEG Bitstreams
As cloud storage becomes more common, concerns about the invasion of privacy are increasing. When images are stored in an encrypted form in the public cloud, reversible data hiding in the encrypted domain can be applied to embed additional data within the encrypted images for ease of management. Most existing works focus on uncompressed images and are not applicable to JPEG images, which are widely used throughout the Internet. Therefore, in this paper, a novel reversible data hiding scheme for encrypted JPEG bitstreams is proposed. First, an effective method of bitstream-based JPEG image encryption is employed to encrypt plaintext JPEG images. Then, we present a reversible data hiding technique for encrypted JPEG images based on invariant zero-run length in the zero-run value pairs. In the cloud, additional data, such as labels, timestamps, origins and authentication messages, are directly embedded into the encrypted JPEG images with our proposed data hiding technique. From the marked encrypted JPEG images, the extraction of the hidden data and the recovery of the original images can be done independently. Extensive experiments performed on several typical images and three well-known image databases show that the proposed scheme can achieve much higher embedding capacity than that of most recent schemes, and the file sizes of the marked encrypted JPEG images are well preserved compared to those of the related methods. In addition, we provide further analysis to show that the proposed scheme has good format compatibility and low computational complexity.
- 19 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 20 (10) , 2645-2658
JPEG Image Encryption With Improved Format Compatibility and File Size Preservation
Image encryption techniques can be used to ensure the security and privacy of valuable images. The related works in this field have focused more on raster images than on compressed images. Many existing JPEG image encryption schemes are not quite well compatible with the JPEG standard, or the file size of an encrypted JPEG image is apparently increased. In this paper, a novel bitstream-based JPEG image encryption method is presented. First, the groups of successive DC codes that encode the quantized DC coefficient differences with the same sign are permuted within each group. Second, the left half and the right half of a group, whose size will increase with the number of iterations, of consecutive DC codes may be swapped with each other, depending on whether an overflow of quantized DC coefficients occurs during decoding. Third, all AC codes are classified into 63 categories according to their zero-run lengths, then the AC codes within each category are, respectively, scrambled. Finally, all MCUs, except for DC codes, are randomly shuffled as a whole. Moreover, an image-content-related encryption key is employed to provide further security. The experimental results show that the file size of an encrypted JPEG image is almost the same as that of the corresponding plaintext image except for slight variations because of byte alignment. In addition, the quantized DC coefficients decoded from an encrypted JPEG image will not fall outside the valid range. Improved format compatibility is provided compared with other related methods. Moreover, it is unnecessary to perform entropy encoding again because all of the encryption operations are performed directly on the JPEG bitstream. The proposed method proves to be secure against brute-force attacks, differential cryptanalysis, known plaintext attacks, and outline attacks. Our proposed method can also be applied to color JPEG images.
- 19 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 20 (10) , 2645-2658
JPEG Image Encryption With Improved Format Compatibility and File Size Preservation
Image encryption techniques can be used to ensure the security and privacy of valuable images. The related works in this field have focused more on raster images than on compressed images. Many existing JPEG image encryption schemes are not quite well compatible with the JPEG standard, or the file size of an encrypted JPEG image is apparently increased. In this paper, a novel bitstream-based JPEG image encryption method is presented. First, the groups of successive DC codes that encode the quantized DC coefficient differences with the same sign are permuted within each group. Second, the left half and the right half of a group, whose size will increase with the number of iterations, of consecutive DC codes may be swapped with each other, depending on whether an overflow of quantized DC coefficients occurs during decoding. Third, all AC codes are classified into 63 categories according to their zero-run lengths, then the AC codes within each category are, respectively, scrambled. Finally, all MCUs, except for DC codes, are randomly shuffled as a whole. Moreover, an image-content-related encryption key is employed to provide further security. The experimental results show that the file size of an encrypted JPEG image is almost the same as that of the corresponding plaintext image except for slight variations because of byte alignment. In addition, the quantized DC coefficients decoded from an encrypted JPEG image will not fall outside the valid range. Improved format compatibility is provided compared with other related methods. Moreover, it is unnecessary to perform entropy encoding again because all of the encryption operations are performed directly on the JPEG bitstream. The proposed method proves to be secure against brute-force attacks, differential cryptanalysis, known plaintext attacks, and outline attacks. Our proposed method can also be applied to color JPEG images.
- Open Access
- 1 January 2018
- Published by Wiley in Security and Communication Networks
- Vol. 2018, 1-11
A Novel AMR-WB Speech Steganography Based on Diameter-Neighbor Codebook Partition
Steganography is a means of covert communication without revealing the occurrence and the real purpose of communication. The adaptive multirate wideband (AMR-WB) is a widely adapted format in mobile handsets and is also the recommended speech codec for VoLTE. In this paper, a novel AMR-WB speech steganography is proposed based on diameter-neighbor codebook partition algorithm. Different embedding capacity may be achieved by adjusting the iterative parameters during codebook division. The experimental results prove that the presented AMR-WB steganography may provide higher and flexible embedding capacity without inducing perceptible distortion compared with the state-of-the-art methods. With 48 iterations of cluster merging, twice the embedding capacity of complementary-neighbor-vertices-based embedding method may be obtained with a decrease of only around 2% in speech quality and much the same undetectability. Moreover, both the quality of stego speech and the security regarding statistical steganalysis are better than the recent speech steganography based on neighbor-index-division codebook partition.
- 1 January 2018
- Published by Wiley in Security and Communication Networks
- Vol. 2018, 1-11
Open AccessA Novel AMR-WB Speech Steganography Based on Diameter-Neighbor Codebook Partition
Steganography is a means of covert communication without revealing the occurrence and the real purpose of communication. The adaptive multirate wideband (AMR-WB) is a widely adapted format in mobile handsets and is also the recommended speech codec for VoLTE. In this paper, a novel AMR-WB speech steganography is proposed based on diameter-neighbor codebook partition algorithm. Different embedding capacity may be achieved by adjusting the iterative parameters during codebook division. The experimental results prove that the presented AMR-WB steganography may provide higher and flexible embedding capacity without inducing perceptible distortion compared with the state-of-the-art methods. With 48 iterations of cluster merging, twice the embedding capacity of complementary-neighbor-vertices-based embedding method may be obtained with a decrease of only around 2% in speech quality and much the same undetectability. Moreover, both the quality of stego speech and the security regarding statistical steganalysis are better than the recent speech steganography based on neighbor-index-division codebook partition.