Xianglong Deng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xianglong Deng has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Mingzhe Zhang
Institute of Information Engineering, CAS
8 shared publications - Shengyu Fan
State Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, CAS, China
8 shared publications - Guang Fan
Ant Group, China
5 shared publications - Liang Kong
Ant Group, Beijing, China
4 shared publications - Shoumeng Yan
Ant Group
4 shared publications - Yilan Zhu
Ant Group, China
4 shared publications
Latest Publications
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. PP (02780070) , 1
OmniCifro: A Heterogeneous Acceleration System with PIM for Encrypted Computation
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.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. PP (02780070) , 1
OmniCifro: A Heterogeneous Acceleration System with PIM for Encrypted Computation
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
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 715-731
Falcon: Algorithm-Hardware Co-Design for Efficient Fully Homomorphic Encryption Accelerator
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).
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 715-731
Open AccessFalcon: Algorithm-Hardware Co-Design for Efficient Fully Homomorphic Encryption Accelerator
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
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4094-4108
WPC: Weight Plaintext Compression for CNN Inference based on RNS-CKKS
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4094-4108
Open AccessWPC: Weight Plaintext Compression for CNN Inference based on RNS-CKKS
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1719-1734
HAWK: Fully Homomorphic Encryption Accelerator with Fixed-Word Key Decomposition Switching
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1719-1734
Open AccessHAWK: Fully Homomorphic Encryption Accelerator with Fixed-Word Key Decomposition Switching
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 92-106
FAST:An FHE Accelerator for Scalable-parallelism with Tunable-bit
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 92-106
Open AccessFAST:An FHE Accelerator for Scalable-parallelism with Tunable-bit
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 107-121
Neo: Towards Efficient Fully Homomorphic Encryption Acceleration using Tensor Core
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 107-121
Open AccessNeo: Towards Efficient Fully Homomorphic Encryption Acceleration using Tensor Core