Ke Niu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ke Niu has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Jun Li
College of Cryptography Engineering, Chinese People’s Armed Police Force Engineering University, Xi’an, China
4 shared publications - Jun Li
College of Cryptography Engineering, Engineering University of CAPF , Sanqiao Subdistrict, Xixian New Area, Xi'an 710086, Shaanxi
4 shared publications - Xiaoyuan Yang
College of Intelligent and Security, Chinese People’s Armed Police Force Engineering University, Xi’an 710086, China
4 shared publications - Yifei Meng
College of Cryptographic Engineering, Chinese People’s Armed Police Force Engineering University, Xi’an 710086, China
3 shared publications - Yingnan Zhang
College of Cryptography Engineering, Chinese People’s Armed Police Force Engineering University, Xi’an, China
3 shared publications - Yucheng Liang
College of Cryptographic Engineering, Engineering University of the Chinese People’s Armed Police Force, Xi’an, 710086, China
3 shared publications
Latest Publications
- Open Access
- 8 October 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (8) , 902
CASTNet: a content-adaptive spatio-temporal network for robust video hiding
- 8 October 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (8) , 902
Open AccessCASTNet: a content-adaptive spatio-temporal network for robust video hiding
- 6 October 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 334
CRAFMark: Contrastive-driven robust adaptive frequency-aware video watermarking against H.265/HEVC compression
- 6 October 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 334
CRAFMark: Contrastive-driven robust adaptive frequency-aware video watermarking against H.265/HEVC compression
- 11 May 2026
- Published by Elsevier in Neural Networks
- Vol. 202, 109090
MIRA: Multi-scale invertible dual-attention redundancy-aware network for high-capacity video steganography
- 11 May 2026
- Published by Elsevier in Neural Networks
- Vol. 202, 109090
MIRA: Multi-scale invertible dual-attention redundancy-aware network for high-capacity video steganography
- 24 April 2026
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 69 (9) , 1512-1524
MTGAN: research on video watermarking based on multi-task generative adversarial networks
In response to the shortcomings of traditional video watermarking in terms of invisibility and robustness, this paper proposes a video watermarking algorithm based on a multi-task generative adversarial network (MTGAN). By organically integrating the advantages of multi-task learning and generative adversarial networks, a generator with shared parameters and a multi-task discriminator are designed. This approach jointly optimizes the tasks of video generation and watermark information extraction, simultaneously achieving high visual quality (with both peak signal-to-noise ratio and structural similarity index reaching satisfactory levels) and significantly improving the recovery accuracy of watermark information (with the NC metric attaining a commendable level). The UCF-101 and STL-10 datasets are utilized to validate the model’s generalization capability. Compared with representative baselines, the proposed method achieves a favorable trade-off between imperceptibility and robustness, providing more stable visual quality while improving robustness under common spatial and codec-related distortions.
- 24 April 2026
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 69 (9) , 1512-1524
MTGAN: research on video watermarking based on multi-task generative adversarial networks
In response to the shortcomings of traditional video watermarking in terms of invisibility and robustness, this paper proposes a video watermarking algorithm based on a multi-task generative adversarial network (MTGAN). By organically integrating the advantages of multi-task learning and generative adversarial networks, a generator with shared parameters and a multi-task discriminator are designed. This approach jointly optimizes the tasks of video generation and watermark information extraction, simultaneously achieving high visual quality (with both peak signal-to-noise ratio and structural similarity index reaching satisfactory levels) and significantly improving the recovery accuracy of watermark information (with the NC metric attaining a commendable level). The UCF-101 and STL-10 datasets are utilized to validate the model’s generalization capability. Compared with representative baselines, the proposed method achieves a favorable trade-off between imperceptibility and robustness, providing more stable visual quality while improving robustness under common spatial and codec-related distortions.
- Open Access
- 22 April 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (6)
A codec-aware framework for robust video hiding via frame-type-specific distortion simulation
- 22 April 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (6)
Open AccessA codec-aware framework for robust video hiding via frame-type-specific distortion simulation
- Open Access
- 3 February 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (3)
CSTFMark: robust video watermarking against H.264/AVC compression via dynamic spati-temporal frequency modulation and curriculum learning
- 3 February 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (3)
Open AccessCSTFMark: robust video watermarking against H.264/AVC compression via dynamic spati-temporal frequency modulation and curriculum learning
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 188-192
Research on Robust Reversible Neural Network Video Steganography Based on Adversarial Training
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 188-192
Open AccessResearch on Robust Reversible Neural Network Video Steganography Based on Adversarial Training
- Open Access
- 21 September 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (18) , 2938
A Video Dual-Domain Blind Watermarking Algorithm Based on Hadamard Transform
Addressing the compatibility challenges surrounding the robustness and reversibility of existing video watermarking techniques, this study introduces a novel video dual-domain blind watermarking algorithm leveraging the Hadamard transform. Specifically tailored for H.264 video copyright protection, the algorithm initially organizes video frames and identifies key frames for watermark embedding. Prior to embedding, the robust watermark undergoes coding preprocessing to optimize its integration. Subsequently, a block is expanded based on the selected embedding position within the frame, followed by the application of the Hadamard transform to the enlarged block. The 1-bit robust watermark information is then embedded via the coefficient pair located in the first row of the Hadamard coefficient matrix corresponding to the expanded block. Additionally, a reversible watermark, designed to mitigate the distortions introduced during robust embedding, is generated and embedded into the remaining coefficients of the coefficient matrix using reversible embedding techniques. During watermark extraction, the dual-domain watermark can be retrieved exclusively through reversible extraction methodologies by analyzing the size relationship of coefficient pairs, eliminating the need for access to the original video data. To bolster the algorithm’s robustness, a majority-subordinate voting system is devised and implemented, effectively enhancing its resilience. Experimental findings demonstrate that, compared to similar approaches, this algorithm not only enhances the reversibility of video restoration but also exhibits superior robustness and meets the requirements for imperceptibility.- 21 September 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (18) , 2938
Open AccessA Video Dual-Domain Blind Watermarking Algorithm Based on Hadamard Transform
Addressing the compatibility challenges surrounding the robustness and reversibility of existing video watermarking techniques, this study introduces a novel video dual-domain blind watermarking algorithm leveraging the Hadamard transform. Specifically tailored for H.264 video copyright protection, the algorithm initially organizes video frames and identifies key frames for watermark embedding. Prior to embedding, the robust watermark undergoes coding preprocessing to optimize its integration. Subsequently, a block is expanded based on the selected embedding position within the frame, followed by the application of the Hadamard transform to the enlarged block. The 1-bit robust watermark information is then embedded via the coefficient pair located in the first row of the Hadamard coefficient matrix corresponding to the expanded block. Additionally, a reversible watermark, designed to mitigate the distortions introduced during robust embedding, is generated and embedded into the remaining coefficients of the coefficient matrix using reversible embedding techniques. During watermark extraction, the dual-domain watermark can be retrieved exclusively through reversible extraction methodologies by analyzing the size relationship of coefficient pairs, eliminating the need for access to the original video data. To bolster the algorithm’s robustness, a majority-subordinate voting system is devised and implemented, effectively enhancing its resilience. Experimental findings demonstrate that, compared to similar approaches, this algorithm not only enhances the reversibility of video restoration but also exhibits superior robustness and meets the requirements for imperceptibility. - Open Access
- 20 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (18) , 3734
Robust Reversible Watermarking Scheme in Video Compression Domain Based on Multi-Layer Embedding
Most of the existing research on video watermarking schemes focus on improving the robustness of watermarking. However, in application scenarios such as judicial forensics and telemedicine, the distortion caused by watermark embedding on the original video is unacceptable. To solve this problem, this paper proposes a robust reversible watermarking (RRW)scheme based on multi-layer embedding in the video compression domain. Firstly, the watermarking data are divided into several sub-secrets by using Shamir’s (t, n)-threshold secret sharing. After that, the chroma sub-block with more complex texture information is filtered out in the I-frame of each group of pictures (GOP), and the sub-secret is embedded in that frame by modifying the discrete cosine transform (DCT) coefficients within the sub-block. Finally, the auxiliary information required to recover the coefficients is embedded into the motion vector of the P-frame of each GOP by a reversible steganography algorithm. In the absence of an attack, the receiver can recover the DCT coefficients by extracting the auxiliary information in the vectors, ultimately recovering the video correctly. The watermarking scheme demonstrates strong robustness even when it suffers from malicious attacks such as recompression attacks and requantization attacks. The experimental results demonstrate that the watermarking scheme proposed in this paper exhibits reversibility and high visual quality. Moreover, the scheme surpasses other comparable methods in the robustness test session.
- 20 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (18) , 3734
Open AccessRobust Reversible Watermarking Scheme in Video Compression Domain Based on Multi-Layer Embedding
Most of the existing research on video watermarking schemes focus on improving the robustness of watermarking. However, in application scenarios such as judicial forensics and telemedicine, the distortion caused by watermark embedding on the original video is unacceptable. To solve this problem, this paper proposes a robust reversible watermarking (RRW)scheme based on multi-layer embedding in the video compression domain. Firstly, the watermarking data are divided into several sub-secrets by using Shamir’s (t, n)-threshold secret sharing. After that, the chroma sub-block with more complex texture information is filtered out in the I-frame of each group of pictures (GOP), and the sub-secret is embedded in that frame by modifying the discrete cosine transform (DCT) coefficients within the sub-block. Finally, the auxiliary information required to recover the coefficients is embedded into the motion vector of the P-frame of each GOP by a reversible steganography algorithm. In the absence of an attack, the receiver can recover the DCT coefficients by extracting the auxiliary information in the vectors, ultimately recovering the video correctly. The watermarking scheme demonstrates strong robustness even when it suffers from malicious attacks such as recompression attacks and requantization attacks. The experimental results demonstrate that the watermarking scheme proposed in this paper exhibits reversibility and high visual quality. Moreover, the scheme surpasses other comparable methods in the robustness test session.
- Open Access
End-to-End Encrypted Message Distribution System for the Internet of Things Based on Conditional Proxy Re-Encryption
In light of the existing security vulnerabilities within IoT publish–subscribe systems, our study introduces an improved end-to-end encryption approach using conditional proxy re-encryption. This method not only overcomes limitations associated with the reliance on a trusted authority and the challenge of reliably revoking users in previous proxy re-encryption frameworks, but also strengthens data privacy against potential collusion between the broker and subscribers. Through our innovative encryption protocol, unauthorized re-encryption by brokers is effectively prevented, enhancing secure communication between publisher and subscriber. Implemented on HiveMQ, an open-source MQTT platform, our prototype system demonstrates significant enhancements. Comparison to the state-of-the-art end-to-end encryption work, encryption overhead of our scheme is comparable to it, and the decryption cost is approximately half of it. Moreover, our solution significantly improves overall security without compromising the asynchronous communication and decentralized authorization foundational to the publish–subscribe model.
Open AccessEnd-to-End Encrypted Message Distribution System for the Internet of Things Based on Conditional Proxy Re-Encryption
In light of the existing security vulnerabilities within IoT publish–subscribe systems, our study introduces an improved end-to-end encryption approach using conditional proxy re-encryption. This method not only overcomes limitations associated with the reliance on a trusted authority and the challenge of reliably revoking users in previous proxy re-encryption frameworks, but also strengthens data privacy against potential collusion between the broker and subscribers. Through our innovative encryption protocol, unauthorized re-encryption by brokers is effectively prevented, enhancing secure communication between publisher and subscriber. Implemented on HiveMQ, an open-source MQTT platform, our prototype system demonstrates significant enhancements. Comparison to the state-of-the-art end-to-end encryption work, encryption overhead of our scheme is comparable to it, and the decryption cost is approximately half of it. Moreover, our solution significantly improves overall security without compromising the asynchronous communication and decentralized authorization foundational to the publish–subscribe model.