Jul 2026· IEEE International Symposium on High-Performance Parallel Distributed Computing· pp. 564-566· 0 citations· 5 references
Computer Science
TL;DR
This work proposes a series of optimizations for these two kernels, including computation-transfer pipelining, load balancing, and memory access fusion, achieving 1.97 × to 2.16 × proof generation speedup over a state-of-the-art open source GPU acceleration library.
Abstract
Zero-knowledge succinct non-interactive arguments of knowledge (zkSNARKs) are a key technology to privacy-preserving applications today. The complexity of proof generation, however, heavily constrains throughput in latency-sensitive environments. The computational burden primarily stems from two fundamental algorithms: Multi-Scalar Multiplication (MSM) and the Number Theoretic Transform (NTT). We propose a series of optimizations for these two kernels, including computation-transfer pipelining, load balancing, and memory access fusion, achieving 1.97 × to 2.16 × proof generation speedup over a state-of-the-art open source GPU acceleration library. Our design also supports out-of-core computation, enabling the generation of large-scale ZKP proofs.
This work proposes FASTAR, a novel FPGA-based accelerator for the FRI protocol, which is implemented with High-Level Synthesis (HLS) and composed of fully parameterizable building blocks for the major stages of FRI, including polynomial evaluation, recursive split-and-fold, and Merkle-tree construction.
This work presents a hardware-oriented design for accelerating the Monolith hash function on FPGA and proposes a dual-architecture framework consisting of a serial architecture and a parallel architecture to address different performance and resource constraints.
Cheng Chen, Gang-Qiang Yang, Hong-Chao Zhou et al.· ACM Transactions on Reconfig...· 0 citations
This work proposes a unified framework to efficiently support Number Theoretic Transform (NTT) workloads in both FHE and ZKP, and designs limb-wise 256-bit arithmetic to efficiently support ZKP workloads using RVV.
Yi-Lin Dong, Zhan-Sheng Ye, Zheng-Yi Zhao et al.· IACR Transactions on Cryptog...· 0 citations
This work presents the first high-throughput GPU implementation and evaluation of MAYO, covering Keygen, Signing, and Verification, and introduces a data reuse-aware computation model for matrix-dominated and memory-access-bound workloads, and proposes Reuse Matrix Multiplication Evaluation (RMME) to reduce redundant g...
Hao-Yang Chen, Jun-Hao Huang, Shu-Tong Jin et al.· IACR Transactions on Cryptog...· 0 citations
To study QOS on current quantum computing devices, an offline realization is developed that compiles sample blocks into empirical phase oracles and evaluates it using DNA fingerprinting.
Experiments on five real-world pixel-level image processing tasks show that PixCrypt significantly improves the practicality of FHE for privacy-preserving analytics, yielding up to 35x faster fine-grained encryption and maintains IND-CPA (Indistinguishability under Chosen Plaintext Attack) security.
Chao Wang, Shu-Bing Yang, Xiao-Yan Sun et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
