ark-pq: post-quantum zero-knowledge arguments of knowledge

"Preview Talk" (by team ark-pq) @ TCPT3, in reply to the NIST Threshold Call

Abstract: In this talk, we introduce ark-pq, a library for transparent, post-quantum zero-knowledge succinct non-interactive arguments of knowledge (zkSNARKs). ark-pq can prove sensitive claims about threshold cryptographic primitives without exposing sensitive data (e.g., knowledge of a secret key, or the validity of a signature), as well as an extensive range of complex well-formedness conditions. ark-pq is built from two very well-understood primitives: interactive oracle proofs (IOPs) and Merkle tree vector commitments (VCs). ark-pq is designed to be modular and configurable, allowing for the construction of a wide range of zkSNARKs with different trade-offs between proof size, prover time, and verifier time.

Joint work: Alessandro Chiesa, Giacomo Fenzi, Christian Knabenhans, Andrew Zitek-Estrada.

Suggested readings

• Preview Writeup (PDF): ark-pq: post-quantum zero-knowledge arguments of knowledge
• arkworks: zkSNARK ecosystem (repo).
• Interactive Oracle Proofs (ia.cr/2016/116).