Liangliang Wang

Liangliang Wang

Auto-generated profile, based on publicly available information

Liangliang Wang

College of Computer Science and Technology, Shanghai University of Electric Power, Shanghai, China

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
9 September 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
MWMi Wen
Mi Wen
RXRong Xie
Rong Xie
KLKejie Lu
Kejie Lu
LWLiangliang Wang
Liangliang Wang
KZKai Zhang
Kai Zhang
In smart grids, a major challenge is how to effectively utilize consumers’ energy consumption data while preserving security and privacy. In this article, we tackle this challenging issue and focus on energy theft detection, which is very important for smart grids. Specifically, we note that most existing energy theft detection schemes are centralized, which may be unscalable, and more importantly, may be very difficult to protect data privacy. To address this issue, we propose a novel privacy-preserving federated learning framework for energy theft detection, namely, FedDetect. In our framework, we consider a federated learning system that consists of a data center (DC), a control center (CC), and multiple detection stations. In this system, each detection station (DTS) can only observe data from local consumers, which can use a local differential privacy (LDP) scheme to process their data to preserve privacy. To facilitate the training of the model, we design a secure protocol so that detection stations can send encrypted training parameters to the CC and the DC, which then use homomorphic encryption to calculate the aggregated parameters and return updated model parameters to detection stations. In our study, we prove the security of the proposed protocol with solid security analysis. To detect energy theft, we design a deep learning model based on the state-of-the-art temporal convolutional network (TCN). Finally, we conduct extensive data-driven experiments using a real-energy consumption data set. The experimental results demonstrate that the proposed federated learning framework can achieve high accuracy of detection with a smaller computation overhead.

28 January 2022 in IEEE Access
Verified
Journal Article
Open access
HWHuiwen Wang
Huiwen Wang
LWLiangliang Wang
Liangliang Wang
KZKai Zhang
Kai Zhang
JLJinguo Li
Jinguo Li
YLYiyuan Luo
Yiyuan Luo
Vehicular ad hoc networks (VANETs) are the communication foundation for future intelligent transportation systems and guarantee safe driving of intelligent networked vehicles. Moreover, VANETs face a series of security challenges related to the protection of vehicle privacy, authenticity of transmitted information, and bandwidth limitations. To resolve these contradictions, many certificateless aggregate signature (CLAS) schemes have been proposed. However, the majority of them can neither resist malicious-but-passive key generation center attacks, replay attacks, and link attacks, nor track the actual identities of malicious vehicles. Meanwhile, the security of previous CLAS schemes in VANETs is only formally provided in the random oracle model (ROM), which might be insecure in actual implementation. In addition, most CLAS schemes still have problems of large verification delays and high communication overhead. To address the above-mentioned problems, a new conditional privacy-preserving CLAS scheme in VANETs is proposed, which adopts full aggregation technology to reduce computation and bandwidth resources. According to the formal security proofs under the computational Diffie-Hellman problem (CDHP) given in the standard model (SM), the security level of this scheme is higher than that of other CLAS schemes under ROM in practical applications. Additionally, the use of pseudonym mechanism realizes conditional privacy protection in VANETs. The performance analysis shows that this scheme has a higher efficiency in terms of computation and communication overhead compared with several previous CLAS schemes.

13 October 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JCJiasheng Chen
Jiasheng Chen
LWLiangliang Wang
Liangliang Wang
MWMi Wen
Mi Wen
KZKai Zhang
Kai Zhang
KCKefei Chen
Kefei Chen
The emergence of edge computing brings data processing and storage to the vicinity of terminal equipment, which can quickly respond to user needs and reduce the computational burden of the traditional centralized cloud computing model, resulting in a model of edge computing-assisted cloud computing. In this architecture, how to prevent other untrusted entities from leaking user privacy has become one of the most critical concerns. To address this concern, many cryptographic schemes supporting the traditional cloud model to protect the data security sharing of IoT devices have been proposed. However, resource-constrained devices are an essential component of the Internet of Things (IoT). Its characteristics are one of the main reasons that affect the efficiency of schemes, and traditional cryptographic schemes are not suitable for edge computing. Therefore, in order to ensure secure data sharing between IoT devices, we come up with an improved certificateless online/offline signcryption (CLOOSC) scheme and achieve lower computational overhead, when offline calculation is not considered, the resource-constrained IoT device under the cloud-edge collaboration architecture requires only one point multiplication, while only one bilinear pairing is required in the verification phase. In the random oracle model, our scheme is proved to be IND-CCA2 secure. The experiment results show our scheme can be lightweight in terms of time cost.

26 February 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XLXiumin Li
Xiumin Li
MWMi Wen
Mi Wen
SHSiying He
Siying He
RLRongxing Lu
Rongxing Lu
LWLiangliang Wang
Liangliang Wang
Privacy preservation in federated learning (FL) has received considerable attention and many approaches have been proposed. However, these approaches rendered the uploaded gradients invisible to the server, which poses a significant challenge in defending against poisoning attacks. In poisoning attacks, malicious or compromised participants use poisoned training data or forged local updates to disrupt the training process. It is hard for cloud servers to defend against poisoning attacks due to the invisibility of gradients. To address this issue, we propose a privacy-preserving FL scheme (PFLS) against poisoning attacks to eliminate the impact of model poisoning attacks while protecting the privacy of participants. Specifically, a dynamic adaptive defense mechanism is designed to mitigate the impact of malicious gradients and locate malicious participants. To protect participants’ privacy, a multidimensional homomorphic encryption method is constructed with a hierarchical aggregation architecture. The security analysis illustrates that the PFLS scheme can ensure the privacy of FL participants. The experimental results demonstrate that a high-detection rate of malicious participants and a balance between efficiency and robustness are achieved.

7 May 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
LWLiangliang Wang
Liangliang Wang
JXJiangwei Xu
Jiangwei Xu
BQBaodong Qin
Baodong Qin
MWMi Wen
Mi Wen
KCKefei Chen
Kefei Chen
Vehicular ad hoc networks (VANETs) are essential technologies to ensure safe road traffic management and enhance driving convenience. Nowadays, diversified authentication schemes have been developed in VANETs for the purpose of safer communication between nodes. For instance, biometric technology which employs biometric information as users’ authentic identity is widely adopted in message authentication due to its visible benefits. Nonetheless, there is a significant problem in current biometric identity-based authentication schemes that noise is inevitable in each collection of biometric information, making these schemes lack critical error tolerance. Additionally, anonymous biometric identity is difficult to be realized, which fails to meet the basic standard of VANETs. For solving the above key issues, we propose the first efficient fuzzy certificateless signature-based (FCLS) authentication scheme using anonymous biometric identities for VANETs. In virtue of its superior error tolerance, it enables authentication between two identities represented by two attribute sets within a certain Hamming distance. Besides, the newly developed authentication scheme realizes effective conditional privacy so that drivers’ real biometric identities can be ensured. Through the formal security proof, this FCLS scheme is existentially unforgeable against adaptive chosen message attack (EU-CMA) in the random oracle model (ROM), which reaches the higher security. Compared with current advanced schemes, the new authentication scheme is more efficient in computation and communication according to performance analysis.

30 November 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
JXJiangwei Xu
Jiangwei Xu
LWLiangliang Wang
Liangliang Wang
MWMi Wen
Mi Wen
YLYu Long
Yu Long
KCKefei Chen
Kefei Chen
Vehicular ad hoc networks (VANETs) serve as crucial means to ensure safe transportation systems and enhance driving convenience. Ensuring authentication between vehicles and units is the most essential line of defense for VANETs systems. Various schemes of message authentication are put forward to realize safe communication in VANETs. However, these schemes mainly pay attention to privacy and security issues, and are not fit for high-density traffic environments where many messages should be verified by a roadside unit (RSU). At present, achieving the low-latency authentication under the security and privacy of messages remains a critical requirement and challenge. For addressing this problem, this study puts forward a novel low-latency message authentication scheme based on the distributed authentication and message priority (DPB-MA), which can minimize message verification latency through cooperation between the RSU and cooperative vehicles (CVs). In addition, a message priority strategy has been designed to ensure that urgent messages are preferentially verified. According to the security proof with tight reduction, the DPB-MA is existentially unforgeable against adaptive chosen message attack (EU-CMA) in the random oracle model (ROM). Furthermore, our DPB-MA achieves full message aggregation, which also greatly optimizes the communication overhead and authentication efficiency. Performance analysis indicates that our scheme works well in high-density traffic scenarios and is more suitable for securing emergency messages with ultra-low latency requirements.