Changsong Yang

Dr. Changsong Yang


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
15 June 2023 in Information Sciences
Verified
Journal Article
Closed access
BWBaodong Wen
Baodong Wen
YWYujue Wang
Yujue Wang
YDYong Ding
Yong Ding
HZHaibin Zheng
Haibin Zheng
BQBo Qin
Bo Qin
CYChangsong Yang
Changsong Yang

10 October 2023 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
HXHaoran Xie
Haoran Xie
YWYujue Wang
Yujue Wang
Ding YongDing Yong
Ding Yong
CYChangsong Yang
Changsong Yang
HZHaibin Zheng
Haibin Zheng
BQBo Qin
Bo Qin
With the development of information technology, massive and heterogeneous consumer electronic products can access the network. These products may engage third-party servers for federated learning and generating more accurate models, where they can monitor, collect and aggregate various data from households almost in real-time. Even though federated learning can update participant parameter data without collecting their raw data, prior research revealed that the shared gradients still retain sensitive information from the training set. Meanwhile, malicious third-party aggregation servers may return forged aggregated gradients, and lightweight execution of the entire solution needs to be ensured during the aggregation process. This paper demonstrates a verifiable federated learning scheme supporting secure data aggregation without using bilinear groups (FLVA) to address these issues. Particularly, to solve the issue of private key leakage in the gradient aggregation process on electronic product data, a three-party key negotiation protocol is developed. The private gradients are uploaded and aggregated in ciphertext format, which ensures the privacy of the electronic product gradient. Security analysis showed that our FLVA system can effectively protect the security and privacy of the private gradients. Finally, the experimental results showed that compared with existing solutions, the proposed scheme is more efficient and practical.

1 March 2020 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
CYChangsong Yang
Changsong Yang
XTXiaoling Tao
Xiaoling Tao
FZFeng Zhao
Feng Zhao
YWYong Wang
Yong Wang
With the rapid development of cloud storage, an increasing number of data owners prefer to outsource their data to the cloud server, which can greatly reduce the local storage overhead. Because different cloud service providers offer distinct quality of data storage service, e.g., security, reliability, access speed and prices, cloud data transfer has become a fundamental requirement of the data owner to change the cloud service providers. Hence, how to securely migrate the data from one cloud to another and permanently delete the transferred data from the original cloud becomes a primary concern of data owners. To solve this problem, we construct a new counting Bloom filter-based scheme in this paper. The proposed scheme not only can achieve secure data transfer but also can realize permanent data deletion. Additionally, the proposed scheme can satisfy the public verifiability without requiring any trusted third party. Finally, we also develop a simulation implementation that demonstrates the practicality and efficiency of our proposal.

25 May 2020 in IEEE Access
Verified
Journal Article
Open access
CYChangsong Yang
Changsong Yang
YLYueling Liu
Yueling Liu
XTXiaoling Tao
Xiaoling Tao
FZFeng Zhao
Feng Zhao
Cloud storage, one of the most attractive services offered by cloud computing, can provide users with boundless storage capacity. Thus, users can outsource their data to the cloud server for greatly saving local storage overhead. However, in cloud storage, due to the separation between data ownership and management, users lose the direct control over their outsourced data, resulting in plenty of security and privacy problems. In this paper, we focus on the problem of verifiable outsourced data deletion, which is important but received less attention in industry and academia. We propose an efficient fine-grained outsourced data deletion scheme based on invertible Bloom filter, which can also achieve public and private verifiability of the storage and deletion results. If the cloud server does not honestly maintain/delete the data and generate corresponding evidences, users can easily detect the cloud server’s malicious behaviors with an overwhelming probability. Meanwhile, in data deletion and deletion result verification processes, the computational complexity is independent of the number of outsourced data blocks, which makes the proposed scheme be suitable for large-scale data deletion scenario. Moreover, we provide the detailed security analysis and performance evaluation, which can respectively demonstrate the security and practicability of the proposed scheme.

1 October 2021 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
CYChangsong Yang
Changsong Yang
FZFeng Zhao
Feng Zhao
XTXiaoling Tao
Xiaoling Tao
YWYong Wang
Yong Wang

1 January 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
CYChangsong Yang
Changsong Yang
BSBowen Song
Bowen Song
Ding YongDing Yong
Ding Yong
JOJiangtao Ou
Jiangtao Ou
CFChengyuan Fan
Chengyuan Fan
Cloud storage, an economically attractive service offered by cloud service providers (CSPs), has attracted a large number of tenants. However, because the ownership and management of outsourced data are separated, outsourced data faces a lot of security challenges, for instance, data security, data integrity, data update, and so on. In this article, we primarily investigate the problem of efficient data integrity auditing supporting provable data update in cloud computing environment. Subsequently, on the basis of the Merkel sum hash tree (MSHT), we introduce an efficient outsourced data integrity auditing scheme. Our designed scheme could synchronously meet the requirements of provable data update and data confidentiality without dependency on a third authority. At the same time, the numerical analysis shows that the computing complexity logarithmically grows with the number of outsourced subfiles. Finally, a prototype implementation is developed to simulate our designed scheme and measure its performance. The consequences of experiments present that compared with some previous solutions, our designed scheme has much more attractive practicality and higher efficiency in practical applications.