Lei Ju
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lei Ju has a total of 108 co-authors. Here are the top co-authors by number of shared publications:
- Wei Zhang
School of Cyber Science and Technology, Shandong University, Qingdao, Shandong, China
10 shared publications - Zhaoyan Shen
Shandong University, Qingdao, China
7 shared publications - Zhuoran Ji
School of Cyber Science and Technology, Shandong University, Qingdao, China
7 shared publications - Zhiping Jia
Shandong University, Qingdao, China
6 shared publications - Honghui You
School of Cyber Science and Technology, Shandong University, Qingdao, China
5 shared publications - Jiming Xu
Ant Group, Shenzhen, Guangdong, China
5 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75  (12) , 4220-4234
RT-DPU: Scheduling Real-Time Tasks With Heterogeneous Multi-DPU Engines
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75  (12) , 4220-4234
RT-DPU: Scheduling Real-Time Tasks With Heterogeneous Multi-DPU Engines
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2491-2505
PackCNN: Adaptive Data Packing for BSGS-Based Privacy-Preserving Convolutional Neural Network Inference
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2491-2505
Open AccessPackCNN: Adaptive Data Packing for BSGS-Based Privacy-Preserving Convolutional Neural Network Inference
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
MACH: Memory-Aware Configuration Generation for Homomorphically Encrypted Neural Networks
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessMACH: Memory-Aware Configuration Generation for Homomorphically Encrypted Neural Networks
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
EASY-ZKP: An End-to-end FPGA-accelerated System for Zero Knowledge Proofs
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessEASY-ZKP: An End-to-end FPGA-accelerated System for Zero Knowledge Proofs
- Open Access
- 8 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10  (PLDI) , 125-147
Path-Sensitive Abstract Interpretation for WCET Estimation
Worst-Case Execution Time (WCET) analysis provides an upper bound on a program’s execution time and is fundamental to the design and verification of real-time systems. Accurate modeling of cache behavior is critical for WCET estimation, as cache-miss latency is typically orders of magnitude larger than cache-hit latency. Since cache behavior is path dependent, existing methods commonly use abstract interpretation to estimate cache behaviors without enumerating all paths. However, conventional abstract interpretation is context-agnostic—adopting the most conservative case across paths—and thus may produce an overestimated WCET bound. To bridge the gap between scalability and accuracy, we propose a path-sensitive abstract-interpretation-based cache analysis that maintains a set of cache states drawn from critical execution paths to derive context-aware cache behavior. This path-sensitive cache analysis integrates seamlessly into standard WCET frameworks, resulting in tight yet provably sound WCET bounds. Experiments show that our approach improves WCET accuracy by an average of 24.83% without sacrificing scalability.
- 8 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10  (PLDI) , 125-147
Open AccessPath-Sensitive Abstract Interpretation for WCET Estimation
Worst-Case Execution Time (WCET) analysis provides an upper bound on a program’s execution time and is fundamental to the design and verification of real-time systems. Accurate modeling of cache behavior is critical for WCET estimation, as cache-miss latency is typically orders of magnitude larger than cache-hit latency. Since cache behavior is path dependent, existing methods commonly use abstract interpretation to estimate cache behaviors without enumerating all paths. However, conventional abstract interpretation is context-agnostic—adopting the most conservative case across paths—and thus may produce an overestimated WCET bound. To bridge the gap between scalability and accuracy, we propose a path-sensitive abstract-interpretation-based cache analysis that maintains a set of cache states drawn from critical execution paths to derive context-aware cache behavior. This path-sensitive cache analysis integrates seamlessly into standard WCET frameworks, resulting in tight yet provably sound WCET bounds. Experiments show that our approach improves WCET accuracy by an average of 24.83% without sacrificing scalability.
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1285-1300
Neura: A Unified Framework for Hierarchical and Adaptive CGRAs
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 1285-1300
Open AccessNeura: A Unified Framework for Hierarchical and Adaptive CGRAs
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 25-40
A Framework for Developing and Optimizing Fully Homomorphic Encryption Programs on GPUs
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 25-40
Open AccessA Framework for Developing and Optimizing Fully Homomorphic Encryption Programs on GPUs
- Open Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 439-451
Pipelonk: Accelerating End-to-End Zero-Knowledge Proof Generation on GPUs for PLONK-Based Protocols
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 439-451
Open AccessPipelonk: Accelerating End-to-End Zero-Knowledge Proof Generation on GPUs for PLONK-Based Protocols
- 21 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75  (4) , 1677-1691
PIRacle: A Fast and Scalable Private Information Retrieval System for Key-Value Stores
Keyword Private Information Retrieval (PIR) systems that leverage Homomorphic Encryption (HE) allow for the execution of private queries on public databases hosted by untrusted servers. However, existing solutions are significantly hindered by high computational overhead and inefficiencies in handling variable-length data, which impose limitations on their practical deployment. To address these challenges, we propose PIRacle, a high-performance protocol and deployment-optimized private retrieval system for key-value stores. First, PIRacle introduces a lightweight computational protocol that substantially reduces computational overhead by utilizing constant-weight codes and Fermat’s Little Theorem. Additionally, to address the inefficiencies associated with variable-length data, PIRacle applies a two-pass sorting strategy combined with computation pruning, effectively mitigating the computational expansion typically induced by padding overhead in conventional designs. Moreover, PIRacle incorporates a workload-aware scheduling framework that dynamically distributes computation across parallel execution units, enabling efficient scaling with available hardware resources. Experimental results demonstrate that PIRacle reduces server-side latency by up to 88.5$\times$ compared to the state-of-the-art solution.- 21 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75  (4) , 1677-1691
PIRacle: A Fast and Scalable Private Information Retrieval System for Key-Value Stores
Keyword Private Information Retrieval (PIR) systems that leverage Homomorphic Encryption (HE) allow for the execution of private queries on public databases hosted by untrusted servers. However, existing solutions are significantly hindered by high computational overhead and inefficiencies in handling variable-length data, which impose limitations on their practical deployment. To address these challenges, we propose PIRacle, a high-performance protocol and deployment-optimized private retrieval system for key-value stores. First, PIRacle introduces a lightweight computational protocol that substantially reduces computational overhead by utilizing constant-weight codes and Fermat’s Little Theorem. Additionally, to address the inefficiencies associated with variable-length data, PIRacle applies a two-pass sorting strategy combined with computation pruning, effectively mitigating the computational expansion typically induced by padding overhead in conventional designs. Moreover, PIRacle incorporates a workload-aware scheduling framework that dynamically distributes computation across parallel execution units, enabling efficient scaling with available hardware resources. Experimental results demonstrate that PIRacle reduces server-side latency by up to 88.5$\times$ compared to the state-of-the-art solution.- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3591-3604
Co-Prime: A Co-design Framework for Privacy Preserving Machine Learning on FPGA
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3591-3604
Open AccessCo-Prime: A Co-design Framework for Privacy Preserving Machine Learning on FPGA