Song Han

Song Han

Auto-generated profile, based on publicly available information

Song Han

School of Computer and Computing Science, Hangzhou City University, Hangzhou, China

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
5 August 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
SZShuai Zhao
Shuai Zhao
FLFenghua Li
Fenghua Li
HLHongwei Li
Hongwei Li
RLRongxing Lu
Rongxing Lu
SRSiqi Ren
Siqi Ren
SHSong Han
Song Han
With the increasingly powerful and extensive deployment of edge devices, edge/fog computing enables customers to manage and analyze data locally, and extends computing power and data analysis applications to network edges. Meanwhile, as the next generation of the power grid, the smart grid can achieve the goal of efficiency, economy, security, reliability, use safety and environmental friendliness for the power grid. However, privacy and secure issues in fog-based smart grid communications are challenging. Without proper protection, customers’ privacy will be readily violated. This paper presents a smart and practical Privacy-preserving Data Aggregation (PDA) scheme with smart pricing and packing method for fog-based smart grids, which achieves diversified tariffs, multifunctional statistics and efficiency. Especially, we first propose a smart PDA scheme with Smart Pricing (PDA-SP). With PDA-SP, the Control Center (CC) can compute more complex and higher-order aggregation statistics to provide various services, provide diversiform pricing strategies and choose a double-winning strategy. Subsequently, we put forward a practical PDA scheme with Packing Method (PDA-PM), which is able to reduce the size of encrypted data and improve performance in performing various secure computations. Moreover, we extend our original packing method and present a more useful packing method, which can handle general vectors with large entries. The security analysis shows that our proposed scheme is secure against many threats. The performance evaluation reveals that the computation and communication overheads of our proposed scheme are effectively reduced by employing the Somewhat Homomorphic Encryption (SHE), and our packing method can further significantly reduce these overheads.

8 June 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Open access
SHSong Han
Song Han
HDHongxin Ding
Hongxin Ding
SZShuai Zhao
Shuai Zhao
SRSiqi Ren
Siqi Ren
ZWZhibo Wang
Zhibo Wang
SZShuhao Zhou
Shuhao Zhou
Privacy-preserving federated learning, as one of the privacy-preserving computation techniques, is a promising distributed and privacy-preserving machine learning (ML) approach for Internet of Medical Things (IoMT), due to its ability to train a regression model without collecting raw data of data owners (DOs). However, traditional interactive federated regression training (IFRT) schemes rely on multiple rounds of communication to train a global model and are still under various privacy and security threats. To overcome these problems, several noninteractive federated regression training (NFRT) schemes have been proposed and applied in a variety of scenarios. However, there are still several challenges: 1) how to protect the privacy of DOs’ local dataset; 2) how to realize highly scalable regression training without linear dependence on sample dimension; 3) how to tolerate DOs’ dropout; and 4) how to enable DOs to verify the correctness of aggregated results returned from the cloud service provider (CSP). In this article, we propose two practical noninteractive federated learning schemes with privacy-preserving for IoMT, named homomorphic encryption based NFRT (HE-NFRT) and double-masking protocol based NFRT (Mask-NFRT), respectively, which are based on a comprehensive consideration of NFRT, privacy concerns, high-efficiency, robustness, and verification mechanism. The security analyses display that our proposed schemes are able to protect the privacy of DOs’ local training data, resist collusion attack, and support strong verification to each DO. The performance evaluation results demonstrate that our proposed HE-NFRT scheme is desirable for a high-dimensional and high-security IoMT application while Mask-NFRT scheme is desirable for a high-dimensional and large-scale IoMT application.

3 April 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SHSong Han
Song Han
JLJianhong Lin
Jianhong Lin
SZShuai Zhao
Shuai Zhao
Guangquan XuGuangquan Xu
Guangquan Xu
SRSiqi Ren
Siqi Ren
LSLeyun Shi
Leyun Shi
Data privacy, especially location privacy, is paramountly important for protecting individuals information in smart cities in the big data era. One of the examples is in spatial crowdsourcing. It enables people not only to issue spatiotemporal tasks to ask for help as requesters but also to solve others’ tasks as workers on the spatial crowdsourcing platform. While spatial crowdsourcing brings convenience to people, it also produces severe location privacy problems, which have been recently paid more attention from both academia and industries. In this paper, we address the location privacy problem in spatial crowdsourcing in a practical and secure way. We propose a location privacy-preserving framework for almost all existed mainstream distance computations in the spatial crowdsourcing system, namely Euclidean-L3P, Minkowski-L3P, Manhattan-L3P and Chebyshev-L3P, among which the first two are constructed based on homomorphic encryption and composite-order multilinear mapping while the latter two on homomorphic encryption and prefix membership verification approach. Location privacy is resolved because of the above techniques having enabled that all distance computations are evaluated through ciphertexts without disclosing any location information. Security analysis shows that our framework can prevent a strong adversary from obtaining participants’ location privacy. Performance analysis evaluates computation and communication overheads between protocols. The results show that Euclidean-L3P is more efficient than Manhattan-L3P and Chebyshev-L3P in terms of computation overheads when the spatial crowdsourcing applications require a small number of participants, a large plaintext space and a small number of BSs. Moreover, compared with Manhattan-L3P and Chebyshev-L3P, Euclidean-L3P is a better choice in terms of communication overhead.

28 August 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Open access
SZShuai Zhao
Shuai Zhao
SXShuhua Xu
Shuhua Xu
SHSong Han
Song Han
SRSiqi Ren
Siqi Ren
YWYe Wang
Ye Wang
WLWeinan Liu
Weinan Liu
The smart grid (SG) is a new type of grid that integrates traditional power grid with the Internet of Things (IoT) to make the entire grid system more compatible, controllable, and self-healing. However, the flourishing of SG still faces some challenges in term of privacy-preserving data aggregation. Previous multidimensional data aggregation schemes need heavy computation operations, cannot support multisubset data aggregation, and resist neither collusion attack among the gateway (GW) and control center (CC) nor differential attack. To solve these issues, we propose a privacy-preserving data aggregation scheme for fog-based SGs to achieve multidimensional and multisubset data aggregation. The parallel composability of differential privacy is used to reasonably allocate the privacy budget, which can provide higher data utility in multidimensional data aggregation. In addition, each user’s multidimensional power consumption data will be structured as a composite data by utilizing the Chinese Remainder Theorem (CRT), which will further reduce the computational overhead. Security analysis shows that our scheme can resist differential attack, eavesdropping attack, collusion attack, and active attack. Evaluation of the performance also demonstrates that our scheme is more efficient in terms of computational overhead and communication overhead.

6 May 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Open access
SHSong Han
Song Han
HDHongxin Ding
Hongxin Ding
SZShuai Zhao
Shuai Zhao
SRSiqi Ren
Siqi Ren
SZShengke Zeng
Shengke Zeng
Ruili WangRuili Wang
Ruili Wang
Huge amounts of data from various sources are substantial to dependable distributed machine learning, especially for trustworthy federated learning (FL). However, existing FL methods are difficult to collect enough data for training the global model more accurately, especially in cross-device scenarios. In this paper, we propose a new federated generative adversarial network empowered by differential privacy and knowledge transfer named Fed-GAN, which can be used to address the problem of data shortage and prevent generator leakage from resource-constrained devices, as well as generate high-quality synthetic data while ensuring strict DP guarantees. Different from other generative model methods, our Fed-GAN framework can achieve efficient and secure generative model training and limited permission for resource-constrained devices to prevent them from leaking or misusing the generator. In addition, we propose a pHash-KT method for our Fed-GAN framework, which selects potentially high-quality data through the knowledge of each client for improving the utility of synthetic data. Our FedGAN framework satisfies ($\frac{2kJ\lambda}{\sigma^2}+\frac{log 1/\delta}{\lambda-1},\delta}$)-DP, and also has high resistance when number of adversaries is 10%-70% of the total number of clients. Extensive experiments demonstrate that our Fed-GAN framework not only generates high-quality synthetic data, but also provides strict DP guarantees, compared with other generative model methods. Our code is publicly available at https://github.com/daxx1/fed-gan

20 March 2011 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
BTBiming Tian
Biming Tian
SHSong Han
Song Han
SPSazia Parvin
Sazia Parvin
Jiankun HuJiankun Hu
Jiankun Hu
SSajal K. Das
Sajal K. Das
The objective of self-healing key distribution is to enable group users to recover session keys by themselves, without requesting additional transmissions from the group manager (GM), even when they miss some broadcast messages. One major benefit of the self-healing key distribution mechanism is the reduction of energy consumption due to the elimination of such additional transmission. Also in some applications, e.g., uni-directional broadcast channel from the GM, the self-healing key distribution mechanism seems to be the ideal solution. Desired features of self-healing key distribution schemes include energy awareness, short broadcast message, efficient users addition, revocation and so on. A primary challenge is managing the trade-off between providing an acceptable level of security and conserving scarce resources in particular energy which is critical for wireless network operations. Over a decade, a great number of self-healing key distribution schemes have been proposed for establishing a group key amongst a dynamic group of users over an unreliable, or lossy, network. In this paper a comprehensive survey is conducted on the state-of-the-art in the field of self-healing key distribution. First, we clarify the security requirements of self-healing key distribution scheme for their special application environment. Then, we present a classification of self-healing key distribution schemes according to different cryptographic primitives, and give an insight to their features and goals. Furthermore, we consider several problems, namely authentication on broadcast messages, sponsorization and mutual-healing, related to the robustness of self-healing key distribution schemes. At last, we delineate their similarities and differences and outline several future research directions.