Zhu Cao
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
Research Subjects
Zhu Cao has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
Yongjiao Li
3 shared publicationsCailu Wan
Ministry of Education The Key Laboratory of Smart Manufacturing in Energy Chemical Process East China University of Science and Technology 200237 Shanghai China
2 shared publicationsChan Li
Key Laboratory of Smart Manufacturing in Energy Chemical Process, Ministry of Education East China University of Science and Technology Shanghai China
2 shared publications- Chan Li
East China University of Science and Technology
2 shared publications - Jian Long
Key Laboratory of Smart Manufacturing in Energy Chemical Process, Ministry of Education East China University of Science and Technology Shanghai China
2 shared publications Jianzi Xiang
Ministry of Education The Key Laboratory of Smart Manufacturing in Energy Chemical Process East China University of Science and Technology 200237 Shanghai China
2 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 23914-23928
Revocable and Pairing-Free Multi-Domain Access Control With Key Self-Generation for Vehicular Ad Hoc Networks
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 23914-23928
Revocable and Pairing-Free Multi-Domain Access Control With Key Self-Generation for Vehicular Ad Hoc Networks
- 21 April 2026
- Published by Wiley in Advanced Quantum Technologies
- Vol. 9 (4)
Discrete‐Phase‐Randomized Mode‐Pairing Quantum Key Distribution
Mode‐pairing quantum key distribution (MP‐QKD) protocol achieves performance beyond the repeaterless rate‐transmittance bound and exhibits excellent practicality by avoiding the requirement for difficult global phase locking. However, the source side of MP‐QKD still relies on the assumption of continuous phase randomization, an experimentally infeasible requirement in practice. Therefore, the practical security of the protocol cannot be fully guaranteed. In this work, we propose a discrete‐phase‐randomized mode‐pairing quantum key distribution (DPR‐MP‐QKD) protocol and analyze the basis‐dependence of the source side. Then, we introduce a concrete discrete version of the decoy state method that ensures the security of the DPR‐MP‐QKD protocol. Finally, simulation results indicate that as the number of discrete phases increases, the key rate performance of DPR‐MP‐QKD progressively approaches that of the continuous case, with convergence achieved at approximately 14 discrete phases. Moreover, our approach drastically lowers the demand for randomness. While conventional continuous phase randomization demands an unlimited supply of random bits, we show that merely a few bits (e.g., 4) are adequate.
- 21 April 2026
- Published by Wiley in Advanced Quantum Technologies
- Vol. 9 (4)
Discrete‐Phase‐Randomized Mode‐Pairing Quantum Key Distribution
Mode‐pairing quantum key distribution (MP‐QKD) protocol achieves performance beyond the repeaterless rate‐transmittance bound and exhibits excellent practicality by avoiding the requirement for difficult global phase locking. However, the source side of MP‐QKD still relies on the assumption of continuous phase randomization, an experimentally infeasible requirement in practice. Therefore, the practical security of the protocol cannot be fully guaranteed. In this work, we propose a discrete‐phase‐randomized mode‐pairing quantum key distribution (DPR‐MP‐QKD) protocol and analyze the basis‐dependence of the source side. Then, we introduce a concrete discrete version of the decoy state method that ensures the security of the DPR‐MP‐QKD protocol. Finally, simulation results indicate that as the number of discrete phases increases, the key rate performance of DPR‐MP‐QKD progressively approaches that of the continuous case, with convergence achieved at approximately 14 discrete phases. Moreover, our approach drastically lowers the demand for randomness. While conventional continuous phase randomization demands an unlimited supply of random bits, we show that merely a few bits (e.g., 4) are adequate.
- 26 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 321
Low-light image enhancement via multi-scale attention combined with fourier transform
- 26 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 321
Low-light image enhancement via multi-scale attention combined with fourier transform
- 3 September 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 23 (06)
Quantum representation of the earth based on the bloch sphere
Implementing a digital Earth requires processing an enormous amount of data. Compared with classical algorithms, quantum algorithms can take exponential or quadratic acceleration and are more suitable for processing big data. However, existing quantum models require massive resources to process data on the Earth due to their low compatibility with spheres. So, we propose a quantum representation of the Earth based on the Bloch sphere (QREB), which is tailor-made for the Earth. Based on this model, the scale transformation and specific rotation transformation only need to change one variable. And the time complexity of the quantum point of interest extraction algorithm based on this model is the square root of the classical algorithm. Moreover, in the example of extracting thin black lines on the basketball, the accuracy is improved from 50% to 87.5%. The QREB model can reduce the resources required to process spherical data and accelerate the realization of a digital Earth.
- 3 September 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 23 (06)
Quantum representation of the earth based on the bloch sphere
Implementing a digital Earth requires processing an enormous amount of data. Compared with classical algorithms, quantum algorithms can take exponential or quadratic acceleration and are more suitable for processing big data. However, existing quantum models require massive resources to process data on the Earth due to their low compatibility with spheres. So, we propose a quantum representation of the Earth based on the Bloch sphere (QREB), which is tailor-made for the Earth. Based on this model, the scale transformation and specific rotation transformation only need to change one variable. And the time complexity of the quantum point of interest extraction algorithm based on this model is the square root of the classical algorithm. Moreover, in the example of extracting thin black lines on the basketball, the accuracy is improved from 50% to 87.5%. The QREB model can reduce the resources required to process spherical data and accelerate the realization of a digital Earth.
- 28 August 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 168
Fast revocable attribute-based encryption with data integrity for Internet of Things
- 28 August 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 168
Fast revocable attribute-based encryption with data integrity for Internet of Things
- Open Access
Pseudolabel guided pixels contrast for domain adaptive semantic segmentation
Semantic segmentation is essential for comprehending images, but the process necessitates a substantial amount of detailed annotations at the pixel level. Acquiring such annotations can be costly in the real-world. Unsupervised domain adaptation (UDA) for semantic segmentation is a technique that uses virtual data with labels to train a model and adapts it to real data without labels. Some recent works use contrastive learning, which is a powerful method for self-supervised learning, to help with this technique. However, these works do not take into account the diversity of features within each class when using contrastive learning, which leads to errors in class prediction. We analyze the limitations of these works and propose a novel framework called Pseudo-label Guided Pixel Contrast (PGPC), which overcomes the disadvantages of previous methods. We also investigate how to use more information from target images without adding noise from pseudo-labels. We test our method on two standard UDA benchmarks and show that it outperforms existing methods. Specifically, we achieve relative improvements of 5.1% mIoU and 4.6% mIoU on the Grand Theft Auto V (GTA5) to Cityscapes and SYNTHIA to Cityscapes tasks based on DAFormer, respectively. Furthermore, our approach can enhance the performance of other UDA approaches without increasing model complexity. Code is available at https://github.com/embar111/pgpc
Open AccessPseudolabel guided pixels contrast for domain adaptive semantic segmentation
Semantic segmentation is essential for comprehending images, but the process necessitates a substantial amount of detailed annotations at the pixel level. Acquiring such annotations can be costly in the real-world. Unsupervised domain adaptation (UDA) for semantic segmentation is a technique that uses virtual data with labels to train a model and adapts it to real data without labels. Some recent works use contrastive learning, which is a powerful method for self-supervised learning, to help with this technique. However, these works do not take into account the diversity of features within each class when using contrastive learning, which leads to errors in class prediction. We analyze the limitations of these works and propose a novel framework called Pseudo-label Guided Pixel Contrast (PGPC), which overcomes the disadvantages of previous methods. We also investigate how to use more information from target images without adding noise from pseudo-labels. We test our method on two standard UDA benchmarks and show that it outperforms existing methods. Specifically, we achieve relative improvements of 5.1% mIoU and 4.6% mIoU on the Grand Theft Auto V (GTA5) to Cityscapes and SYNTHIA to Cityscapes tasks based on DAFormer, respectively. Furthermore, our approach can enhance the performance of other UDA approaches without increasing model complexity. Code is available at https://github.com/embar111/pgpc
- Open Access
- 30 December 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-18
Pseudolabel guided pixels contrast for domain adaptive semantic segmentation
Semantic segmentation is essential for comprehending images, but the process necessitates a substantial amount of detailed annotations at the pixel level. Acquiring such annotations can be costly in the real-world. Unsupervised domain adaptation (UDA) for semantic segmentation is a technique that uses virtual data with labels to train a model and adapts it to real data without labels. Some recent works use contrastive learning, which is a powerful method for self-supervised learning, to help with this technique. However, these works do not take into account the diversity of features within each class when using contrastive learning, which leads to errors in class prediction. We analyze the limitations of these works and propose a novel framework called Pseudo-label Guided Pixel Contrast (PGPC), which overcomes the disadvantages of previous methods. We also investigate how to use more information from target images without adding noise from pseudo-labels. We test our method on two standard UDA benchmarks and show that it outperforms existing methods. Specifically, we achieve relative improvements of 5.1% mIoU and 4.6% mIoU on the Grand Theft Auto V (GTA5) to Cityscapes and SYNTHIA to Cityscapes tasks based on DAFormer, respectively. Furthermore, our approach can enhance the performance of other UDA approaches without increasing model complexity.
- 30 December 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-18
Open AccessPseudolabel guided pixels contrast for domain adaptive semantic segmentation
Semantic segmentation is essential for comprehending images, but the process necessitates a substantial amount of detailed annotations at the pixel level. Acquiring such annotations can be costly in the real-world. Unsupervised domain adaptation (UDA) for semantic segmentation is a technique that uses virtual data with labels to train a model and adapts it to real data without labels. Some recent works use contrastive learning, which is a powerful method for self-supervised learning, to help with this technique. However, these works do not take into account the diversity of features within each class when using contrastive learning, which leads to errors in class prediction. We analyze the limitations of these works and propose a novel framework called Pseudo-label Guided Pixel Contrast (PGPC), which overcomes the disadvantages of previous methods. We also investigate how to use more information from target images without adding noise from pseudo-labels. We test our method on two standard UDA benchmarks and show that it outperforms existing methods. Specifically, we achieve relative improvements of 5.1% mIoU and 4.6% mIoU on the Grand Theft Auto V (GTA5) to Cityscapes and SYNTHIA to Cityscapes tasks based on DAFormer, respectively. Furthermore, our approach can enhance the performance of other UDA approaches without increasing model complexity.
- Open Access
Gait-Based Privacy Protection for Smart Wearable Devices
Smart wearable devices (SWDs) collect and store sensitive daily information of many people. Its primary method of identification is still the password unlocking method. However, several studies have shown serious security flaws in that method, which makes the privacy and security concerns of SWDs particularly urgent. Gait identification is well suited for SWDs because its built-in sensors can provide data support for identification. However, existing gait identification methods have low accuracy and neglect to protect the privacy of gait features. In addition, the SWD can be used as an internet of things device for users to share data. But few studies have used gait feature-based encryption schemes to protect the privacy of message interactions between SWDs and other devices. In this paper, we propose a gait identification network, a bi-directional long short-term memory network with an attention mechanism (ABLSTM), to improve the identification accuracy and a stochastic orthogonal transformation (SOT) scheme to protect the extracted gait features from leakage. In the experiments, ABLSTM achieves an accuracy of 95.28%, reducing previous error rate by 19.3%. The SOT scheme is proved to be resistant to the chosen plaintext attack (CPA) and is 30% faster than previous methods. A biometric-based encryption scheme is proposed to enable secure message interactions using gait features as keys after the gait identification stage is passed, and offers better protection of the gait features compared to previous schemes.
Open AccessGait-Based Privacy Protection for Smart Wearable Devices
Smart wearable devices (SWDs) collect and store sensitive daily information of many people. Its primary method of identification is still the password unlocking method. However, several studies have shown serious security flaws in that method, which makes the privacy and security concerns of SWDs particularly urgent. Gait identification is well suited for SWDs because its built-in sensors can provide data support for identification. However, existing gait identification methods have low accuracy and neglect to protect the privacy of gait features. In addition, the SWD can be used as an internet of things device for users to share data. But few studies have used gait feature-based encryption schemes to protect the privacy of message interactions between SWDs and other devices. In this paper, we propose a gait identification network, a bi-directional long short-term memory network with an attention mechanism (ABLSTM), to improve the identification accuracy and a stochastic orthogonal transformation (SOT) scheme to protect the extracted gait features from leakage. In the experiments, ABLSTM achieves an accuracy of 95.28%, reducing previous error rate by 19.3%. The SOT scheme is proved to be resistant to the chosen plaintext attack (CPA) and is 30% faster than previous methods. A biometric-based encryption scheme is proposed to enable secure message interactions using gait features as keys after the gait identification stage is passed, and offers better protection of the gait features compared to previous schemes.
- Open Access
Distributed Partial Quantum Consensus of Qubit Networks with Connected Topologies
In this paper, we consider the partial quantum consensus problem of a qubit network in a distributed view. The local quantum operation is designed based on the Hamiltonian by using the local information of each quantum system in a network of qubits. We construct the unitary transformation for each quantum system to achieve the partial quantum consensus, i.e., the directions of the quantum states in the Bloch ball will reach an agreement. A simple case of two-qubit quantum systems is considered first, and a minimum completing time of reaching partial consensus is obtained based on the geometric configuration of each qubit. Furthermore, we extend the approaches to deal with the more general N-qubit networks. Two partial quantum consensus protocols, based on the Lyapunov method for chain graphs and the geometry method for connected graphs, are proposed. The geometry method can be utilized to deal with more general connected graphs, while for the Lyapunov method, the global consensus can be obtained. The numerical simulation over a qubit network is demonstrated to verify the validity and the effectiveness of the theoretical results.
Open AccessDistributed Partial Quantum Consensus of Qubit Networks with Connected Topologies
In this paper, we consider the partial quantum consensus problem of a qubit network in a distributed view. The local quantum operation is designed based on the Hamiltonian by using the local information of each quantum system in a network of qubits. We construct the unitary transformation for each quantum system to achieve the partial quantum consensus, i.e., the directions of the quantum states in the Bloch ball will reach an agreement. A simple case of two-qubit quantum systems is considered first, and a minimum completing time of reaching partial consensus is obtained based on the geometric configuration of each qubit. Furthermore, we extend the approaches to deal with the more general N-qubit networks. Two partial quantum consensus protocols, based on the Lyapunov method for chain graphs and the geometry method for connected graphs, are proposed. The geometry method can be utilized to deal with more general connected graphs, while for the Lyapunov method, the global consensus can be obtained. The numerical simulation over a qubit network is demonstrated to verify the validity and the effectiveness of the theoretical results.
- 19 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 54 (9) , 4986-4997
Distributed Partial Quantum Consensus of Qubit Networks With Connected Topologies
In this article, we consider the partial quantum consensus problem of a qubit network in a distributed view. The local quantum operation is designed based on the Hamiltonian by using the local information of each quantum system in a network of qubits. We construct the unitary transformation for each quantum system to achieve the partial quantum consensus, that is, the directions of the quantum states in the Bloch ball will reach an agreement. A simple case of two-qubit quantum systems is considered first, and a minimum completing time of reaching partial consensus is obtained based on the geometric configuration of each qubit. Furthermore, we extend the approaches to deal with the more general $N$ -qubit networks. Two partial quantum consensus protocols, based on the Lyapunov method for chain graphs and the geometry method for connected graphs, are proposed. The geometry method can be utilized to deal with more general connected graphs, while for the Lyapunov method, the global consensus can be obtained. The numerical simulation over a qubit network is demonstrated to verify the validity and the effectiveness of the theoretical results.
- 19 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 54 (9) , 4986-4997
Distributed Partial Quantum Consensus of Qubit Networks With Connected Topologies
In this article, we consider the partial quantum consensus problem of a qubit network in a distributed view. The local quantum operation is designed based on the Hamiltonian by using the local information of each quantum system in a network of qubits. We construct the unitary transformation for each quantum system to achieve the partial quantum consensus, that is, the directions of the quantum states in the Bloch ball will reach an agreement. A simple case of two-qubit quantum systems is considered first, and a minimum completing time of reaching partial consensus is obtained based on the geometric configuration of each qubit. Furthermore, we extend the approaches to deal with the more general $N$ -qubit networks. Two partial quantum consensus protocols, based on the Lyapunov method for chain graphs and the geometry method for connected graphs, are proposed. The geometry method can be utilized to deal with more general connected graphs, while for the Lyapunov method, the global consensus can be obtained. The numerical simulation over a qubit network is demonstrated to verify the validity and the effectiveness of the theoretical results.