PipeZK: Accelerating Zero-Knowledge Proof with a Pipelined Architecture
Authors:
- 1 June 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 416-428
Abstract
Zero-knowledge proof (ZKP) is a promising cryptographic protocol for both computation integrity and privacy. It can be used in many privacy-preserving applications including verifiable cloud outsourcing and blockchains. The major obstacle of using ZKP in practice is its time-consuming step for proof generation, which consists of large-size polynomial computations and multi-scalar multiplications on elliptic curves. To efficiently and practically support ZKP in real-world applications, we propose PipeZK, a pipelined accelerator with two subsystems to handle the aforementioned two intensive compute tasks, respectively. The first subsystem uses a novel dataflow to decompose large kernels into smaller ones that execute on bandwidth-efficient hardware modules, with optimized off-chip memory accesses and on-chip compute resources. The second subsystem adopts a lightweight dynamic work dispatch mechanism to share the heavy processing units, with minimized resource underutilization and load imbalance. When evaluated in 28 nm, PipeZK can achieve 10x speedup on standard cryptographic benchmarks, and 5x on a widely-used cryptocurrency application, Zcash.Keywords
Funding Information
- National Natural Science Foundation of China
This publication has 29 references indexed in Scilit:
- Quadratic Span Programs and Succinct NIZKs without PCPs2013
- Co- $Z$ ECC scalar multiplications for hardware, software and hardware–software co-design on embedded systemsJournal of Cryptographic Engineering, 2012
- Elliptic Curve Cryptography2011
- On Ideal Lattices and Learning with Errors over Rings2010
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers2010
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware2001
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985