Libo Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Libo Wang has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- Zhiquan Liu
Jinan University
7 shared publications - Jianfeng Ma
Xidian University
4 shared publications - Jingjing Guo
Xidian University
3 shared publications - Jingke Xu
School of Information Science and Engineering, Shandong Agricultural University, Taian, China
3 shared publications - Baofeng Wu
Institute of Information Engineering, CAS
2 shared publications - Lin Wan
School of Cyber Science and Engineering, Wuhan University, Wuhan, China
2 shared publications
Latest Publications
- 7 May 2026
- Published by Elsevier in Computer Networks
- Vol. 284
EbbFlow: Non-blocking join synchronization in dynamic asynchronous BFT
- 7 May 2026
- Published by Elsevier in Computer Networks
- Vol. 284
EbbFlow: Non-blocking join synchronization in dynamic asynchronous BFT
- 10 January 2026
- Published by Elsevier in Computer Networks
- Vol. 277
BVPM: A blockchain-based scheme for secure and efficient vehicle platoon management
- 10 January 2026
- Published by Elsevier in Computer Networks
- Vol. 277
BVPM: A blockchain-based scheme for secure and efficient vehicle platoon management
- 28 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 9052-9065
A Sanitizable Data Sharing Scheme Assisted With Blockchain in Intelligent Connected Vehicles
With the rapid development of Intelligent Connected Vehicles (ICVs), ensuring the security and efficiency of data sharing while protecting privacy has become a key challenge. Existing solutions often suffer from issues such as key escrow, high computational overhead, and lack of flexibility in dynamic vehicle environments. Additionally, although blockchain technology enhances data integrity, its integration with efficient and privacy-preserving encryption schemes remains to be further studied. To address these limitations, this paper proposes a blockchain-aided sanitizable data sharing scheme. We integrate and design vehicular distributed broadcast encryption with a keyless sanitization mechanism, which enables edge servers to randomize ciphertexts without decryption, generating new ciphertexts that are unlinkable to the original ones but retain the underlying access policies. The key generation, encryption, sanitization and decryption process in our scheme achieves lower and constant time cost, making it highly efficient for cross-domain data sharing in resource-constrained ICVs. Furthermore, blockchain is used to ensure the traceability and integrity of shared data, while a cuckoo filter is employed to manage efficient public key queries and revocations. We formally prove the security of our scheme under the IND-CPA model. Experimental results show that our scheme outperforms existing state-of-the-art methods in multiple aspects of computational and storage efficiency, particularly by maintaining constant sizes for decryption keys and ciphertexts.
- 28 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 9052-9065
A Sanitizable Data Sharing Scheme Assisted With Blockchain in Intelligent Connected Vehicles
With the rapid development of Intelligent Connected Vehicles (ICVs), ensuring the security and efficiency of data sharing while protecting privacy has become a key challenge. Existing solutions often suffer from issues such as key escrow, high computational overhead, and lack of flexibility in dynamic vehicle environments. Additionally, although blockchain technology enhances data integrity, its integration with efficient and privacy-preserving encryption schemes remains to be further studied. To address these limitations, this paper proposes a blockchain-aided sanitizable data sharing scheme. We integrate and design vehicular distributed broadcast encryption with a keyless sanitization mechanism, which enables edge servers to randomize ciphertexts without decryption, generating new ciphertexts that are unlinkable to the original ones but retain the underlying access policies. The key generation, encryption, sanitization and decryption process in our scheme achieves lower and constant time cost, making it highly efficient for cross-domain data sharing in resource-constrained ICVs. Furthermore, blockchain is used to ensure the traceability and integrity of shared data, while a cuckoo filter is employed to manage efficient public key queries and revocations. We formally prove the security of our scheme under the IND-CPA model. Experimental results show that our scheme outperforms existing state-of-the-art methods in multiple aspects of computational and storage efficiency, particularly by maintaining constant sizes for decryption keys and ciphertexts.
- 14 November 2025
- Published by Elsevier in Information Fusion
- Vol. 128
FedHSA: A privacy-preserving federated learning framework with heterogeneous system alignment
- 14 November 2025
- Published by Elsevier in Information Fusion
- Vol. 128
FedHSA: A privacy-preserving federated learning framework with heterogeneous system alignment
- 28 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 42274-42289
A Searchable Encryption Scheme for Blockchain-Based Digital Twins
With the widespread adoption of digital twin (DT) technology in cross-domain data sharing scenarios, ensuring secure and efficient search over encrypted data has become a significant challenge. This paper proposes a blockchain-based searchable encryption scheme tailored for digital twins, supporting privacy-preserving keyword search, verifiable data access, and decentralized trust establishment. The scheme collects real-time data streams from digital sensors and devices to construct unified digital twin records for intelligent analytics and decision-making. The scheme integrates lightweight searchable encryption with blockchain-based trapdoor delegation and ciphertext-level indexing, enabling secure and low-complexity keyword matching. By introducing a delegated trapdoor mechanism, users can authorize repeated keyword queries via a single token, thereby minimizing communication and computational costs. Additionally, a blockchain-driven key generation protocol based on distributed voting eliminates reliance on centralized authorities and ensures transparent, auditable key management. Moreover, encrypted records are stored in IPFS, resolving the storage limitations of blockchain and preserving verifiable data availability. The trapdoor delegation records and result verification parameters are committed on-chain, enabling query correctness checking and traceable access control. Under the CI and TI security models, the proposed scheme is formally proven to achieve ciphertext indistinguishability and trapdoor privacy, providing resistance to adaptive insider keyword guessing attacks. Compared with existing schemes, it offers stronger privacy guarantees with lower overhead, supporting scalable and secure digital twin data sharing.
- 28 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 42274-42289
A Searchable Encryption Scheme for Blockchain-Based Digital Twins
With the widespread adoption of digital twin (DT) technology in cross-domain data sharing scenarios, ensuring secure and efficient search over encrypted data has become a significant challenge. This paper proposes a blockchain-based searchable encryption scheme tailored for digital twins, supporting privacy-preserving keyword search, verifiable data access, and decentralized trust establishment. The scheme collects real-time data streams from digital sensors and devices to construct unified digital twin records for intelligent analytics and decision-making. The scheme integrates lightweight searchable encryption with blockchain-based trapdoor delegation and ciphertext-level indexing, enabling secure and low-complexity keyword matching. By introducing a delegated trapdoor mechanism, users can authorize repeated keyword queries via a single token, thereby minimizing communication and computational costs. Additionally, a blockchain-driven key generation protocol based on distributed voting eliminates reliance on centralized authorities and ensures transparent, auditable key management. Moreover, encrypted records are stored in IPFS, resolving the storage limitations of blockchain and preserving verifiable data availability. The trapdoor delegation records and result verification parameters are committed on-chain, enabling query correctness checking and traceable access control. Under the CI and TI security models, the proposed scheme is formally proven to achieve ciphertext indistinguishability and trapdoor privacy, providing resistance to adaptive insider keyword guessing attacks. Compared with existing schemes, it offers stronger privacy guarantees with lower overhead, supporting scalable and secure digital twin data sharing.
- 23 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (9) , 11664-11675
BPRM: Blockchain-Based Privacy Preserving and Robust Data Aggregation Supporting Multifunctionality for Fog-Assisted Smart Grid
While the collection of users’ live or periodic electricity consumption data brings significant advantages for the operation of smart grids, it also heightens the risk of user privacy leakage. Numerous data aggregation schemes have been proposed to address this issue. However, most of these schemes either fail to accommodate the need for multifunctional data analysis or rely on a trusted third party (TTP). Given the efficient data processing capabilities offered by fog computing, we propose a blockchain-based privacy-preserving data aggregation (BPRM) scheme supporting multifunctionality for fog-assisted smart grid without TTP. This scheme ensures data confidentiality and data integrity while providing various statistical functions. In addition, we implement a consensus mechanism between smart meters, further enhancing the security and robustness of the smart grid system. Moreover, not only does the proposed the batch verification reduce the authentication costs but also support error detection in signatures. With BPRM, data center can calculate multiple statistical functions, achieving a win-win strategy. Extensive security and performance analyses demonstrate that BPRM can withstand various security threats and effectively protect user privacy while maintaining efficiency in both computational and communication overhead.
- 23 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (9) , 11664-11675
BPRM: Blockchain-Based Privacy Preserving and Robust Data Aggregation Supporting Multifunctionality for Fog-Assisted Smart Grid
While the collection of users’ live or periodic electricity consumption data brings significant advantages for the operation of smart grids, it also heightens the risk of user privacy leakage. Numerous data aggregation schemes have been proposed to address this issue. However, most of these schemes either fail to accommodate the need for multifunctional data analysis or rely on a trusted third party (TTP). Given the efficient data processing capabilities offered by fog computing, we propose a blockchain-based privacy-preserving data aggregation (BPRM) scheme supporting multifunctionality for fog-assisted smart grid without TTP. This scheme ensures data confidentiality and data integrity while providing various statistical functions. In addition, we implement a consensus mechanism between smart meters, further enhancing the security and robustness of the smart grid system. Moreover, not only does the proposed the batch verification reduce the authentication costs but also support error detection in signatures. With BPRM, data center can calculate multiple statistical functions, achieving a win-win strategy. Extensive security and performance analyses demonstrate that BPRM can withstand various security threats and effectively protect user privacy while maintaining efficiency in both computational and communication overhead.
- Top Cited PapersOpen Access
- 8 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (2) , 1877-1892
PPRU: A Privacy-Preserving Reputation Updating Scheme for Cloud-Assisted Vehicular Networks
Vehicular networks have huge potential to improve road safety and traffic efficiency, especially in the context of large models. Cloud computing can significantly improve the performance of vehicular networks, and the concept of cloud-assisted vehicular networks comes into being. Reputation management plays a crucial role in vehicular networks, since it can help each vehicle evaluate the trustworthiness of the other vehicles and the received messages. Reputation updating is essential in reputation management and it is usually done by the Trusted Authority (TA) regularly after collecting, decrypting, and verifying a large number of reputation feedbacks, which leads to great computation and communication overheads on the TA side and even makes the TA become the bottleneck of reputation management system. In this paper, we propose a novel Privacy-Preserving Reputation Updating (PPRU) scheme for cloud-assisted vehicular networks based on the Elliptic Curve Cryptography (ECC) and Paillier algorithms, in which the reputation feedbacks are collected and preprocessed by the honest-but-curious Cloud Service Provider (CSP) in a privacy-preserving manner, and the computation and communication overheads on the TA side can be dramatically reduced by about 88.36% and 83.88% as a result, respectively. Meanwhile, the proposed scheme can provide strong privacy preservation, strong security, and robust reputation management with acceptable computation and communication overheads. Furthermore, the comprehensive theoretical analysis and simulation evaluation are conducted, and the results demonstrate that the proposed scheme is significantly superior to the existing schemes in several aspects.
- 8 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (2) , 1877-1892
Top Cited PapersOpen AccessPPRU: A Privacy-Preserving Reputation Updating Scheme for Cloud-Assisted Vehicular Networks
Vehicular networks have huge potential to improve road safety and traffic efficiency, especially in the context of large models. Cloud computing can significantly improve the performance of vehicular networks, and the concept of cloud-assisted vehicular networks comes into being. Reputation management plays a crucial role in vehicular networks, since it can help each vehicle evaluate the trustworthiness of the other vehicles and the received messages. Reputation updating is essential in reputation management and it is usually done by the Trusted Authority (TA) regularly after collecting, decrypting, and verifying a large number of reputation feedbacks, which leads to great computation and communication overheads on the TA side and even makes the TA become the bottleneck of reputation management system. In this paper, we propose a novel Privacy-Preserving Reputation Updating (PPRU) scheme for cloud-assisted vehicular networks based on the Elliptic Curve Cryptography (ECC) and Paillier algorithms, in which the reputation feedbacks are collected and preprocessed by the honest-but-curious Cloud Service Provider (CSP) in a privacy-preserving manner, and the computation and communication overheads on the TA side can be dramatically reduced by about 88.36% and 83.88% as a result, respectively. Meanwhile, the proposed scheme can provide strong privacy preservation, strong security, and robust reputation management with acceptable computation and communication overheads. Furthermore, the comprehensive theoretical analysis and simulation evaluation are conducted, and the results demonstrate that the proposed scheme is significantly superior to the existing schemes in several aspects.
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (7) , 5343-5357
Revisiting the Boomerang Attack From a Perspective of 3-Differential
In this paper, inspired by the work of Beyne and Rijmen at CRYPTO 2022, we explore the accurate probability of d -differential in the fixed-key model. The theoretical foundations of our method are based on a special matrix - quasi- d -differential transition matrix, which is a natural extension of the quasidifferential transition matrix. The role of quasi- d -differential transition matrices in polytopic cryptananlysis is analogous to that of correlation matrices in linear cryptanalysis. Therefore, the fixed-key probability of a d -differential can be exactly expressed as the sum of the correlations of its quasi- d -differential trails. Then we revisit the boomerang attack from a perspective of 3-differential. Different from previous works, the probability of a boomerang distinguisher can be exactly expressed as the sum of the correlations of its quasi-3-differential trails without any assumptions in our work. In order to illustrate our theory, we apply it to the lightweight block cipher GIFT. It is interesting to find the probability of every optimal 3-differential characteristic of an existing 2-round boomerang is zero, which can be seen as an evidence that the security of block ciphers adopting half-round key XOR might be overestimated previously to some extent in differential-like attacks.
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (7) , 5343-5357
Revisiting the Boomerang Attack From a Perspective of 3-Differential
In this paper, inspired by the work of Beyne and Rijmen at CRYPTO 2022, we explore the accurate probability of d -differential in the fixed-key model. The theoretical foundations of our method are based on a special matrix - quasi- d -differential transition matrix, which is a natural extension of the quasidifferential transition matrix. The role of quasi- d -differential transition matrices in polytopic cryptananlysis is analogous to that of correlation matrices in linear cryptanalysis. Therefore, the fixed-key probability of a d -differential can be exactly expressed as the sum of the correlations of its quasi- d -differential trails. Then we revisit the boomerang attack from a perspective of 3-differential. Different from previous works, the probability of a boomerang distinguisher can be exactly expressed as the sum of the correlations of its quasi-3-differential trails without any assumptions in our work. In order to illustrate our theory, we apply it to the lightweight block cipher GIFT. It is interesting to find the probability of every optimal 3-differential characteristic of an existing 2-round boomerang is zero, which can be seen as an evidence that the security of block ciphers adopting half-round key XOR might be overestimated previously to some extent in differential-like attacks.
- Open Access
Folded Polynomial Codes for Coded Distributed $AA^\top$-Type Matrix Multiplication
In this paper, due to the important value in practical applications, we consider the coded distributed matrix multiplication problem of computing $AA^\top$ in a distributed computing system with $N$ worker nodes and a master node, where the input matrices $A$ and $A^\top$ are partitioned into $m$-by-$p$ and $p$-by-$m$ blocks of equal-size sub-matrices respectively. For effective straggler mitigation, we propose a novel computation strategy, named \emph{folded polynomial code}, which is obtained by modifying the entangled polynomial codes. Moreover, we characterize a lower bound on the optimal recovery threshold among all linear computation strategies when the underlying field is the real number field, and our folded polynomial codes can achieve this bound in the case of $m=1$. Compared with all known computation strategies for coded distributed matrix multiplication, our folded polynomial codes outperform them in terms of recovery threshold, download cost, and decoding complexity.Open AccessFolded Polynomial Codes for Coded Distributed $AA^\top$-Type Matrix Multiplication
In this paper, due to the important value in practical applications, we consider the coded distributed matrix multiplication problem of computing $AA^\top$ in a distributed computing system with $N$ worker nodes and a master node, where the input matrices $A$ and $A^\top$ are partitioned into $m$-by-$p$ and $p$-by-$m$ blocks of equal-size sub-matrices respectively. For effective straggler mitigation, we propose a novel computation strategy, named \emph{folded polynomial code}, which is obtained by modifying the entangled polynomial codes. Moreover, we characterize a lower bound on the optimal recovery threshold among all linear computation strategies when the underlying field is the real number field, and our folded polynomial codes can achieve this bound in the case of $m=1$. Compared with all known computation strategies for coded distributed matrix multiplication, our folded polynomial codes outperform them in terms of recovery threshold, download cost, and decoding complexity. - 15 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (9) , 5051-5064
Folded Polynomial Codes for Coded Distributed AA⊤-Type Matrix Multiplication
In this paper, due to the important value in practical applications, we consider the coded distributed matrix multiplication problem of computing AA ⊤ in a distributed computing system with N worker nodes and a master node, where the input matrices A and A ⊤ are partitioned into m -by- p and p -by- m blocks of equal-size sub-matrices respectively. For effective straggler mitigation, we propose a novel computation strategy, named folded polynomial code , which is obtained by modifying the entangled polynomial codes. Moreover, we characterize a lower bound on the optimal recovery threshold among all linear computation strategies when the underlying field is the real number field, and our folded polynomial codes can achieve this bound in the case of m = 1. Compared with all known computation strategies for coded distributed matrix multiplication, our folded polynomial codes outperform them in terms of recovery threshold, download cost, and decoding complexity.
- 15 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (9) , 5051-5064
Folded Polynomial Codes for Coded Distributed AA⊤-Type Matrix Multiplication
In this paper, due to the important value in practical applications, we consider the coded distributed matrix multiplication problem of computing AA ⊤ in a distributed computing system with N worker nodes and a master node, where the input matrices A and A ⊤ are partitioned into m -by- p and p -by- m blocks of equal-size sub-matrices respectively. For effective straggler mitigation, we propose a novel computation strategy, named folded polynomial code , which is obtained by modifying the entangled polynomial codes. Moreover, we characterize a lower bound on the optimal recovery threshold among all linear computation strategies when the underlying field is the real number field, and our folded polynomial codes can achieve this bound in the case of m = 1. Compared with all known computation strategies for coded distributed matrix multiplication, our folded polynomial codes outperform them in terms of recovery threshold, download cost, and decoding complexity.