Jiahui Wu

Jiahui Wu

Auto-generated profile, based on publicly available information

Jiahui Wu

Department of New Networks, PengCheng Laboratory, Shenzhen, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 December 2017 in Signal Processing
Verified
Journal Article
Closed access
JWJiahui Wu
Jiahui Wu
XLXiaofeng Liao
Xiaofeng Liao
BYBo Yang
Bo Yang

1 January 2018 in Signal Processing
Verified
Journal Article
Closed access
JWJiahui Wu
Jiahui Wu
XLXiaofeng Liao
Xiaofeng Liao
BYBo Yang
Bo Yang

22 July 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
FLFucai Luo
Fucai Luo
HWHaiyan Wang
Haiyan Wang
XYXingfu Yan
Xingfu Yan
JWJiahui Wu
Jiahui Wu
Fine-grained access control systems facilitate granting differential access rights to a set of users and allow flexibility in specifying the access rights of individual users. As an important fine-grained access control technique, key-policy attribute-based encryption (KP-ABE) has been introduced to achieve fine-grained access control over encrypted data, where each ciphertext is associated with an attribute set such that users satisfying the attribute set can decrypt the ciphertext. In the real-world application scenarios of KP-ABE, various situations such as users leaving the system, compromise of users’ private keys, and business requirements frequently occur, necessitating the revocation of decryption rights for large-scale users. To address the user revocation, numerous revocable KP-ABE schemes have been proposed. However, existing revocable KP-ABE schemes are vulnerable to quantum computer attacks. More importantly, existing solutions fail to address the user addition, where users capable of decrypting certain ciphertexts would like to grant decryption rights to others; this is a highly common requirement, such as changes in user decryption permissions and business needs. This paper explores a potentially new avenue of research to address the above issues by introducing a novel cryptographic primitive called key-policy ABE with switchable attributes (KP-ABE-SA). In the KP-ABE-SA system, each ciphertext linked to an attribute set can be transformed into one associated with another (distinct) attribute set, enabling both user revocation and addition. Furthermore, to withstand quantum computer attacks, we construct a KP-ABE-SA scheme based on the Learning with Errors (LWE) assumption, which is widely believed to be quantum-resistant. Finally, we conduct a comprehensive performance evaluation of our LWE-based KP-ABE-SA scheme, and the experimental results show that the proposed LWE-based KP-ABE-SA scheme is efficient and practical.

13 February 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
JWJiahui Wu
Jiahui Wu
WZWeizhe Zhang
Weizhe Zhang
FLFucai Luo
Fucai Luo
Cross-silo federated learning (FL) enables multiple clients to collaboratively train a machine learning model without sharing training data, but privacy in FL remains a major challenge. Techniques using homomorphic encryption (HE) have been designed to solve this but bring their own challenges. Many techniques using single-key HE (SKHE) require clients to fully trust each other to prevent privacy disclosure between clients. However, fully trusted clients are hard to ensure in practice. Other techniques using multi-key HE (MKHE) aim to protect privacy from untrusted clients but lead to the disclosure of training results in public channels by untrusted third parties, e.g., the public cloud server. Besides, MKHE has higher computation and communication complexity compared with SKHE. We present a new FL protocol ESAFL that leverages a novel efficient and secure additively HE (ESHE) based on the hard problem of ring learning with errors. ESAFL can ensure the security of training data between untrusted clients and protect the training results against untrusted third parties. In addition, theoretical analyses present that ESAFL outperforms current techniques using MKHE in computation and communication, and intensive experiments show that ESAFL achieves approximate $204\times$−$953\times$ and $11\times$−$14\times$ training speedup while reducing the communication burden by $77\times$−$109\times$ and $1.25\times$−$2\times$ compared with the state-of-the-art FL models using SKHE.

17 January 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
DLDong Li
Dong Li
Qingguo LüQingguo Lü
Qingguo Lü
XLXiaofeng Liao
Xiaofeng Liao
TXTao Xiang
Tao Xiang
JWJiahui Wu
Jiahui Wu
JLJunqing Le
Junqing Le
The increasing privacy concerns associated with cloud-assisted image retrieval have captured the attention of researchers. However, a significant number of current research endeavors encounter limitations, including suboptimal accuracy, inefficient retrieval, and a lack of effective result verification mechanisms. To address these limitations, we propose an adaptive verifiable privacy-preserving medical image retrieval (AVPMIR) scheme in the outsourced cloud. Specifically, we utilize the convolutional neural network (CNN) ResNet50 model to extract the feature of each medical image within the dataset of the medical institution, aiming to enhance retrieval accuracy. To enhance retrieval efficiency, we build an encryption searchable index based on a mini-batch $k$ -means clustering algorithm. Furthermore, we present an index merging method in which multi-data owners build a different index tree according to different standards. To check the correctness of the returned results from the cloud server, we construct an adaptive verification framework for the obtained results based on chameleon hash and BLS signature. To provide strong security for the medical image datasets, we design an improved logistic chaotic mapping algorithm. The security analysis demonstrates that AVPMIR can defend various threat models. The experiment analysis further indicates that the AVPMIR can improve retrieval efficiency and demonstrate its practicability.

12 December 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
DLDong Li
Dong Li
JWJiahui Wu
Jiahui Wu
JLJunqing Le
Junqing Le
Qingguo LüQingguo Lü
Qingguo Lü
XLXiaofeng Liao
Xiaofeng Liao
TXTao Xiang
Tao Xiang
With the widespread use of cloud storage technology by individuals and organizations, data providers usually send their data to cloud for storage to reduce memory pressure, and allow the users to retrieve these data, which has become the trend of rapid data retrieval. To guarantee the data confidentiality, several research works have been developed on encrypted cloud data for ranked multi-keyword retrieval. Nevertheless, most of these schemes are disabled since they cannot resist keyword guessing attacks. Moreover, the ranked top- $K$ search results obtained by the subscriber from the encrypted cloud data are inaccurate. To overcome these drawbacks, we design a novel and efficient privacy-preserving ranked multi-keyword retrieval scheme (named as PRMKR) in this paper. With PRMKR, the data and the inverted indexes which belong to the data provider can be securely transferred to the cloud server. In addition, a registered subscriber can request accurate retrieval services without compromising his/her trapdoor information to the cloud server. Specifically, we design an encryption searchable plugin-in server and lower dimensional inverted indexes vector for data owners, which can further guarantee data confidentiality of the data owner and improve search efficiency, respectively. Our rigorous security proof demonstrates that PRMKR can withstand keyword guessing attacks. Finally, experimental evaluations confirm that PRMKR has decent computational and communication efficiency.