Aztec Research

Class-leading zero knowledge cryptography that powers the rest of the industry.

Latest resources

Stay informed with cutting-edge knowledge and insights that push the boundaries of blockchain privacy.

Research Papers

Plonk

We present a universal SNARK construction with fully succinct verification, and significantly lower prover running time. Authored by Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru.

Research paper
Year
2019
CITATIONS
539
PLONK RESOURCES

TURBO-PLONK

We present the Turbo-PLONK program syntax, a framework to capture more general and flexible constraints for specifying SNARK programs. Authored by Ariel Gabizon, and Zachary J. Williamson.

Research paper
Year
2020
CITATIONS
6

SHPLONK

We present an enhanced version of the Kate, Zaverucha and Goldberg polynomial commitment scheme, and a second scheme where the proof consists of two group elements and the verifier complexity is better than previously known batched verification methods for [KZG]. Authored by: Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon.

Research paper
Year
2020
CITATIONS
61

HALO INFINITE

Efficient polynomial commitment schemes for multiple points and polynomials. Authored by: Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon

Research paper
Year
2020
CITATIONS
47

ZEROMORPH

This paper introduces a new scheme to commit to multilinear polynomials and to later prove evaluations thereof. The scheme exponentially improves on the added prover costs for evaluation proofs to be zero-knowledge. Authored by: Tohru Kohrita, and Patrick Towa.

Research paper
Year
2023
CITATIONS
9
ZEROMORPH RESOURCES

The Aztec Protocol

The Anonymous Zero-knowledge Transactions with Efficient Communication (AZTEC) protocol describes a set of zero-knowledge proofs that define a confidential transaction protocol, designed for use within blockchain protocols that support Turing-complete general-purpose computation.

Research paper
Year
2018
CITATIONS
39
THE AZTEC PROTOCOL RESOURCES