Dehua Zhou

Prof. Dehua Zhou

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
25 November 2023 in Journal of Systems Architecture
Verified
Journal Article
Closed access
PLPeng Li
Peng Li
DZDehua Zhou
Dehua Zhou
HMHaobin Ma
Haobin Ma
JLJunzuo Lai
Junzuo Lai

8 June 2021 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
QGQingqing Gan
Qingqing Gan
XWXiaoming Wang
Xiaoming Wang
DHDaxin Huang
Daxin Huang
JLJianwei Li
Jianwei Li
DZDehua Zhou
Dehua Zhou
CWChao Wang
Chao Wang
As a useful cryptographic primitive, searchable symmetric encryption (SSE) has been intensively studied to achieve the secure and efficient retrieval of encrypted data. In order to process update operations, dynamic SSE schemes have been proposed. But recently, file-injection attack has threatened the security of traditional dynamic SSE protocols. Therefore, designing dynamic SSE schemes with forward privacy becomes a new demand to resist the above attack. Meanwhile, multi-client setting is another requirement in SSE techniques where multiple clients can be delegated and have access to the database. However, most of previous forward private schemes were constructed for single-client setting and cannot directly extended to multi-client environment efficiently. To solve the problem, we propose a forward private SSE scheme with support for multi-client in cloud computing. The proposed scheme is based on XOR-homomorphic function and involves two new data structures as private link and public search tree. Security proof demonstrates the proposed scheme can meet the desired secure features. We then conduct experimental evaluation of the proposed scheme and make comparison with related schemes. The result shows that the proposed scheme tends to have high efficiency.

17 August 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YLYongbiao Li
Yongbiao Li
DZDehua Zhou
Dehua Zhou
YLYanling Li
Yanling Li
JWJian Weng
Jian Weng
MSMeng Sun
Meng Sun
Ming LiMing Li
Ming Li
Detection of vehicular congestion has a significant effect on the transportation sector. Several research approaches have been proposed to improve accuracy and efficiency with the advent of the Internet of Vehicles (IoV). Nonetheless, the privacy issue has attracted little attention on congestion detection. In this paper, we put forward a privacy-preserving and efficient scheme for vehicular congestion detection with both horizontal and vertical partitioned vehicular sensing data using Multilayer Perceptron (MLP) approach. Particularly, this work considers that different vehicle manufacturers would choose their encryp- tion systems, which poses a challenge on how to collaboratively train an MLP model on these heterogeneous encrypted sensing data. To address this challenge, we utilize proxy re-encryption and additive homomorphic encryption schemes for preserving the confidentiality of raw sensing data and learning models while maintaining secure computation efficiency. Formally security analysis is provided to demonstrate that our proposed scheme is able to guarantee the privacy of the MLP learning process. Fi- nally, we implement our scheme and evaluate it with real datasets. Experimental results show the effectiveness and feasibility of our MLP learning under multiple encryption systems for vehicular congestion detection.

30 September 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
PLPeng Li
Peng Li
HMHaobin Ma
Haobin Ma
JLJunzuo Lai
Junzuo Lai
DZDehua Zhou
Dehua Zhou
LHLianguan Huang
Lianguan Huang
Junbin FangJunbin Fang
Junbin Fang
Electric vehicles (EVs) bring convenience to public transport while having the potential to increase energy efficiency. With the rapid growth of the number of EVs, cross-domain charging will become a strong demand. Despite massive research on EV charging, existing schemes can hardly meet the security requirements of privacy protection and access control for crossdomain scenarios. Meanwhile, centralized methods bring the single point of failure and data modification. The problem of designing a secure cross-domain EV charging scheme to simultaneously ensure decentralization, privacy and access control has not been studied and remains open. Therefore, in this paper, we design BlockPPA, the first blockchain-assisted privacy-preserving authentication scheme for cross-domain EV charging in order to achieve this purpose. Our scheme makes each EV obtain an attribute-based secret key, which is used to authenticate itself and also anonymously illustrate that it really satisfies a designated access policy when cross-domain authentication happens. Only authorized EVs satisfying the policy do they have the ability to charge. We design three smart contracts and exploit Fabric blockchain to record the domain's detailed information and the authentication record of each cross-domain access from an EV, while achieving the decentralized verification of an authentication request. The results of security and performance analysis show the feasibility and effectiveness of the proposed cross-domain authentication mechanism

28 April 2023 in Sensors
Verified
Journal Article
Open access
PDF file
HMHaobin Ma
Haobin Ma
DZDehua Zhou
Dehua Zhou
PLPeng Li
Peng Li
XWXiaoming Wang
Xiaoming Wang
As medical data become increasingly important in healthcare, it is crucial to have proper access control mechanisms, ensuring that sensitive data are only accessible to authorized users while maintaining privacy and security. Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is an attractive access control solution that can offer effective, fine-grained and secure medical data sharing, but it has two major drawbacks: Firstly, decryption is computationally expensive for resource-limited data users, especially when the access policy has many attributes, limiting its use in large-scale data-sharing scenarios. Secondly, existing schemes are based on data users’ attributes, which can potentially reveal sensitive information about the users, especially in healthcare data sharing, where strong privacy and security are essential. To address these issues, we designed an improved CP-ABE scheme that provides efficient and verifiable outsourced access control with fully hidden policy named EVOAC-HP. In this paper, we utilize the attribute bloom filter to achieve policy hiding without revealing user privacy. For the purpose of alleviating the decryption burden for data users, we also adopt the technique of outsourced decryption to outsource the heavy computation overhead to the cloud service provider (CSP) with strong computing and storage capabilities, while the transformed ciphertext results can be verified by the data user. Finally, with rigorous security and reliable performance analysis, we demonstrate that EVOAC-HP is both practical and effective with robust privacy protection.

26 August 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YHYanlin He
Yanlin He
DZDehua Zhou
Dehua Zhou
QZQiaohong Zhang
Qiaohong Zhang
ZTZiqi Tan
Ziqi Tan
Federated learning is a distributed machine learning framework that enables multiple participants to train models without directly sharing local data. However, sensitive information about participants may still be leaked through their gradients. Furthermore, centralized servers used for aggregating these gradients can be vulnerable to compromise, leading to privacy violations or other malicious attacks. Therefore, it is essential to verify the integrity of the aggregation. In this work, we focus on designing communication-efficient and fast verifiable aggregations for federated learning. We propose VSAFL, a verifiable secure aggregation protocol specifically designed for cross-device federated learning. VSAFL achieves computation and communication cost of O(log2n+log n + 1) and O(logn+l), respectively, for secure aggregation and verification for each user in each epoch, where n represents the number of clients and l denotes the dimension of the gradient vector. By employing a lightweight cryptographic primitive pseudorandom generator, VSAFL enables central servers and clients to prove and verify the correctness of model aggregations, significantly reducing verification costs. Our polynomial logarithmic overhead is particularly advantageous for clients with limited resources and high-dimensional gradients. Additionally, the proposed protocol is to be fully robust to clients dropping at any point. Through experimental evaluation, we demonstrate that VSAFL outperforms prior work in terms of verification speed by orders of magnitude.