Yue Jiang

Ms. Yue Jiang

National University of Defense Technology, Changsha, China
orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2022 in Entropy
Verified
Journal Article
Open access
PDF file
JCJingwen Cheng
Jingwen Cheng
XYXuehu Yan
Xuehu Yan
LLLintao Liu
Lintao Liu
YJYue Jiang
Yue Jiang
XWXuan Wang
Xuan Wang
Secret image sharing (SIS), as one of the applications of information theory in information security protection, has been widely used in many areas, such as blockchain, identity authentication and distributed cloud storage. In traditional secret image sharing schemes, noise-like shadows introduce difficulties into shadow management and increase the risk of attacks. Meaningful secret image sharing is thus proposed to solve these problems. Previous meaningful SIS schemes have employed steganography to hide shares into cover images, and their covers are always binary images. These schemes usually include pixel expansion and low visual quality shadows. To improve the shadow quality, we design a meaningful secret image sharing scheme with saliency detection. Saliency detection is used to determine the salient regions of cover images. In our proposed scheme, we improve the quality of salient regions that are sensitive to the human vision system. In this way, we obtain meaningful shadows with better visual quality. Experiment results and comparisons demonstrate the effectiveness of our proposed scheme.

12 February 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
YJYue Jiang
Yue Jiang
XYXuehu Yan
Xuehu Yan
JQJianqing Qi
Jianqing Qi
YLYuliang Lu
Yuliang Lu
XZXuan Zhou
Xuan Zhou
A ( k , n ) threshold secret image sharing (SIS) method is proposed to divide a secret image into n shadows. The beauty of this scheme is that one can only reconstruct a secret image with k or more than k shadows, but one cannot obtain any information about the secret from fewer than k shadows. In the ( k , n ) threshold SIS, shadow authentication means the detection and location of manipulated shadows. Traditional shadow authentication schemes require additional bits for authentication; need much information to be public; or need to put each shadow into a host image, utilizing the information hiding technique, which makes the generation, recovery and authentication complexity higher. Besides, most existing schemes work when a dealer participates in recovery. Our contribution is that we propose a SIS method for a ( k , n ) threshold with dealer-participatory and non-dealer-participatory mutual shadow authentication capabilities which integrates polynomial-based SIS and visual secret sharing (VSS) through using the result of VSS to “guide” the polynomial-based SIS by a screening operation. In our scheme, when an authentication image is public, all involved actors (participants and dealer) can mutually authenticate each other by exchange the lowest level plane instead of the whole shadow. Our scheme is suitable for the case with and without a dealer participate recovery. In addition, the proposed scheme has characteristics of low generation and authentication complexity, no pixel expansion, 100% detection rate and lossless recovery.

30 May 2024 in IEEE Transactions on Multimedia
Verified
Journal Article
Open access
YJYue Jiang
Yue Jiang
KCKejiang Chen
Kejiang Chen
WYWei Yan
Wei Yan
XYXuehu Yan
Xuehu Yan
GYGuozheng Yang
Guozheng Yang
KZKai Zeng
Kai Zeng
$(k,n)$ Threshold secret image sharing (SIS) hides a secret image within $n$ shadows, and at least $k$ shadows are needed for recovery. Due to the popularity and frequency of JPEG recompression, there is a need for robust secret image sharing (ROSIS) designed for JPEG images that is resilient to recompression for practical SIS applications. The current state-of-the-art ROSIS, which relies on error-correcting codes (ECC), is effective only for JPEG compression with quality factors (QFs) of 99 and 100. However, it generates noise-like shadow images that are confined to the spatial domain. In this paper, we present SBC-ROSIS (Robust Secret Image Sharing Scheme Resistant to JPEG Recompression Based on Stable Block Condition), a novel ROSIS scheme that utilizes a stable block condition to guarantee the invariance of discrete cosine transform (DCT) coefficients during JPEG recompression, significantly enhancing the robustness of the scheme. By employing a polynomial-based secret sharing (SS) algorithm, we construct DCT blocks that adhere to stable block condition either directly or through strategic global regulation. Additionally, we carefully consider the similarity between the generated DCT blocks and the original cover DCT blocks. Furthermore, we devised a tailored evaluation methodology specifically for ROSIS. Extensive experimental results indicate that SBC-ROSIS can effectively process JPEG images, achieving a balance among security, robustness, concealment, and adherence to the $(k, n)$ threshold, without relying on steganography, ECC, or pixel expansion, and demonstrating robust performance in realistic recompression scenarios.

2 March 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
YJYue Jiang
Yue Jiang
XYXuehu Yan
Xuehu Yan
JQJianqing Qi
Jianqing Qi
LLLonglong Li
Longlong Li
YLYiming Liu
Yiming Liu

1 January 2022 in Mathematical Biosciences and Engineering
Verified
Journal Article
Open access
PDF file
YJYue Jiang
Yue Jiang
XYXuehu Yan
Xuehu Yan
JCJia Chen
Jia Chen
JCJingwen Cheng
Jingwen Cheng
JZJianguo Zhang
Jianguo Zhang
JPEG is the most common format for storing and transmitting photographic images on social network platforms. JPEG image is widely used in people's life because of their low storage space and high visual quality. Secret image sharing (SIS) technology is important to protect image data. Traditional SIS schemes generally focus on spatial images, however there is little research on frequency domain images. In addition, the current tiny research on SIS for JPEG images only focuses on JPEG images with a compression quality factor ($ QF $) of $ 100 $. To overcome the limitation of JPEG images in SIS, we propose a meaningful SIS for JPEG images to operate the quantized DCT coefficients of JPEG images. The random elements utilization model is applied to achieve meaningful shadow images. Our proposed scheme has a better quality of the shadow images and the recovered secret image. Experiment results and comparisons indicate the effectiveness of the scheme. The scheme can be used for JPEG images with any compression $ QF $. Besides, the scheme has good characteristics, such as $ (k, n) $ threshold, extended shadow images.

6 September 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
JCJingwen Cheng
Jingwen Cheng
LLLintao Liu
Lintao Liu
FCFeng Chen
Feng Chen
YJYue Jiang
Yue Jiang
In meaningful secret image sharing (MSIS), a secret image is divided into n shadows. Each shadow is meaningful and similar to the corresponding cover image. Meaningful shadows can reduce the suspicion of attackers in transmission and facilitate shadow management. Previous MSIS schemes always include pixel expansion, and cross-interference from different shadows may exist when cover images are extremely unnatural images with large black and white blocks. In this article, we propose an MSIS with uniform image quality. A threshold t is set to determine the absolute salient regions. More identical bits are allocated according to saliency values in the absolute saliency region, which can improve image quality. In addition, the new identical bits allocation strategy also adjusts the randomness of the shadow images, generating shadows with uniform image quality and avoiding the cross-interference between different shadows. Experimental results show the effectiveness of our proposed scheme.