Guanxiong Ha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Guanxiong Ha has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Chunfu Jia
Nankai University
17 shared publications - Mingyue Li
Hebei University
7 shared publications - Xiaowei Ge
College of Cyber Science, Tianjin Key Laboratory of Network and Data Security Technology, and DISSEC, Nankai University, Tianjin, China
5 shared publications - Rongxi Wang
Nankai University, Tianjin Key Laboratory of Network and Data Security Technology, Key Laboratory of Data and Intelligent System Security Ministry of Education (DISSec)
4 shared publications - Zhen Su
Nankai University, Tianjin Key Laboratory of Network and Data Security Technology, Key Laboratory of Data and Intelligent System Security Ministry of Education (DISSec)
4 shared publications - Qiaowen Jia
University of Chinese Academy of Sciences, Beijing, China
3 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (12) , 4375-4389
PopDedup: Defending Against Malicious Cloud Behavior in Popularity-Based Encrypted Deduplication
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (12) , 4375-4389
PopDedup: Defending Against Malicious Cloud Behavior in Popularity-Based Encrypted Deduplication
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 22590-22604
LMCR: Lossless Multi-Probe Cross-Modal Retrieval With Privacy Preservation
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 22590-22604
LMCR: Lossless Multi-Probe Cross-Modal Retrieval With Privacy Preservation
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4944-4953
TailorProtect: Meta-learning-based Tailored Text-enhanced Facial Privacy Protection
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4944-4953
Open AccessTailorProtect: Meta-learning-based Tailored Text-enhanced Facial Privacy Protection
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (7) , 3441-3454
Differentiated Privacy-Preserving Task Assignment Scheme Based on Generative Adversarial Networks in Spatial Crowdsourcing
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (7) , 3441-3454
Differentiated Privacy-Preserving Task Assignment Scheme Based on Generative Adversarial Networks in Spatial Crowdsourcing
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (2) , 889-903
Efficient and Secure Dynamic Auditing and Deduplication in Multi-Cloud Storage
Existing schemes that combine provable data possession (PDP) and proof of ownership (PoW) for data integrity and efficient deduplication face several practical shortcomings. First, integrity tag generation relies on data block indices or user keys, causing redundant tags for duplicate data and increasing storage overhead. Second, dynamic operations like data insertion and deletion require linear scanning, resulting in a high computational complexity of $O(N)$. Furthermore, in multi-cloud backup environments, existing mechanisms struggle to ensure consistency between data ciphertexts and their tags. If an audit fails, locating damaged replicas requires repetitive verification by the third-party auditor (TPA), leading to high inefficiency. To overcome these issues, this paper proposes a multi-cloud data auditing mechanism (MDAM), which is based on an authenticated data structure called variable merkle hash tree (VMHT). MDAM utilizes message-derived RSA tags and secret-sharing-based proxy re-signing to achieve efficient deduplication and secure user-tag association. By integrating updatable block-level message-locked encryption (UMLE) technology with a variable branching structure, it supports dynamic updates with an $O(\log N)$ complexity, saving storage and improving update efficiency. Additionally, MDAM employs a dynamic Bloom filter for efficient fault localization. Experimental results demonstrate that MDAM surpasses existing schemes in computational overhead, update efficiency, and fault localization performance.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (2) , 889-903
Efficient and Secure Dynamic Auditing and Deduplication in Multi-Cloud Storage
Existing schemes that combine provable data possession (PDP) and proof of ownership (PoW) for data integrity and efficient deduplication face several practical shortcomings. First, integrity tag generation relies on data block indices or user keys, causing redundant tags for duplicate data and increasing storage overhead. Second, dynamic operations like data insertion and deletion require linear scanning, resulting in a high computational complexity of $O(N)$. Furthermore, in multi-cloud backup environments, existing mechanisms struggle to ensure consistency between data ciphertexts and their tags. If an audit fails, locating damaged replicas requires repetitive verification by the third-party auditor (TPA), leading to high inefficiency. To overcome these issues, this paper proposes a multi-cloud data auditing mechanism (MDAM), which is based on an authenticated data structure called variable merkle hash tree (VMHT). MDAM utilizes message-derived RSA tags and secret-sharing-based proxy re-signing to achieve efficient deduplication and secure user-tag association. By integrating updatable block-level message-locked encryption (UMLE) technology with a variable branching structure, it supports dynamic updates with an $O(\log N)$ complexity, saving storage and improving update efficiency. Additionally, MDAM employs a dynamic Bloom filter for efficient fault localization. Experimental results demonstrate that MDAM surpasses existing schemes in computational overhead, update efficiency, and fault localization performance.
- 19 January 2026
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 97
Practical collusion-resistant conjunctive dynamic searchable encryption with result pattern hiding
- 19 January 2026
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 97
Practical collusion-resistant conjunctive dynamic searchable encryption with result pattern hiding
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 6484-6500
Privacy-Preserving Image Retrieval With Deep Learning in Edge Computing
With the rapid development of edge computing and the explosive growth of image data generated by IoT and mobile devices, an increasing number of users prefer to perform privacy-preserving image storage and retrieval tasks directly at the edge. However, existing solutions typically rely on basic encryption methods and shallow feature extraction, leading to inadequate data security and poor retrieval performance. In this paper, we propose a Dynamic Multi-Stage Encryption (DMSE) method combined with a semantically rich fusion feature to achieve high-precision and privacy-preserving image retrieval in edge environments. Specifically, the proposed method first divides the image into blocks and applies random shuffling, followed by channel and pixel-level XOR encryption to generate a hybrid encrypted image. Then, we extract global features from the encrypted image using the histogram of Discrete Cosine Transform (DCT) coefficients. In addition, a multi-scale convolution block is designed to extract stable and robust local features under encryption. Finally, deep learning is utilized to fuse the global and local features, capturing both the holistic structure and fine-grained semantics of the image. This comprehensive feature representation significantly improves retrieval accuracy while ensuring privacy. Extensive experiments validate that our approach outperforms existing methods in both security and retrieval effectiveness, making it well-suited for edge computing scenarios with limited resources and high privacy demands.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 6484-6500
Privacy-Preserving Image Retrieval With Deep Learning in Edge Computing
With the rapid development of edge computing and the explosive growth of image data generated by IoT and mobile devices, an increasing number of users prefer to perform privacy-preserving image storage and retrieval tasks directly at the edge. However, existing solutions typically rely on basic encryption methods and shallow feature extraction, leading to inadequate data security and poor retrieval performance. In this paper, we propose a Dynamic Multi-Stage Encryption (DMSE) method combined with a semantically rich fusion feature to achieve high-precision and privacy-preserving image retrieval in edge environments. Specifically, the proposed method first divides the image into blocks and applies random shuffling, followed by channel and pixel-level XOR encryption to generate a hybrid encrypted image. Then, we extract global features from the encrypted image using the histogram of Discrete Cosine Transform (DCT) coefficients. In addition, a multi-scale convolution block is designed to extract stable and robust local features under encryption. Finally, deep learning is utilized to fuse the global and local features, capturing both the holistic structure and fine-grained semantics of the image. This comprehensive feature representation significantly improves retrieval accuracy while ensuring privacy. Extensive experiments validate that our approach outperforms existing methods in both security and retrieval effectiveness, making it well-suited for edge computing scenarios with limited resources and high privacy demands.
- 12 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (1) , 590-603
Similarity-Aware Defense Scheme for Online Brute-Force Attacks in Encrypted Deduplication
Encrypted deduplication is appealing to cloud storage systems, as it provides both storage savings and data confidentiality. Unfortunately, it is vulnerable to brute-force attacks (BFAs), which poses a severe security threat. Server-aided message-locked encryption (MLE) was proposed to mitigate BFAs by deploying a key server to perform rate limiting for key generation requests. However, the existing rate-limiting strategy has several limitations: (1) Vulnerable to Sybil BFAs; (2) Improper rate-limiting thresholds; (3) Inability to identify requests for duplicate data. To address these limitations, we present a similarity-aware rate-limiting strategy based on the following observations: (i) the candidate data used for online BFAs are generally similar; (ii) there won't be a lot of similar data in a short time period in real-world datasets. Then, we propose two similarity-aware defense schemes, SADS-I and SADS-II. SADS-I incorporates data similarity into the key generation and rate limiting using a partially oblivious pseudorandom function (POPRF) but leaks data similarity. SADS-II leverages Intel SGX to protect data similarity and improve performance. Through evaluation using real-world datasets, we demonstrate that our schemes exhibit high data upload performance and provide stronger security protection against online BFAs compared to the existing server-aided MLE.
- 12 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (1) , 590-603
Similarity-Aware Defense Scheme for Online Brute-Force Attacks in Encrypted Deduplication
Encrypted deduplication is appealing to cloud storage systems, as it provides both storage savings and data confidentiality. Unfortunately, it is vulnerable to brute-force attacks (BFAs), which poses a severe security threat. Server-aided message-locked encryption (MLE) was proposed to mitigate BFAs by deploying a key server to perform rate limiting for key generation requests. However, the existing rate-limiting strategy has several limitations: (1) Vulnerable to Sybil BFAs; (2) Improper rate-limiting thresholds; (3) Inability to identify requests for duplicate data. To address these limitations, we present a similarity-aware rate-limiting strategy based on the following observations: (i) the candidate data used for online BFAs are generally similar; (ii) there won't be a lot of similar data in a short time period in real-world datasets. Then, we propose two similarity-aware defense schemes, SADS-I and SADS-II. SADS-I incorporates data similarity into the key generation and rate limiting using a partially oblivious pseudorandom function (POPRF) but leaks data similarity. SADS-II leverages Intel SGX to protect data similarity and improve performance. Through evaluation using real-world datasets, we demonstrate that our schemes exhibit high data upload performance and provide stronger security protection against online BFAs compared to the existing server-aided MLE.
- 2 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (12) , 3995-4009
Efficient Conjunctive Geometric Range Query Over Encrypted Spatial Data With Learned Index
With the increasing popularity of geo-positioning technologies and mobile Internet, spatial data query services have attracted extensive attention. To protect the confidentiality of sensitive information outsourced to cloud servers, much efforts have been devoted to designing geometric range query schemes over encrypted spatial data without affecting availability. However, existing works focus on the privacy-preserving schemes with traditional tree indexes, causing more computing and storage issues. In this paper, we propose an efficient conjunctive geometric range query scheme over encrypted spatial data with a learned index. In particular, we design a new privacy-preserving learned index for spatial data to reduce the search space and storage overhead. The main idea is to add noise disturbance to the objective function instead of directly adding it to output results, reducing the leakage of private information and ensuring the correctness of output results. Moreover, we propose a spatial segmentation algorithm to avoid accessing a large number of unnecessary Z codes in the query process. The formal security analysis shows that our scheme ensures index data security and query privacy. Simulation results show that the query efficiency is improved while the storage overhead is significantly reduced compared with the state-of-the-art schemes.
- 2 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (12) , 3995-4009
Efficient Conjunctive Geometric Range Query Over Encrypted Spatial Data With Learned Index
With the increasing popularity of geo-positioning technologies and mobile Internet, spatial data query services have attracted extensive attention. To protect the confidentiality of sensitive information outsourced to cloud servers, much efforts have been devoted to designing geometric range query schemes over encrypted spatial data without affecting availability. However, existing works focus on the privacy-preserving schemes with traditional tree indexes, causing more computing and storage issues. In this paper, we propose an efficient conjunctive geometric range query scheme over encrypted spatial data with a learned index. In particular, we design a new privacy-preserving learned index for spatial data to reduce the search space and storage overhead. The main idea is to add noise disturbance to the objective function instead of directly adding it to output results, reducing the leakage of private information and ensuring the correctness of output results. Moreover, we propose a spatial segmentation algorithm to avoid accessing a large number of unnecessary Z codes in the query process. The formal security analysis shows that our scheme ensures index data security and query privacy. Simulation results show that the query efficiency is improved while the storage overhead is significantly reduced compared with the state-of-the-art schemes.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (11) , 3710-3721
Scalable Encrypted Deduplication Based on Location-Hiding Secret Sharing of Data Keys
Encrypted deduplication is attractive because it can provide high storage efficiency while protecting data privacy. Most existing schemes achieve encrypted deduplication against brute-force attacks (BFAs) based on server-aided encryption. Unfortunately, the centralized key server in server-aided encryption can potentially become a single point of failure. To this end, distributed server-aided encryption is presented, which splits a system-level master key into multiple shares and distributes them across several key servers. However, it is hard to improve security and scalability with this method simultaneously. This paper presents a secure and scalable encrypted deduplication scheme ScalaDep. ScalaDep achieves a new design paradigm centered on location-hiding secret sharing of data keys. As the number of deployed key servers increases, the attack cost of adversaries increases while the number of requests handled by each key server decreases, enhancing both scalability and security. Furthermore, we propose a two-phase duplicate detection method for our paradigm, which utilizes short hashes and key identifiers to achieve secure duplicate detection against BFAs. Additionally, based on the allreduce algorithm, ScalaDep enables all key servers to collaboratively record the number of client requests and resist online BFAs by enforcing rate limiting. Security analysis and performance evaluation demonstrate the security and efficiency of ScalaDep.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (11) , 3710-3721
Scalable Encrypted Deduplication Based on Location-Hiding Secret Sharing of Data Keys
Encrypted deduplication is attractive because it can provide high storage efficiency while protecting data privacy. Most existing schemes achieve encrypted deduplication against brute-force attacks (BFAs) based on server-aided encryption. Unfortunately, the centralized key server in server-aided encryption can potentially become a single point of failure. To this end, distributed server-aided encryption is presented, which splits a system-level master key into multiple shares and distributes them across several key servers. However, it is hard to improve security and scalability with this method simultaneously. This paper presents a secure and scalable encrypted deduplication scheme ScalaDep. ScalaDep achieves a new design paradigm centered on location-hiding secret sharing of data keys. As the number of deployed key servers increases, the attack cost of adversaries increases while the number of requests handled by each key server decreases, enhancing both scalability and security. Furthermore, we propose a two-phase duplicate detection method for our paradigm, which utilizes short hashes and key identifiers to achieve secure duplicate detection against BFAs. Additionally, based on the allreduce algorithm, ScalaDep enables all key servers to collaboratively record the number of client requests and resist online BFAs by enforcing rate limiting. Security analysis and performance evaluation demonstrate the security and efficiency of ScalaDep.