Home > Resources > papers > XZZPS19-Libra

Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (Xie, Zhang, Zhang, Papamanthou, Song 2019)

Last modified: 2026-10-27

DOI: 10.1007/978-3-030-26954-8_24 · URL: https://eprint.iacr.org/2019/317

Summary

Presents Libra, the first ZKP system with both an optimal linear-time prover and succinct proof size and verification time for log-space uniform layered circuits. It gives a linear-time GKR prover algorithm for arbitrary circuits and a cheap zero-knowledge transformation of GKR via small masking polynomials, combined with a zero-knowledge polynomial commitment (one-time trusted setup). Libra demonstrates that GKR-based provers can be among the fastest in practice. (CRYPTO 2019.)

Used by

• Libra

Related resources

• Algebraic Methods for Interactive Proof Systems (paper, 1992)
• Delegating Computation: Interactive Proofs for Muggles (Goldwasser, Kalai, Rothblum 2008) (paper, 2008)
• Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)