Zhen Yang

Zhen Yang

Auto-generated profile, based on publicly available information

Zhen Yang

Beijing University of Technology

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
20 December 2018 in IEEE Access
Verified
Journal Article
Open access
HYHaiyang Yu
Haiyang Yu
ZYZhen Yang
Zhen Yang
RSRichard Sinnott
Richard Sinnott
The idea of big data has gained extensive attention from governments and academia all over the world. It is especially relevant for the establishment of a smart city environment combining complex heterogeneous data with data analytics and artificial intelligence (AI) technology. Big data is generated from many facilities and sensor networks in smart cities and often streamed and stored in the cloud storage platform. Ensuring the integrity and subsequent auditability of such big data is essential for the performance of AI-driven data analysis. Recent years has witnessed the emergence of many big data auditing schemes that are often characterized by third party auditors (TPAs). However, the TPA is a centralized entity, which is vulnerable to many security threats from both inside and outside the cloud. To avoid this centralized dependency, we propose a decentralized big data auditing scheme for smart city environments featuring blockchain capabilities supporting improved reliability and stability without the need for a centralized TPA in auditing schemes. To support this, we have designed an optimized blockchain instantiation and conducted a comprehensive comparison between the existing schemes and the proposed scheme through both theoretical analysis and experimental evaluation. The comparison shows that lower communication and computation costs are incurred with our scheme than with existing schemes.

13 September 2022 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
ZYZhen Yang
Zhen Yang
MZMing Zhou
Ming Zhou
HYHaiyang Yu
Haiyang Yu
RSRichard Sinnott
Richard Sinnott
HLHuan Liu
Huan Liu
Federated learning allows a large number of participants to collaboratively train a global model without sharing participant's local data. Participants train local models with their local data and send gradients to the cloud server for aggregation. Unfortunately, as a third party, the cloud server cannot be fully trusted. Existing research has shown that a compromised cloud server can extract sensitive information of participant's local data from gradients. In addition, it can even forge the aggregation result to corrupt the global model without being detected. Therefore, in a secure federated learning system, both the privacy and aggregation correctness of the uploaded gradients should be guaranteed. In this paper, we propose a secure and efficient federated learning scheme with verifiable weighted average aggregation. By adopting the masking technique to encrypt both weighted gradients and data size, our scheme can support the privacy-preserving weighted average aggregation of gradients. Moreover, we design the verifiable aggregation tag and propose an efficient verification method to validate the weighted average aggregation result, which greatly improves the performance of the aggregation verification. Security analysis shows that our scheme is provably secure. Extensive experiments demonstrate the efficiency of our scheme compared with the state-of-the-art approaches.

24 April 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
QZQiyu Zhong
Qiyu Zhong
GLGengyu Lyu
Gengyu Lyu
ZYZhen Yang
Zhen Yang
In the task of multiview multilabel (MVML) classification, each object is described by several heterogeneous view features and annotated with multiple relevant labels. Existing MVML methods usually assume that these heterogeneous features are strictly view-aligned, and they directly conduct cross-view information fusion to train a multilabel prediction model. However, in real-world scenarios, such strict view-aligned requirement can be hardly satisfied due to the recurrent spatiotemporal asynchronism when collecting MVML data, which would cause inaccurate multiview fusion results and degrade the classification performance. To address this issue, we propose a generalized nonaligned MVML (GNAM) classification method, which achieves multiview information fusion while aligning cross-view features and accordingly learns a desired multilabel classifier. Specifically, we first introduce a multiorder matching alignment strategy to achieve cross-view feature alignments, where both first-order feature correspondence and second-order structure correspondence are jointly integrated to guarantee the compactness of the view-alignment results. Afterward, a commonality-and individuality-based multiview fusion structure is formulated on the aligned-view features to excavate the consistencies and complementarities across different views, which leads all relevant multiview semantic labels, especially rare labels, to be characterized more comprehensively. Finally, we embed adaptive global label correlations to multilabel classification model to further enhance its semantic expression integrity and develop an alternative algorithm to optimize the whole model. Extensive experimental results have verified that GNAM is significantly superior to other state-of-the-art methods.

16 October 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
TLTong Li
Tong Li
SWShiheng Wang
Shiheng Wang
DLDavid Lillis
David Lillis
ZYZhen Yang
Zhen Yang
Maintaining traceability links of software systems is a crucial task for software management and development. Unfortunately, dealing with traceability links are typically taken as afterthought due to time pressure. Some studies attempt to use information retrieval-based methods to automate this task, but they only concentrate on calculating the textual similarity between various software artifacts and do not take into account the properties of such artifacts. In this paper, we propose a novel traceability link recovery approach, which comprehensively measures the similarity between use cases and source code by exploring their particular properties. To this end, we leverage and combine machine learning and logical reasoning techniques. On the one hand, our method extracts features by considering the semantics of the use cases and source code, and uses a classification algorithm to train the classifier. On the other hand, we utilize the relationships between artifacts and define a series of rules to recover traceability links. In particular, we not only leverage source code’s structural information, but also take into account the interrelationships between use cases. We have conducted a series of experiments on multiple datasets to evaluate our approach against existing approaches, the results of which show that our approach is substantially better than other methods.

23 March 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
HYHaiyang Yu
Haiyang Yu
QHQi Hu
Qi Hu
ZYZhen Yang
Zhen Yang
HLHuan Liu
Huan Liu
Decentralized storage powered by blockchain is becoming a new trend that allows data owners to outsource their data to remote storage resources offered by various storage providers. Unfortunately, unqualified storage providers easily encounter unpredictable downtime due to security threats, such as malicious attacks or system failures, which is unacceptable in many real-time or data-driven applications. As a result, continuous data integrity should be guaranteed in decentralized storage, which ensures that data is intact and available for the entire storage period. However, this requires frequent checking for long time periods and incurs heavy burdens of both communication and computation, especially in a big data scenario. In this paper, we propose an efficient continuous big data integrity checking approach for decentralized storage. We design a data-time sampling strategy that randomly checks the integrity of multiple files at each time slot with high checking probability. Furthermore, to tackle the fairness problem derived from the sampling strategy, we propose a fair approach by designing an arbitration algorithm with the verifiable random function. Security analysis shows the security of our approach under the random oracle model. Evaluation and experiments demonstrate that our approach is more efficient in the big data scenario compared with the state-of-the-arts.

3 March 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YCYuwen Chen
Yuwen Chen
Jose-Fernan MartinezJose-Fernan Martinez
Jose-Fernan Martinez
LLLourdes Lopez
Lourdes Lopez
HYHaiyang Yu
Haiyang Yu
ZYZhen Yang
Zhen Yang
In the smart grid, meters report their real-time electricity consumption data to a utility supplier, and the utility supplier can adjust its supply accordingly. However, adversaries can infer users' privacy behaviors based on publicly transferred real-time electricity consumption data. Data aggregation schemes protect users' privacy from being leaked. We find two major problems are unsolved: 1) meter failure problem and 2) dynamic membership problem. To solve these problems, we designed a dynamic membership group-based multiple-data aggregation scheme. First, a group-based key establishment scheme is proposed, meters are divided into groups, meters in a group build keys to encrypt their data, the meter failure problem is alleviated. If one group has broken meters, the other groups will not be affected. Second, the dynamic join, dynamic leave, and meter replacement techniques are proposed, and the dynamic membership is achieved by allowing meters to update their keys. The simulation results show a meter's computation cost and communication cost are the minima among the related works, which makes the proposed scheme more suitable for the IoT scenario. Besides, we designed a data encoding method and a data retrieve method, we designed two attacks: 1) “bilinear map pairing attack” and 2) “zero attack.”