Meiqing Wang

Meiqing Wang

Auto-generated profile, based on publicly available information

Meiqing Wang

School of Mathematics and Statistics, Fuzhou University, Fuzhou, Fujian, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
13 February 2023 in Information Sciences
Verified
Journal Article
Closed access
MYMing Yang
Ming Yang
HCHang Cheng
Hang Cheng
FCFei Chen
Fei Chen
Ximeng LiuXimeng Liu
Ximeng Liu
MWMeiqing Wang
Meiqing Wang
XLXibin Li
Xibin Li

20 June 2019 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Open access
HCHang Cheng
Hang Cheng
Huaxiong WangHuaxiong Wang
Huaxiong Wang
Ximeng LiuXimeng Liu
Ximeng Liu
YFYan Fang
Yan Fang
MWMeiqing Wang
Meiqing Wang
XZXiaojun Zhang
Xiaojun Zhang
Person re-identification (Re-ID) has attracted extensive attention due to its potential to identify a person of interest from different surveillance videos. With the increasing amount of the surveillance videos, high computation and storage costs have posed a great challenge for the resource-constrained users. In recent years, the cloud storage services have made a large volume of video data outsourcing become possible. However, person Re-ID over outsourced surveillance videos could lead to a security threat, i.e., the privacy leakage of the innocent person in these videos. Therefore, we propose an efFicient privAcy-preseRving peRson Re-ID Scheme (FARRIS) over outsourced surveillance videos, which can ensure the privacy of the detected person while providing the person Re-ID service. Specifically, FARRIS exploits the convolutional neural network (CNN) and kernels based supervised hashing (KSH) to extract the efficient person Re-ID feature. Then, we design a secret sharing based Hamming distance computation protocol to allow cloud servers to calculate similarities among obfuscated feature indexes. Furthermore, a dual Merkle hash trees based verification is proposed, which permits users to validate the correctness of the matching results. The extensive experimental results and security analysis demonstrate that FARRIS can work efficiently, without compromising the privacy of the involved person.

27 April 2020 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
HCHang Cheng
Hang Cheng
Ximeng LiuXimeng Liu
Ximeng Liu
Huaxiong WangHuaxiong Wang
Huaxiong Wang
YFYan Fang
Yan Fang
MWMeiqing Wang
Meiqing Wang
XZXiaopeng Zhao
Xiaopeng Zhao

4 October 2024 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YCYun Chen
Yun Chen
HCHang Cheng
Hang Cheng
HWHaichou Wang
Haichou Wang
Ximeng LiuXimeng Liu
Ximeng Liu
FCFei Chen
Fei Chen
MWMeiqing Wang
Meiqing Wang
Image manipulation has sparked widespread concern due to its potential security threats on the Internet. The boundary between the authentic and manipulated region exhibits artifacts in image manipulation localization (IML). These artifacts are more pronounced in heterogeneous image splicing and homogeneous image copy-move manipulation, while they are more subtle in removal and inpainting manipulated images. However, existing methods for image manipulation detection tend to capture boundary artifacts via explicit edge features and have limitations in effectively addressing subtle artifacts. Besides, feature redundancy caused by the powerful feature extraction capability of large models may prevent accurate identification of manipulated artifacts, exhibiting a high false-positive rate. To solve these problems, we propose a novel edge-aware network (EAN) to capture boundary artifacts effectively. This network treats the image manipulation localization problem as a segmentation problem inside and outside the boundary. In EAN, we develop an edge-aware mechanism to refine implicit and explicit edge features by the interaction of adjacent features. This approach directs the encoder to prioritize the desired edge information. Also, we design a multi-feature fusion strategy combined with an improved attention mechanism to enhance key feature representation significantly for mitigating the effects of feature redundancy. We perform thorough experiments on diverse datasets, and the outcomes confirm the efficacy of the suggested approach, surpassing leading manipulation localization techniques in the majority of scenarios.

11 March 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
YXYongliang Xu
Yongliang Xu
HCHang Cheng
Hang Cheng
Jiguo LiJiguo Li
Jiguo Li
Ximeng LiuXimeng Liu
Ximeng Liu
XZXinpeng Zhang
Xinpeng Zhang
MWMeiqing Wang
Meiqing Wang
Data confidentiality, a fundamental security element for dependable cloud storage, has been drawing widespread concern. Public-key encryption with keyword search (PEKS) has emerged as a promising approach for privacy protection while enabling efficient retrieval of encrypted data. One of the typical applications of PEKS is searching sensitive electronic medical records (EMR) in healthcare clouds. However, many traditional countermeasures fall short of balancing privacy protection with search efficiency, and they often fail to support multi-user EMR sharing. To resolve these challenges, we propose a novel lightweight multi-user public-key authenticated encryption scheme with keyword search (LM-PAEKS). Our design effectively counters the inside keyword guessing attack (IKGA) while maintaining the sizes of ciphertext and trapdoor constant in multi-user scenarios. The novelty of our approach relies on introducing a dedicated receiver server that skillfully transforms the complex many-to-many relationship between senders and receivers into a streamlined one-to-one relationship. This transformation prevents the sizes of ciphertext and trapdoor from scaling linearly with the number of participants. Our approach ensures ciphertext indistinguishability and trapdoor privacy while avoiding bilinear pairing operations on the client side. Comparative performance analysis demonstrates that LM-PAEKS features significant computational efficiency while meeting higher security requirements, positioning it as a robust alternative to existing solutions.

7 January 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YXYongliang Xu
Yongliang Xu
HCHang Cheng
Hang Cheng
Ximeng LiuXimeng Liu
Ximeng Liu
CJChangsong Jiang
Changsong Jiang
XZXinpeng Zhang
Xinpeng Zhang
MWMeiqing Wang
Meiqing Wang
Collaborative searchable encryption for group data sharing enables a consortium of authorized users to collectively generate trapdoors and decrypt search results. However, existing countermeasures may be vulnerable to a keyword guessing attack (KGA) initiated by malicious insiders, compromising the confidentiality of keywords. Simultaneously, these solutions often fail to guard against hostile manufacturers embedding backdoors, leading to potential information leakage. To address these challenges, we propose a novel privacy-preserving collaborative searchable encryption (PCSE) scheme tailored for group data sharing. This scheme introduces a dedicated keyword server to export server-derived keywords, thereby withstanding KGA attempts. Based on this, PCSE deploys cryptographic reverse firewalls to thwart subversion attacks. To overcome the single point of failure inherent in a single keyword server, the export of server-derived keywords is collaboratively performed by multiple keyword servers. Furthermore, PCSE extends its capabilities to support efficient multi-keyword searches and result verification and incorporates a rate-limiting mechanism to effectively slow down adversaries’ online KGA attempts. Security analysis demonstrates that our scheme can resist KGA and subversion attack. Theoretical analyses and experimental results show that PCSE is significantly more practical for group data sharing systems compared with state-of-the-art works.