MZMingzhe Zhang

Mingzhe Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mingzhe Zhang has a total of 121 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    ROSETTA: Efficient and Accurate Privacy-Preserving LLM Decoding via Hybrid CKKS/TFHE Evaluation

    by Jiangrui Yu, Baosheng Zhang, Liang Kong, Lin Ding, Yi Chen, Ye Yu, Mingzhe Zhang, Meng Li

  • Open Access

    A survey on fully homomorphic encryption compilers

    by Zhuoyu Tian, Shengyu Fan, Xianglong Deng, Rui Hou, Dan Meng, Mingzhe Zhang

    Fully Homomorphic Encryption (FHE) enables computations on encrypted data without decryption, ensuring data privacy in cloud computing and preventing sensitive information leakage. In recent years, significant progress has been made in FHE research, resulting in the development of various FHE schemes and supporting libraries. However, FHE incurs substantial computational overhead, with execution times exceeding plaintext computation by 4-5 orders. As a result, optimized FHE programs can be several hundred times faster than their unoptimized counterparts, underscoring the critical importance of efficient FHE programming. However, the restricted set of primitive operations, numerous cryptographic parameters, and complexities in ciphertext management present significant challenges, rendering FHE programming prohibitively complex for users without cryptographic expertise. To address these challenges, numerous FHE programming tools, commonly referred to as FHE compilers, have been developed. These compilers aim to simplify FHE programming by allowing users to write standard plaintext programs, which are then automatically converted into ciphertext programs. They handle ciphertext management and parameter selection automatically, lowering the barrier for users. This paper systematically reviews existing FHE compilers, examining their techniques and effectiveness to explore the current state of the art and identify areas for future research. First, we analyze the challenges of FHE programming that compilers aim to address. We then outline a typical workflow of FHE compilers, classify compilers based on the problems they solve, and compare tools within each category. Finally, we provide a summary of the current state of research on FHE compilers and propose directions for future advancements in FHE programming tools.

  • Open Access

    Chimera: A Unified FHE Accelerator with Enhanced Compatibility for TFHE

    by Tenghui Hua, Huawei Li, Jianan Mu, Jing Ye, Liang Kong, Mingzhe Zhang

  • OmniCifro: A Heterogeneous Acceleration System with PIM for Encrypted Computation

    by Shengyu Fan, Xianglong Deng, Liang Kong, Guang Fan, Lei Chen, Yilan Zhu, Geng Yang, Yisong Chang, Shoumeng Yan, Mingzhe Zhang

    Fully Homomorphic Encryption (FHE) offers unparalleled data security guarantees for privacy-sensitive applications, but its widespread adoption is hindered by prohibitively high computation and memory capacity overheads compared to conventional computation on plaintext data. These inefficiencies create critical performance bottlenecks, limiting FHE’s practicality in real-world scenarios. To enhance performance, we systematically characterize FHE workloads, noting that existing accelerators struggle with state-of-the-art FHE schemes due to bandwidth constraints and the diverse computation patterns of different FHE primitives. In this work, we propose OmniCifro, a heterogeneous FHE acceleration framework that addresses performance bottlenecks through architectural design and dataflow optimization. OmniCifro combines a specialized Homomorphic Processing Unit (HPU) for compute-intensive kernels with Processing-in-Memory (PIM) modules for memory-bound operations, featuring dedicated functional units for polynomial arithmetic and element-wise operations. We further optimize the kernel mapping strategy for advanced FHE algorithms to reduce communication overhead between HPU and PIM. Experimental evaluations demonstrate that OmniCifro achieves a 1.6× performance improvement over ARK.

  • Open Access

    A Framework for Developing and Optimizing Fully Homomorphic Encryption Programs on GPUs

    by Jianyu Zhao, Xueyu Wu, Guang Fan, Mingzhe Zhang, Shoumeng Yan, Lei Ju, Zhuoran Ji


  • Open Access

    Falcon: Algorithm-Hardware Co-Design for Efficient Fully Homomorphic Encryption Accelerator

    by Liang Kong, Xianglong Deng, Guang Fan, Shengyu Fan, Lei Chen, Yilan Zhu, Geng Yang, Yisong Chang, Shoumeng Yan, Mingzhe Zhang

    Fully homomorphic encryption (FHE) enables computation on encrypted data without compromising privacy, positioning it as a promising solution for secure cloud computing. However, its substantial computational overhead impedes practical deployment, prompting the development of dedicated hardware accelerators. In practice, when deploying cryptographic algorithm optimizations on FHE accelerators, hardware constraints typically such as limited memory capacity, often lead to a disparity between theoretical algorithmic advantage and achievable hardware efficiency. We present Falcon, an algorithm-hardware co-design for efficient FHE acceleration. We first conduct computational analysis of the prevalent minimum key-switching method, and propose hardware-oriented algorithmic optimizations that substantially reduce computational overhead. We then introduce further refinements to decrease the inherent inter-cluster communication overhead in multi-cluster architectures, while preserving computational advantages. By characterizing the arithmetic patterns intrinsic to primary primitives, we devise hardware-specific arithmetic fusion and functional reuse across computational units. Finally, we present a memory-adaptive strategy to effectively deploy Falcon to prior accelerators under constrained on-chip memory budgets. Experimental results demonstrate that applying our algorithm–hardware co-design delivers up to a 1.48× speedup with a negligible area overhead (only a 0.8% increase).

  • Open Access

    Understanding and boosting fully homomorphic encryption applications on GPU

    by Shengyu Fan, Xianglong Deng, Xulong Tang, Weizhi Xu, Mingzhe Zhang

    Fully Homomorphic Encryption (FHE) is considered one of the most promising candidates for future privacy computing since it allows to directly compute the encrypted data. Though FHE enables secure computation on untrusted servers, its utilization is limited due to the dramatically increased computation workload and a 4–5 orders of magnitude slowdown ratio. Several previous works have been proposed to accelerate FHE on GPUs, while most of these efforts focus on the algorithm or scheduling and still leave a significant performance gap. However, there is a lack of understanding of the FHE applications from the micro-architecture level, which is important for further optimization of FHE applications or designing hardware accelerators. In this paper, we make a detailed analysis for running FHE on GPUs and present the following key performance bottlenecks at the micro-architecture level: (1) FHE applications require more capacity for the I-cache than other workloads; (2) FHE causes large amount of pipeline stalls due to the Read-After-Write (RAW) issues and significantly hurts the performance due to poor hardware utilization; (3) the capacity of texture cache is severely under-utilized in FHE execution. We propose a simple yet effective pure-hardware scheme for boosting FHE on GPUs based on these observations. Our proposed scheme significantly reduces the RAW-caused pipeline stalls by adding a small forwarding buffer. Besides, our proposed scheme also leverages a partition of the texture cache as the victim buffer for the proposed forwarding buffer to minimize the hardware overheads. We explore various design choices to balance the performance and hardware complexity. The experiment results show that our design improves the performance of the end-to-end FHE workflow by 47.5% with only 0.5% additional hardware overhead.

  • ArborDorp: An Area Efficient CKKS Accelerator

    by Xianglong Deng, Shengyu Fan, Zhicheng Hu, Zhuoyu Tian, Aisen Xie, Liang Chang, Meng Li, Rui Hou, Dan Meng, Mingzhe Zhang

  • CACO: Chiplet-based FHE Acceleration with Inter-Chiplet Communication Optimizations

    by Xianglong Deng, Shengyu Fan, Liang Kong, Yilan Zhu, Geng Yang, Lei Chen, Guang Fan, Yi Chen, Yisong Chang, Jian Weng, et al.

  • Binary Subscript Representation and Efficient Pipelined Number Theoretic Transform

    by Bo Zhang, Mingzhe Zhang, Shoumeng Yan

    As a key operation, the number theoretic transform (NTT) has a significant impact on the performance of emerging cryptosystems, such as fully homomorphic encryption. To better explain NTT algorithms with arbitrary size, radix, order, etc., we introduce the binary subscript representation (BSR), presented by a series of binary strings based on input and output subscripts. By proving bit exchanges of subscripts and the lifespan of twiddle factors, BSR enables a rapid understanding of data flow within each stage and every multiplication, thereby describing how NTT algorithms transform input coefficients into output coefficients. After exploring the design space described by BSR, we propose a pipelined NTT algorithm, possessing the abilities to (i) support NTT and inverse NTT at run-time without internal data rerouting nor external data reordering, (ii) reduce the memory storage of twiddle factors by roughly 50%, (iii) simplify most of the modular multiplications as Shoup modular multiplications, (iv) optimize the modular division over coefficient size N. Later, we implement the algorithm on two pipelined architectures: serial commutator (SC) and multi-path delay commutator (MDC). Along with 212/214 coefficients and 32/64-bit modulus, we totally generate 8 NTT designs. Experimental results demonstrate the advantages of our proposed NTT. For instance, our proposed 212-coefficient 64-bit MDC NTT saves 63.74% area/throughput, compared with state-of-art designs.