Jingcheng Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jingcheng Zhao has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Kaiping Xue
University of Science and Technology of China, Hefei, Anhui, China
14 shared publications - Yingjie Xue
University of Science and Technology of China
9 shared publications Yaxuan Huang
University of Science and Technology of China
6 shared publications- Bin Zhu
School of Cyber Science and Technology, University of Science and Technology of China, Hefei, China
5 shared publications - David S. L. WeiMember
Fordham University
5 shared publications - Shaoxian Yuan
University of Science and Technology of China
5 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (6) , 12477-12491
CompactDB: Compact and Secure Collaborative Relational Data Analytics
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (6) , 12477-12491
CompactDB: Compact and Secure Collaborative Relational Data Analytics
- 8 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-14
Petra: Enhancing Efficiency in Privacy-Preserving Three-Party Relational Analytics for Private Data
As organizations increasingly rely on collaborative relational analytics over private databases, secure multi-party computation (MPC) has emerged as a key solution to process private data. While numerous schemes optimize many MPC-based algorithms for complex relational queries, the basic MPC operations underlying relational computation, such as comparisons, still cost high communication overhead and latency. This imposes a significant bottleneck. To further enhance practicality and efficiency, we aim to reduce the overhead of using MPC, enabling more efficient computation of relational operators and query execution. We propose Petra, a three-party model solution for privacy-preserving relational analytics. Petra introduces new primitives of efficient equality and inequality operations designed for databases. These primitives leverage a pseudorandom transformation and a “shuffle-and-compare” working pattern. Then, by composing these primitives and designing relational operator protocols including SELECT, aggregation, Join, and Group-by, Petra enables efficient execution of SQL operators. Importantly, Petra provides different security guarantees compared to typical MPC protocols, as it allows a limited form of leakage to one of the computing parties. This trade-off is central to Petra's design. Experimental results demonstrate that Petra significantly improves query performance compared to existing approaches and scales to complex analytics over large databases.
- 8 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-14
Petra: Enhancing Efficiency in Privacy-Preserving Three-Party Relational Analytics for Private Data
As organizations increasingly rely on collaborative relational analytics over private databases, secure multi-party computation (MPC) has emerged as a key solution to process private data. While numerous schemes optimize many MPC-based algorithms for complex relational queries, the basic MPC operations underlying relational computation, such as comparisons, still cost high communication overhead and latency. This imposes a significant bottleneck. To further enhance practicality and efficiency, we aim to reduce the overhead of using MPC, enabling more efficient computation of relational operators and query execution. We propose Petra, a three-party model solution for privacy-preserving relational analytics. Petra introduces new primitives of efficient equality and inequality operations designed for databases. These primitives leverage a pseudorandom transformation and a “shuffle-and-compare” working pattern. Then, by composing these primitives and designing relational operator protocols including SELECT, aggregation, Join, and Group-by, Petra enables efficient execution of SQL operators. Importantly, Petra provides different security guarantees compared to typical MPC protocols, as it allows a limited form of leakage to one of the computing parties. This trade-off is central to Petra's design. Experimental results demonstrate that Petra significantly improves query performance compared to existing approaches and scales to complex analytics over large databases.
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. PP (15566013) , 1
IFAD: Privacy-Preserving Isolation Forest Based Anomaly Detection in Public Cloud Environments
Anomaly detection plays a vital role in processing multi-source data through public cloud servers, yet existing privacy-preserving schemes fail to efficiently detect anomalies while protecting data source privacy. Although isolation forest offer advantages for unsupervised high-dimensional data analysis, implementing its tree-based privacy-preserving mechanisms remains challenging. In this paper, we propose IFAD, a novel isolation forest-based scheme for detecting anomalies in private data. IFAD guarantees end-to-end privacy protection by safeguarding original data, tree structures, and intermediate information throughout detection workflows. Our design achieves efficiency through three key contributions: 1) Cryptographic building blocks combining function secret sharing (FSS) and secret sharing (SS) to enable secure computations; 2) A split index protocol and layer update protocol to facilitate efficient, layer-by-layer isolation forest construction; 3) A detection phase optimization converting the anomaly score calculations into lookup table operations. Experimental evaluations demonstrate that IFAD achieves superior performance, outperforming prior schemes by 2.4×-3.1× in runtime under LAN and WAN environments, and by 1.8×-7.8× in online communication overhead, while maintaining comparable detection accuracy. Our solution establishes an effective balance between privacy preservation and operational efficiency for cloud-based anomaly detection.
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. PP (15566013) , 1
IFAD: Privacy-Preserving Isolation Forest Based Anomaly Detection in Public Cloud Environments
Anomaly detection plays a vital role in processing multi-source data through public cloud servers, yet existing privacy-preserving schemes fail to efficiently detect anomalies while protecting data source privacy. Although isolation forest offer advantages for unsupervised high-dimensional data analysis, implementing its tree-based privacy-preserving mechanisms remains challenging. In this paper, we propose IFAD, a novel isolation forest-based scheme for detecting anomalies in private data. IFAD guarantees end-to-end privacy protection by safeguarding original data, tree structures, and intermediate information throughout detection workflows. Our design achieves efficiency through three key contributions: 1) Cryptographic building blocks combining function secret sharing (FSS) and secret sharing (SS) to enable secure computations; 2) A split index protocol and layer update protocol to facilitate efficient, layer-by-layer isolation forest construction; 3) A detection phase optimization converting the anomaly score calculations into lookup table operations. Experimental evaluations demonstrate that IFAD achieves superior performance, outperforming prior schemes by 2.4×-3.1× in runtime under LAN and WAN environments, and by 1.8×-7.8× in online communication overhead, while maintaining comparable detection accuracy. Our solution establishes an effective balance between privacy preservation and operational efficiency for cloud-based anomaly detection.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21, 7604-7618
ESecDT: Communication-Efficient and Secure Decision Tree Training Framework
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21, 7604-7618
ESecDT: Communication-Efficient and Secure Decision Tree Training Framework
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 3316-3330
FESCAT: Function Secret Sharing Based Efficient Secure Collaborative Analysis of Time Series Data
Time series data analysis, employing dynamic time warping (DTW) algorithms, has a wide range of applications in fields such as medicine and economics. Given the widespread distribution of data across different domains, integrating and analyzing these datasets through outsourced cloud computing can enhance analytics, though privacy concerns arise. Privacy preserving data analysis, underpinned by secure multi-party computing, emerges as a crucial approach to address this challenge. However, existing efforts face high communication costs and increased interactions, resulting in significant efficiency constraints in practical applications. In this paper, we propose a function secret sharing (FSS)-based framework for secure collaborative analysis of time series data using the DTW algorithm. Utilizing the distributed comparison function, we develop efficient building blocks with minimal online interaction and communication, enhancing the practicability of security protocols. To address the challenges of FSS key generation due to uncertain computational topology when cascading multiple distances, we adopt a modular design and decompose the analysis process into several critical modules. Furthermore, our framework efficiently supports various constraint methods for DTW. We implement and evaluate our framework using publicly available datasets. The results demonstrate a significant reduction in communication costs and the number of interactions during the online phase.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 3316-3330
FESCAT: Function Secret Sharing Based Efficient Secure Collaborative Analysis of Time Series Data
Time series data analysis, employing dynamic time warping (DTW) algorithms, has a wide range of applications in fields such as medicine and economics. Given the widespread distribution of data across different domains, integrating and analyzing these datasets through outsourced cloud computing can enhance analytics, though privacy concerns arise. Privacy preserving data analysis, underpinned by secure multi-party computing, emerges as a crucial approach to address this challenge. However, existing efforts face high communication costs and increased interactions, resulting in significant efficiency constraints in practical applications. In this paper, we propose a function secret sharing (FSS)-based framework for secure collaborative analysis of time series data using the DTW algorithm. Utilizing the distributed comparison function, we develop efficient building blocks with minimal online interaction and communication, enhancing the practicability of security protocols. To address the challenges of FSS key generation due to uncertain computational topology when cascading multiple distances, we adopt a modular design and decompose the analysis process into several critical modules. Furthermore, our framework efficiently supports various constraint methods for DTW. We implement and evaluate our framework using publicly available datasets. The results demonstrate a significant reduction in communication costs and the number of interactions during the online phase.
- 14 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 3351-3368
RobustPPFL: A Secure and Robust Privacy-Preserving Federated Learning Framework Against Poisoning Attacks
Federated learning (FL) facilitates decentralized machine learning by enabling participating entities to cooperatively train shared models while retaining local data ownership. To address privacy concerns inherent in distributed training, privacy-preserving mechanisms have been incorporated into FL frameworks to enhance confidentiality and protect sensitive data. However, the implementation of these privacy-enhancing techniques introduces vulnerabilities to poisoning attacks, wherein malicious actors manipulate training processes to degrade model integrity or performance. Current defense strategies rely on statistical methods to mitigate such attacks, but they lack sufficient robustness, demonstrating limited effectiveness against diverse attack types or scenarios where malicious clients exceed a small minority. To overcome these limitations, we propose RobustPPFL, a privacy-preserving federated learning framework designed to withstand multiple poisoning attack types with high resilience, even when malicious participants dominate the client population. Our approach integrates three core innovations. First, we add performance verification of client-encrypted models during the training process to detect malicious clients in-time. Second, a secure model inference protocol is proposed to enable privacy-preserving training. Last but not the least, we design a grouped verification mechanism enhanced by hierarchical aggregation rules to optimize efficiency and minimize interference in malicious client detection. We evaluate RobustPPFL through extensive experiments across diverse datasets and attack scenarios. The experimental results show that our proposed framework achieves privacy preservation and it achieves high robustness against poisoning attacks.
- 14 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 3351-3368
RobustPPFL: A Secure and Robust Privacy-Preserving Federated Learning Framework Against Poisoning Attacks
Federated learning (FL) facilitates decentralized machine learning by enabling participating entities to cooperatively train shared models while retaining local data ownership. To address privacy concerns inherent in distributed training, privacy-preserving mechanisms have been incorporated into FL frameworks to enhance confidentiality and protect sensitive data. However, the implementation of these privacy-enhancing techniques introduces vulnerabilities to poisoning attacks, wherein malicious actors manipulate training processes to degrade model integrity or performance. Current defense strategies rely on statistical methods to mitigate such attacks, but they lack sufficient robustness, demonstrating limited effectiveness against diverse attack types or scenarios where malicious clients exceed a small minority. To overcome these limitations, we propose RobustPPFL, a privacy-preserving federated learning framework designed to withstand multiple poisoning attack types with high resilience, even when malicious participants dominate the client population. Our approach integrates three core innovations. First, we add performance verification of client-encrypted models during the training process to detect malicious clients in-time. Second, a secure model inference protocol is proposed to enable privacy-preserving training. Last but not the least, we design a grouped verification mechanism enhanced by hierarchical aggregation rules to optimize efficiency and minimize interference in malicious client detection. We evaluate RobustPPFL through extensive experiments across diverse datasets and attack scenarios. The experimental results show that our proposed framework achieves privacy preservation and it achieves high robustness against poisoning attacks.
- 23 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 2964-2980
Securing Outsourced Computing With Trusted Execution Environments: A Case Study on China Secure Virtualization
There are potential risks of sensitive data leakage and tampering during transmission and processing in the untrusted outsourced computing environment. As a hardware-based security isolation technology, Trusted Execution Environments (TEEs) offer a novel solution to address such issues. Within TEEs, China Secure Virtualization (CSV) is a forefront Confidential Virtual Machine (CVM) technology in China. CVMs leverage hardware-enhanced isolation between different users in a cluster to preserve privacy in outsourced computing scenarios. However, in the practice of outsourced computing, CSV still has two major vulnerabilities. One is CSV's inability to resist malicious code executed within it, since malicious code can pose a threat to the security of the entire system. The other is that the hardware cannot verify the identity of the entity represented by the third-party application running with the system. As a result, secure channels cannot be directly established between users and applications. To address these vulnerabilities, we design an outsourced confidential computing system based on the Chinese-produced TEE —CSV. By modifying the virtual machine's boot process and refactoring the application's runtime file system with OverlayFS, our system can isolate malicious applications. Furthermore, we combine CSV's hardware security features and embedded certificate information to design an environment-identity binding authentication protocol. This protocol facilitates the establishment of a secure communication channel. Additionally, our system supports the hardware-enhanced acceleration of Chinese State Cryptography Algorithms. Extensive evaluations of functionalities and performance overhead on CSV demonstrate that our system maintains excellent performance while ensuring security under real-world workloads.
- 23 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 2964-2980
Securing Outsourced Computing With Trusted Execution Environments: A Case Study on China Secure Virtualization
There are potential risks of sensitive data leakage and tampering during transmission and processing in the untrusted outsourced computing environment. As a hardware-based security isolation technology, Trusted Execution Environments (TEEs) offer a novel solution to address such issues. Within TEEs, China Secure Virtualization (CSV) is a forefront Confidential Virtual Machine (CVM) technology in China. CVMs leverage hardware-enhanced isolation between different users in a cluster to preserve privacy in outsourced computing scenarios. However, in the practice of outsourced computing, CSV still has two major vulnerabilities. One is CSV's inability to resist malicious code executed within it, since malicious code can pose a threat to the security of the entire system. The other is that the hardware cannot verify the identity of the entity represented by the third-party application running with the system. As a result, secure channels cannot be directly established between users and applications. To address these vulnerabilities, we design an outsourced confidential computing system based on the Chinese-produced TEE —CSV. By modifying the virtual machine's boot process and refactoring the application's runtime file system with OverlayFS, our system can isolate malicious applications. Furthermore, we combine CSV's hardware security features and embedded certificate information to design an environment-identity binding authentication protocol. This protocol facilitates the establishment of a secure communication channel. Additionally, our system supports the hardware-enhanced acceleration of Chinese State Cryptography Algorithms. Extensive evaluations of functionalities and performance overhead on CSV demonstrate that our system maintains excellent performance while ensuring security under real-world workloads.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6406-6421
Privacy-Preserving Truth Discovery of Evolving Truths for Mobile Crowdsensing Systems
Privacy-preserving truth discovery (PPTD) enables the crowdsensing platform to extract reliable inferred truths from unreliable user sensory data. While mobile crowdsensing systems have driven the emergence of many applications, continuously extracting inferred truths of evolving objects over streaming data (continuous PPTD) remains a challenge. Most existing works focus on static scenarios and cannot handle the new challenges in continuous PPTD, such as accuracy decrease, user dynamics, real-time requirements, and outliers. To address these challenges, we present PTET, a PPTD framework for continuous PPTD. By mining evolving patterns, PTET extracts accurate inferred truths of evolving objects even when some epochs lack sufficient user sensory data. PTET ensures the privacy of both users and data requesters while achieving high accuracy. Furthermore, we present PTET-P for practical applications. It employs a virtual user combined with evolving patterns to effectively eliminate the impact of user dynamics in continuous PPTD. Meanwhile, PTET-P achieves “immediate on-arrival processing” to improve real-time performance significantly. In addition, we address the outliers problem with the help of evolving patterns. We provide security analysis to prove that our frameworks protect the privacy of both users and data requesters. Extensive experiments demonstrate that our frameworks dramatically outperform the existing schemes in extracting inferred truths of evolving objects in continuous PPTD.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6406-6421
Privacy-Preserving Truth Discovery of Evolving Truths for Mobile Crowdsensing Systems
Privacy-preserving truth discovery (PPTD) enables the crowdsensing platform to extract reliable inferred truths from unreliable user sensory data. While mobile crowdsensing systems have driven the emergence of many applications, continuously extracting inferred truths of evolving objects over streaming data (continuous PPTD) remains a challenge. Most existing works focus on static scenarios and cannot handle the new challenges in continuous PPTD, such as accuracy decrease, user dynamics, real-time requirements, and outliers. To address these challenges, we present PTET, a PPTD framework for continuous PPTD. By mining evolving patterns, PTET extracts accurate inferred truths of evolving objects even when some epochs lack sufficient user sensory data. PTET ensures the privacy of both users and data requesters while achieving high accuracy. Furthermore, we present PTET-P for practical applications. It employs a virtual user combined with evolving patterns to effectively eliminate the impact of user dynamics in continuous PPTD. Meanwhile, PTET-P achieves “immediate on-arrival processing” to improve real-time performance significantly. In addition, we address the outliers problem with the help of evolving patterns. We provide security analysis to prove that our frameworks protect the privacy of both users and data requesters. Extensive experiments demonstrate that our frameworks dramatically outperform the existing schemes in extracting inferred truths of evolving objects in continuous PPTD.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6104-6120
PSAC: Privacy-Preserving Statistical Analysis Framework for Crowdsourcing Using Histograms
Crowdsourcing has emerged as an effective paradigm for large-scale data collection and statistical analysis. However, the paramount concern about worker privacy has driven the development of privacy-preserving statistical analysis methods. We propose PSAC, a novel framework that leverages histograms to facilitate privacy-preserving statistical analysis in crowdsourcing. PSAC integrates secure statistical analysis protocols based on homomorphic encryption and secure two-party computation, addressing the limitations of a single cryptographic technique. It introduces innovative algorithms using histograms for statistical operations, including functions such as quantile estimation, outlier elimination, contingency table construction for $\chi ^{2}$ test, and the Mann-Whitney $U$ test. These algorithms exhibit minimal overhead growth with respect to data volume, demonstrating exceptional scalability for large numbers of data. Moreover, through a key-separation design, PSAC ensures that only the requester can decrypt the final results independently, even if the ciphertexts of data are exposed. Comprehensive evaluations validate the security, efficiency, and scalability of the PSAC framework.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6104-6120
PSAC: Privacy-Preserving Statistical Analysis Framework for Crowdsourcing Using Histograms
Crowdsourcing has emerged as an effective paradigm for large-scale data collection and statistical analysis. However, the paramount concern about worker privacy has driven the development of privacy-preserving statistical analysis methods. We propose PSAC, a novel framework that leverages histograms to facilitate privacy-preserving statistical analysis in crowdsourcing. PSAC integrates secure statistical analysis protocols based on homomorphic encryption and secure two-party computation, addressing the limitations of a single cryptographic technique. It introduces innovative algorithms using histograms for statistical operations, including functions such as quantile estimation, outlier elimination, contingency table construction for $\chi ^{2}$ test, and the Mann-Whitney $U$ test. These algorithms exhibit minimal overhead growth with respect to data volume, demonstrating exceptional scalability for large numbers of data. Moreover, through a key-separation design, PSAC ensures that only the requester can decrypt the final results independently, even if the ciphertexts of data are exposed. Comprehensive evaluations validate the security, efficiency, and scalability of the PSAC framework.