Meiqing Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Meiqing Wang has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Hang Cheng
School of Mathematics and Statistics, Fuzhou University, Fuzhou, China
12 shared publications - Ximeng Liu
College of Computer and Data Science, Fuzhou University, Fuzhou, China
9 shared publications - Fei Chen
Fuzhou University
6 shared publications - Xinpeng Zhang
Fudan University, Shanghai, China
6 shared publications - Yongliang Xu
School of Mathematics and Statistics, Fuzhou University, Fuzhou, China
4 shared publications Choi-Hong Lai
School of Mathematics and Statistics, Fuzhou University, No.2. Wulongjiang North Avenue, Fuzhou, China
3 shared publications
Latest Publications
- Open Access
- 26 June 2026
- Published by Elsevier in SSRN Electronic Journal
RefinedStyle: Text-Conditioned Style Attention Reconstruction for Training-Free Style Transfer
Recent advances in diffusion models have substantially improved image style transfer. However, text-driven style transfer remains challenging because models often overfit to the reference style and exhibit insufficient text-image alignment. We propose RefinedStyle, a training-free text-driven style-transfer framework that reconstructs reference-driven style attention into a text-conditioned style representation while balancing textual semantics with style guidance. Specifically, SFCA forms text-aware style attention by fusing modality-specific key/value representations, and Adapter-AdaIN further reconstructs the injected style attention by using text attention as the content carrier and SFCA-enhanced style attention as the source of style statistics. Built on IP-Adapter, RefinedStyle generates style-customized images that preserve text content while mitigating content leakage and style overfitting. We also analyze the effective denoising stages for style injection and show that injecting style information during the early denoising stage, e.g., the first 20 steps in our 50-step inference setting, is sufficient for effective style transfer. Extensive experiments demonstrate that RefinedStyle improves text-image alignment while preserving reference-style consistency. Code will be made available upon acceptance.
- 26 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessRefinedStyle: Text-Conditioned Style Attention Reconstruction for Training-Free Style Transfer
Recent advances in diffusion models have substantially improved image style transfer. However, text-driven style transfer remains challenging because models often overfit to the reference style and exhibit insufficient text-image alignment. We propose RefinedStyle, a training-free text-driven style-transfer framework that reconstructs reference-driven style attention into a text-conditioned style representation while balancing textual semantics with style guidance. Specifically, SFCA forms text-aware style attention by fusing modality-specific key/value representations, and Adapter-AdaIN further reconstructs the injected style attention by using text attention as the content carrier and SFCA-enhanced style attention as the source of style statistics. Built on IP-Adapter, RefinedStyle generates style-customized images that preserve text content while mitigating content leakage and style overfitting. We also analyze the effective denoising stages for style injection and show that injecting style information during the early denoising stage, e.g., the first 20 steps in our 50-step inference setting, is sufficient for effective style transfer. Extensive experiments demonstrate that RefinedStyle improves text-image alignment while preserving reference-style consistency. Code will be made available upon acceptance.
- 18 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (5) , 7211-7222
Adaptive Selective State Mechanism for Enhancing Image Manipulation Localization
As societal focus on image authenticity grows, image manipulation localization has become a crucial and challenging task in computer vision. Current methods relying on dual-stream encoders to extract features from both RGB and noise images often suffer from feature misalignment and information loss during fusion. Moreover, many localization methods use loss functions to identify manipulated areas, but balancing weights between manipulated regions and edges remains challenging. To address these challenges, we propose a novel method that integrates features in dual-stream networks with adaptive selective state spaces. By treating the two output features from the dual-stream encoder as system inputs, we construct a feature space that optimizes the system’s state space. Introducing temporal dynamics enriches the feature representation and enhances learning capabilities, significantly improving the accuracy and reliability of image manipulation localization. Additionally, we propose an edge residual review module that refines the boundaries of manipulated regions from the preliminary output, subsequently enhancing the input features for improved re-localization accuracy. Extensive experiments demonstrate that our approach yields competitive results on diverse large-scale image datasets, outperforming most state-of-the-art methods in both precision and robustness.
- 18 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (5) , 7211-7222
Adaptive Selective State Mechanism for Enhancing Image Manipulation Localization
As societal focus on image authenticity grows, image manipulation localization has become a crucial and challenging task in computer vision. Current methods relying on dual-stream encoders to extract features from both RGB and noise images often suffer from feature misalignment and information loss during fusion. Moreover, many localization methods use loss functions to identify manipulated areas, but balancing weights between manipulated regions and edges remains challenging. To address these challenges, we propose a novel method that integrates features in dual-stream networks with adaptive selective state spaces. By treating the two output features from the dual-stream encoder as system inputs, we construct a feature space that optimizes the system’s state space. Introducing temporal dynamics enriches the feature representation and enhances learning capabilities, significantly improving the accuracy and reliability of image manipulation localization. Additionally, we propose an edge residual review module that refines the boundaries of manipulated regions from the preliminary output, subsequently enhancing the input features for improved re-localization accuracy. Extensive experiments demonstrate that our approach yields competitive results on diverse large-scale image datasets, outperforming most state-of-the-art methods in both precision and robustness.
- 31 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 2412-2429
Blockchain-Based Secure Federated Learning With Improved Consensus Protocol and Personalized Differential Privacy
Federated learning (FL) enables multiple clients to collaboratively train machine learning (ML) models without exposing their private data. The recent surge in poisoning attacks and privacy leakage against FL has driven the development of secure federated learning (SFL) solutions. However, existing SFL schemes show inadequate performance when confronted with non-independent and identically distributed ( non-IID) data. In addition, traditional SFL architectures are prone to single point of failure (SPOF) issues due to the heavy computational and communication burdens imposed on a single server. In response to these issues, a novel blockchain-based secure federated learning (BSFL) framework is proposed in this paper. Specifically, we devise a proof of verification (PoV) consensus protocol to identify poisoning attacks under non-IID situations, while preventing the waste of computational and communication resources. Subsequently, we present a personalized differential privacy (PDP) mechanism, which achieves comprehensive privacy protection with lower noise levels. Furthermore, the integration of the blockchain with the proposed reward mechanism overcomes SPOF and fosters constructive participation through transparent processes. Formal theoretical analysis demonstrates the security, privacy, and efficiency of our framework. Extensive experimental evaluations indicate that BSFL exhibits strong resilience against various poisoning attacks and achieves better model accuracy compared to existing SFL solutions.
- 31 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 2412-2429
Blockchain-Based Secure Federated Learning With Improved Consensus Protocol and Personalized Differential Privacy
Federated learning (FL) enables multiple clients to collaboratively train machine learning (ML) models without exposing their private data. The recent surge in poisoning attacks and privacy leakage against FL has driven the development of secure federated learning (SFL) solutions. However, existing SFL schemes show inadequate performance when confronted with non-independent and identically distributed ( non-IID) data. In addition, traditional SFL architectures are prone to single point of failure (SPOF) issues due to the heavy computational and communication burdens imposed on a single server. In response to these issues, a novel blockchain-based secure federated learning (BSFL) framework is proposed in this paper. Specifically, we devise a proof of verification (PoV) consensus protocol to identify poisoning attacks under non-IID situations, while preventing the waste of computational and communication resources. Subsequently, we present a personalized differential privacy (PDP) mechanism, which achieves comprehensive privacy protection with lower noise levels. Furthermore, the integration of the blockchain with the proposed reward mechanism overcomes SPOF and fosters constructive participation through transparent processes. Formal theoretical analysis demonstrates the security, privacy, and efficiency of our framework. Extensive experimental evaluations indicate that BSFL exhibits strong resilience against various poisoning attacks and achieves better model accuracy compared to existing SFL solutions.
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 3234-3246
Lightweight Multi-User Public-Key Authenticated Encryption With Keyword Search
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.
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 3234-3246
Lightweight Multi-User Public-Key Authenticated Encryption With Keyword Search
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
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (5) , 4558-4572
PCSE: Privacy-Preserving Collaborative Searchable Encryption for Group Data Sharing in Cloud Computing
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.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (5) , 4558-4572
PCSE: Privacy-Preserving Collaborative Searchable Encryption for Group Data Sharing in Cloud Computing
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.
- 4 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (2) , 1591-1601
EAN: Edge-Aware Network for Image Manipulation Localization
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.
- 4 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (2) , 1591-1601
EAN: Edge-Aware Network for Image Manipulation Localization
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.
- 5 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (2) , 2520-2533
Lightweight Privacy-Preserving Feature Extraction for EEG Signals Under Edge Computing
The health-related Internet of Things (IoT) plays an irreplaceable role in the collection, analysis, and transmission of medical data. As a device of the health-related IoT, the electroencephalogram (EEG) has long been a powerful tool for physiological and clinical brain research, which contains a wealth of personal information. Due to its rich computational/storage resources, cloud computing is a promising solution to extract the sophisticated feature of massive EEG signals in the age of big data. However, it needs to solve both response latency and privacy leakage. To reduce latency between users and servers while ensuring data privacy, we propose a privacy-preserving feature extraction scheme, called LightPyFE, for EEG signals in the edge computing environment. In this scheme, we design an outsourced computing toolkit, which allows the users to achieve a series of secure integer and floating-point computing operations. During the implementation, LightPyFE can ensure that the users just perform the encryption and decryption operations, where all computing tasks are outsourced to edge servers for specific processing. Theoretical analysis and experimental results have demonstrated that our scheme can successfully achieve privacy-preserving feature extraction for EEG signals, and is practical yet effective.
- 5 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (2) , 2520-2533
Lightweight Privacy-Preserving Feature Extraction for EEG Signals Under Edge Computing
The health-related Internet of Things (IoT) plays an irreplaceable role in the collection, analysis, and transmission of medical data. As a device of the health-related IoT, the electroencephalogram (EEG) has long been a powerful tool for physiological and clinical brain research, which contains a wealth of personal information. Due to its rich computational/storage resources, cloud computing is a promising solution to extract the sophisticated feature of massive EEG signals in the age of big data. However, it needs to solve both response latency and privacy leakage. To reduce latency between users and servers while ensuring data privacy, we propose a privacy-preserving feature extraction scheme, called LightPyFE, for EEG signals in the edge computing environment. In this scheme, we design an outsourced computing toolkit, which allows the users to achieve a series of secure integer and floating-point computing operations. During the implementation, LightPyFE can ensure that the users just perform the encryption and decryption operations, where all computing tasks are outsourced to edge servers for specific processing. Theoretical analysis and experimental results have demonstrated that our scheme can successfully achieve privacy-preserving feature extraction for EEG signals, and is practical yet effective.
- 9 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 34 (1) , 97-109
DeepDIST: A Black-Box Anti-Collusion Framework for Secure Distribution of Deep Models
Due to enormous computing and storage overhead for well-trained Deep Neural Network (DNN) models, protecting the intellectual property of model owners is a pressing need. As the commercialization of deep models is becoming increasingly popular, the pre-trained models delivered to users may suffer from being illegally copied, redistributed, or abused. In this paper, we propose DeepDIST, the first end-to-end secure DNNs distribution framework in a black-box scenario. Specifically, our framework adopts a dual-level fingerprint (FP) mechanism to provide reliable ownership verification, and proposes two equivalent transformations that can resist collusion attacks, plus a newly designed similarity loss term to improve the security of the transformations. Unlike the existing passive defense schemes that detect colluding participants, we introduce an active defense strategy, namely damaging the performance of the model after the malicious collusion. The extensive experimental results show that DeepDIST can maintain the accuracy of the host DNN after embedding fingerprint conducted for true traitor tracing, and is robust against several popular model modifications. Furthermore, the anti-collusion effect is evaluated on two typical classification tasks (10-class and 100-class), and the proposed DeepDIST can drop the prediction accuracy of the collusion model to 10% and 1% (random guess), respectively.
- 9 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 34 (1) , 97-109
DeepDIST: A Black-Box Anti-Collusion Framework for Secure Distribution of Deep Models
Due to enormous computing and storage overhead for well-trained Deep Neural Network (DNN) models, protecting the intellectual property of model owners is a pressing need. As the commercialization of deep models is becoming increasingly popular, the pre-trained models delivered to users may suffer from being illegally copied, redistributed, or abused. In this paper, we propose DeepDIST, the first end-to-end secure DNNs distribution framework in a black-box scenario. Specifically, our framework adopts a dual-level fingerprint (FP) mechanism to provide reliable ownership verification, and proposes two equivalent transformations that can resist collusion attacks, plus a newly designed similarity loss term to improve the security of the transformations. Unlike the existing passive defense schemes that detect colluding participants, we introduce an active defense strategy, namely damaging the performance of the model after the malicious collusion. The extensive experimental results show that DeepDIST can maintain the accuracy of the host DNN after embedding fingerprint conducted for true traitor tracing, and is robust against several popular model modifications. Furthermore, the anti-collusion effect is evaluated on two typical classification tasks (10-class and 100-class), and the proposed DeepDIST can drop the prediction accuracy of the collusion model to 10% and 1% (random guess), respectively.
- Open Access
- 26 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (5) , 1154
Local Property of Depth Information in 3D Images and Its Application in Feature Matching
In image registration or image matching, the feature extracted by using the traditional methods does not include the depth information which may lead to a mismatch of keypoints. In this paper, we prove that when the camera moves, the ratio of the depth difference of a keypoint and its neighbor pixel before and after the camera movement approximates a constant. That means the depth difference of a keypoint and its neighbor pixel after normalization is invariant to the camera movement. Based on this property, all the depth differences of a keypoint and its neighbor pixels constitute a local depth-based feature, which can be used as a supplement of the traditional feature. We combine the local depth-based feature with the SIFT feature descriptor to form a new feature descriptor, and the experimental results show the feasibility and effectiveness of the new feature descriptor.
- 26 February 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (5) , 1154
Open AccessLocal Property of Depth Information in 3D Images and Its Application in Feature Matching
In image registration or image matching, the feature extracted by using the traditional methods does not include the depth information which may lead to a mismatch of keypoints. In this paper, we prove that when the camera moves, the ratio of the depth difference of a keypoint and its neighbor pixel before and after the camera movement approximates a constant. That means the depth difference of a keypoint and its neighbor pixel after normalization is invariant to the camera movement. Based on this property, all the depth differences of a keypoint and its neighbor pixels constitute a local depth-based feature, which can be used as a supplement of the traditional feature. We combine the local depth-based feature with the SIFT feature descriptor to form a new feature descriptor, and the experimental results show the feasibility and effectiveness of the new feature descriptor.
- 13 February 2023
- Published by Elsevier in Information Sciences
- Vol. 630, 158-172
Model poisoning attack in differential privacy-based federated learning
- 13 February 2023
- Published by Elsevier in Information Sciences
- Vol. 630, 158-172
Model poisoning attack in differential privacy-based federated learning