Guanxiong Ha

Guanxiong Ha

Auto-generated profile, based on publicly available information

Guanxiong Ha

Nankai University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
15 December 2022 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
MLMingyue Li
Mingyue Li
CJChunfu Jia
Chunfu Jia
RDRuizhong Du
Ruizhong Du
WSWei Shao
Wei Shao
GHGuanxiong Ha
Guanxiong Ha
With the development of various applications of blockchain, blockchain-assisted searchable encryption technology has received wide attention as it can eliminate misbehaviours of malicious servers through the verification and incentive mechanism of blockchain. However, most existing solutions update the encrypted data by means of appending new transactions, which does not scale and wastes resources. In this paper, we explore the potential of redactable blockchain and propose a privacy-preserving dynamic searchable encryption framework (DSE-RB), which is a general scheme that guarantees reliable queries and updates on encrypted data. In particular, we first use transaction-level editing technology to achieve a more flexible update operation of encrypted data without additional transactions while avoiding the waste of storage on the chain. To better support practical applications, we use an index partition method to divide the traditional binary tree index into a plurality of sub-indexes and introduce the concept of polynomials to simplify the whole access control mechanism. We define the security model and conduct repeated experiments on real data sets to test the efficiency. Experimental results and theoretical analysis show the practicability and security of our scheme.

13 June 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Open access
GHGuanxiong Ha
Guanxiong Ha
CJChunfu Jia
Chunfu Jia
YHYixuan Huang
Yixuan Huang
HCHang Chen
Hang Chen
RLRuiqi Li
Ruiqi Li
QJQiaowen Jia
Qiaowen Jia
It is non-trivial to provide semantic security for user data while achieving deduplication in cloud storage. Some studies deploy a trusted party to store deterministic tags for recording data popularity, then provide different levels of security for data according to popularity. However, deterministic tags are vulnerable to offline brute-force attacks. In this paper, we first propose a popularity-based secure deduplication scheme with fully random tags, which avoids the storage of deterministic tags. Our scheme uses homomorphic encryption (HE) to generate comparable random tags to record data popularity and then uses the binary search in the AVL tree to accelerate the tag comparisons. Besides, we find the popularity tamper attacks in existing schemes and design a proof of ownership (PoW) protocol against it. To achieve scalability and updatability, we introduce the multi-key homomorphic proxy re-encryption (MKH-PRE) to design a multi-tenant scheme. Users in different tenants generate tags using different key pairs, and the cross-tenant tags can be compared for equality. Meanwhile, our multi-tenant scheme supports efficient key updates. We give comprehensive security analysis and conduct performance evaluations based on both synthetic and real-world datasets. The results show that our schemes achieve efficient data encryption and key update, and have high storage efficiency.

5 September 2023 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
GHGuanxiong Ha
Guanxiong Ha
CJChunfu Jia
Chunfu Jia
YCYuchen Chen
Yuchen Chen
HCHang Chen
Hang Chen
MLMingyue Li
Mingyue Li
The server-aided encryption is widely used in encrypted deduplication systems to protect against brute-force attacks. However, it is non-trivial to update the master key managed by the key server in existing schemes. Once the master key is leaked, all user data are vulnerable to offline brute-force attacks. In this paper, we extend the server-aided encryption with the updatable encryption (UE) and a dynamic proof of ownership (PoW) protocol to make it support efficient key updates and can be used in the client-side deduplication. Specifically, we design an updatable server-aided encryption scheme based on UE, which achieves efficient encryption and the user-transparent key update for a system-level master key. Besides, to further enable our updatable server-aided encryption to be applicable to the client-side deduplication, we propose a dynamic PoW protocol based on the Merkle tree. Compared to the state-of-the-art PoW scheme, our PoW protects data privacy and allows multi-time leakages for the target file. Finally, we analyze the security of our scheme and present the performance evaluation. The results show that our scheme provides comprehensive security protection for user data and achieves efficient encryption, PoW, and key update.

8 May 2025 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
GHGuanxiong Ha
Guanxiong Ha
YCYuchen Chen
Yuchen Chen
ZCZhipeng Cai
Zhipeng Cai
CJChunfu Jia
Chunfu Jia
XSXuan Shan
Xuan Shan
Side-channel attacks are widespread in client-side deduplication systems, compromising the privacy of outsourced data. The adversary may infer the existence status of data via the deterministic relations between duplication requests and responses to launch side-channel attacks. Random Response (RARE) is one of the state-of-the-art approaches to overcome this issue, where the cloud server returns the randomized deduplication response for two requests at once to mitigate the risk of side-channel attacks. However, it still has some inherent limitations on communication efficiency and security. In this paper, we propose Random Coding Responses (RACORE), a lightweight and secure multi-chunk coding algorithm to address the limitations of RARE. RACORE achieves efficient multi-chunk coding and obfuscation based on the linear mapping induced by a specially constructed pseudo-random matrix. Compared to existing schemes, RACORE can strike a flexible balance between security and performance by adjusting parameters. Further, we present an enhanced composite matrix generation strategy to extend the coding matrix. Based on this strategy, we design an enhanced coding algorithm RACORE$^+$ to improve efficiency. Besides, we put forward a novel redundant chunk selection method to enhance the security of RACORE and RACORE$^+$. Rigorous security analysis and extensive experimental evaluation demonstrate that both RACORE and RACORE$^+$ can effectively resist side-channel attacks while reducing overhead compared to existing schemes.

8 October 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
GHGuanxiong Ha
Guanxiong Ha
XGXiaowei Ge
Xiaowei Ge
CJChunfu Jia
Chunfu Jia
YCYuchen Chen
Yuchen Chen
ZSZhen Su
Zhen Su
Encrypted deduplication is attractive for outsourced storage as it provides both data confidentiality and storage savings. Conventional encrypted deduplication schemes protect data confidentiality based on expensive cryptographic primitives, leading to performance degradation. Recently, several SGX-based schemes have been proposed to accelerate encrypted deduplication. However, these schemes have limitations in both security and performance aspects. This paper presents a SGX-based basic scheme to address these limitations, which first performs proof of ownership (PoW), followed by key generation and data encryption, realizing a new paradigm known as PoW-before-encryption (PbE) to solve the security issue in existing schemes. Additionally, the basic scheme implements deduplication-before-encryption (DbE) to reduce redundant computations, thus improving performance. Despite these improvements, the duplicate detection and key generation in the basic scheme still involve redundant computations. Consequently, we propose an epoch-based enhanced scheme that utilizes data locality and computation deduplication, which caches fresh computations in an epoch and reuses them to enhance performance. We provide a security analysis and evaluate the performance of our schemes using both synthetic and real-world workloads. The results demonstrate that our schemes offer stronger security guarantees while outperforming state-of-the-art schemes in terms of performance.

25 November 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
MLMingyue Li
Mingyue Li
YLYuntao Li
Yuntao Li
RDRuizhong Du
Ruizhong Du
CJChunfu Jia
Chunfu Jia
GHGuanxiong Ha
Guanxiong Ha
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.