Qiang-Sheng Hua
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Qiang-Sheng Hua has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- Hai Jin
Huazhong University of Science and Technology
18 shared publications Hai Jin
School of Computer Science and Technology, Huazhong University of Science and Technology
9 shared publications- Dongxiao Yu
Shandong University
8 shared publications - Xuanhua Shi
Huazhong University of Science and Technology
4 shared publications - Jiguo Yu
University of Electronic Science and Technology of China
3 shared publications - Xiaofei Liao
Huazhong University of Science and Technology
3 shared publications
Latest Publications
- Open Access
- 18 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 24 (1) , 1-25
LightZK: An Efficient GPU Acceleration Framework for Large-Scale Zero-Knowledge Proofs
Zero-Knowledge Proofs (ZKPs), particularly zk-SNARKs, have become a cornerstone for privacy-preserving protocols and blockchain scalability. However, the generation of proofs remains computationally prohibitive due to the immense overhead of underlying cryptographic primitives, namely Multi-Scalar Multiplication (MSM) and Fast Number Theoretic Transform (NTT). As applications scale up to billion-scale constraints, conventional GPU-accelerated frameworks tailored for smaller instances suffer from overwhelming memory usage, invalid architectural assumptions, and suboptimal end-to-end orchestration. Driven by the motivation to complete massive proof generation on a single memory-constrained node, this article presents LightZK, an efficient GPU acceleration framework for large-scale zero-knowledge proofs based on a tile-based execution model. LightZK not only aims to support ultra-large-scale ZKP generation, but also strives to improve the practical performance of proof generation. LightZK contributes a micro-architectural diagnosis of MSM on GPUs: hardware performance counters expose the register-pressure and low instruction-level-parallelism mismatches that under-utilize the GPU during bucket-merge computation, and targeted kernel optimizations derived from this diagnosis yield a 1.5×–2.5× MSM speedup over the SOTA baseline. LightZK further makes large-scale NTT executable where the SOTA GPU baseline fails, via storage and structural optimizations that deliver nontrivial acceleration (2.2×–2.5× over a functional baseline). At the systemic level, LightZK builds on a data-dependency graph (DDG) analysis of the Groth16 proving flow to drive a three-tier pipeline orchestration: a hand-crafted DRAM-VRAM pipeline for Poly-phase that overlaps sparse matrix operations with data transfer, and a producer-consumer disk-DRAM-VRAM pipeline for Group-phase that treats each MSM tile as an independently schedulable unit. Experimental results demonstrate that LightZK achieves a 2.8× end-to-end performance improvement over the leading executable GPU baseline at standard scales. Crucially, while existing GPU frameworks exceed available memory at billion-scale, LightZK successfully sustains 2 30 -scale proof generation with near-linear scalability on a single node.
- 18 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 24 (1) , 1-25
Open AccessLightZK: An Efficient GPU Acceleration Framework for Large-Scale Zero-Knowledge Proofs
Zero-Knowledge Proofs (ZKPs), particularly zk-SNARKs, have become a cornerstone for privacy-preserving protocols and blockchain scalability. However, the generation of proofs remains computationally prohibitive due to the immense overhead of underlying cryptographic primitives, namely Multi-Scalar Multiplication (MSM) and Fast Number Theoretic Transform (NTT). As applications scale up to billion-scale constraints, conventional GPU-accelerated frameworks tailored for smaller instances suffer from overwhelming memory usage, invalid architectural assumptions, and suboptimal end-to-end orchestration. Driven by the motivation to complete massive proof generation on a single memory-constrained node, this article presents LightZK, an efficient GPU acceleration framework for large-scale zero-knowledge proofs based on a tile-based execution model. LightZK not only aims to support ultra-large-scale ZKP generation, but also strives to improve the practical performance of proof generation. LightZK contributes a micro-architectural diagnosis of MSM on GPUs: hardware performance counters expose the register-pressure and low instruction-level-parallelism mismatches that under-utilize the GPU during bucket-merge computation, and targeted kernel optimizations derived from this diagnosis yield a 1.5×–2.5× MSM speedup over the SOTA baseline. LightZK further makes large-scale NTT executable where the SOTA GPU baseline fails, via storage and structural optimizations that deliver nontrivial acceleration (2.2×–2.5× over a functional baseline). At the systemic level, LightZK builds on a data-dependency graph (DDG) analysis of the Groth16 proving flow to drive a three-tier pipeline orchestration: a hand-crafted DRAM-VRAM pipeline for Poly-phase that overlaps sparse matrix operations with data transfer, and a producer-consumer disk-DRAM-VRAM pipeline for Group-phase that treats each MSM tile as an independently schedulable unit. Experimental results demonstrate that LightZK achieves a 2.8× end-to-end performance improvement over the leading executable GPU baseline at standard scales. Crucially, while existing GPU frameworks exceed available memory at billion-scale, LightZK successfully sustains 2 30 -scale proof generation with near-linear scalability on a single node.
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 270-285
HybridFaaS: Efficient GPU Serverless via Hybrid Autoscaling
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 270-285
Open AccessHybridFaaS: Efficient GPU Serverless via Hybrid Autoscaling
- 16 November 2025
- Published by Springer Nature
- p. 116-128
Incremental Distributed Algorithms for Game-Theoretic Betweenness Centralities in Dynamic Graphs
- 16 November 2025
- Published by Springer Nature
- p. 116-128
Incremental Distributed Algorithms for Game-Theoretic Betweenness Centralities in Dynamic Graphs
- 2 September 2025
- Published by Springer Nature in CCF Transactions on High Performance Computing
- Vol. 7 (6) , 479-493
A parallel all-pairs shortest paths algorithm for dynamic graphs
- 2 September 2025
- Published by Springer Nature in CCF Transactions on High Performance Computing
- Vol. 7 (6) , 479-493
A parallel all-pairs shortest paths algorithm for dynamic graphs
- 3 August 2025
- Published by Springer Nature
- p. 110-124
Massively Parallel Approximate Steiner Tree Algorithms
- 3 August 2025
- Published by Springer Nature
- p. 110-124
Massively Parallel Approximate Steiner Tree Algorithms
- 1 May 2025
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 40 (3) , 835-854
Joint-Communication Optimal Matrix Multiplication with Asymmetric Memories
- 1 May 2025
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 40 (3) , 835-854
Joint-Communication Optimal Matrix Multiplication with Asymmetric Memories
- 20 February 2025
- Published by Springer Nature
- p. 538-550
Parallel Truss Maintenance Algorithms for Dynamic Hypergraphs
- 20 February 2025
- Published by Springer Nature
- p. 538-550
Parallel Truss Maintenance Algorithms for Dynamic Hypergraphs
- Open Access
- 28 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (4) , 645-658
FHE4DMM: A Low-Latency Distributed Matrix Multiplication With Fully Homomorphic Encryption
Fully Homomorphic Encryption (FHE) is a promising technology for secure, non-interactive outsourced computation. One notable method to increase the throughput of FHE-based outsourcing is batching, which typically involves large-scale matrix-matrix multiplications (MM). However, the substantial overhead inherent in existing FHE schemes poses a major challenge for processing these large-scale tasks, often resulting in insufficient memory or prolonged delays on a single machine, making it practically unviable. Utilizing multi-machine parallelism in cloud clusters for outsourced computation offers a natural solution to these obstacles. In this work, we propose FHE4DMM, a distributed algorithm that provides a unified view on encrypted matrices, accommodating various FHE schemes and any matrix dimensions, to accelerate large-scale encrypted MM. A key innovation is its reuse optimizations for parallelized homomorphic computations, which can offer valuable insights for broader FHE-based applications. We utilized FHE4DMM to conduct large-scale square ($4096\times 4096$ ) and rectangular ($32768\times 32768,32768\times 16$ ) matrix multiplications on 256 machines, achieving computation time of 172.2 s and 76.1 s, respectively, while ensuring a 128-bit security level. For scalability, the experiments demonstrate that FHE4DMM achieves linear speedup for$2^{i}$ ($i$ is from 0 to 6) machines across various matrix dimension cases. In addition, within the range of matrix dimensions that the state-of-the-art (SOTA) distributed FHE-MM algorithm (Huang et al. 2023) can handle, FHE4DMM attains a maximum speedup of 16.62x. To assess its practical performance, FHE4DMM is applied in a basic multi-layer feedforward network. We used 64 machines to perform secure outsourced inference on MNIST and CIFAR-10 datasets with encrypted models and data. Compared to using the SOTA, our method achieved speedups of up to 3.54x and 4.22x respectively, with the MM module obtaining a 4.09x and 4.87x speedup.- 28 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (4) , 645-658
Open AccessFHE4DMM: A Low-Latency Distributed Matrix Multiplication With Fully Homomorphic Encryption
Fully Homomorphic Encryption (FHE) is a promising technology for secure, non-interactive outsourced computation. One notable method to increase the throughput of FHE-based outsourcing is batching, which typically involves large-scale matrix-matrix multiplications (MM). However, the substantial overhead inherent in existing FHE schemes poses a major challenge for processing these large-scale tasks, often resulting in insufficient memory or prolonged delays on a single machine, making it practically unviable. Utilizing multi-machine parallelism in cloud clusters for outsourced computation offers a natural solution to these obstacles. In this work, we propose FHE4DMM, a distributed algorithm that provides a unified view on encrypted matrices, accommodating various FHE schemes and any matrix dimensions, to accelerate large-scale encrypted MM. A key innovation is its reuse optimizations for parallelized homomorphic computations, which can offer valuable insights for broader FHE-based applications. We utilized FHE4DMM to conduct large-scale square ($4096\times 4096$ ) and rectangular ($32768\times 32768,32768\times 16$ ) matrix multiplications on 256 machines, achieving computation time of 172.2 s and 76.1 s, respectively, while ensuring a 128-bit security level. For scalability, the experiments demonstrate that FHE4DMM achieves linear speedup for$2^{i}$ ($i$ is from 0 to 6) machines across various matrix dimension cases. In addition, within the range of matrix dimensions that the state-of-the-art (SOTA) distributed FHE-MM algorithm (Huang et al. 2023) can handle, FHE4DMM attains a maximum speedup of 16.62x. To assess its practical performance, FHE4DMM is applied in a basic multi-layer feedforward network. We used 64 machines to perform secure outsourced inference on MNIST and CIFAR-10 datasets with encrypted models and data. Compared to using the SOTA, our method achieved speedups of up to 3.54x and 4.22x respectively, with the MM module obtaining a 4.09x and 4.87x speedup. - 8 April 2024
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 18 (4) , 1-3
Massively parallel algorithms for fully dynamic all-pairs shortest paths
- 8 April 2024
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 18 (4) , 1-3
Massively parallel algorithms for fully dynamic all-pairs shortest paths
- 12 January 2024
- Published by Springer Nature
- p. 249-269
Secure Outsourced Matrix Multiplication with Fully Homomorphic Encryption
- 12 January 2024
- Published by Springer Nature
- p. 249-269
Secure Outsourced Matrix Multiplication with Fully Homomorphic Encryption