BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes

Succinct Arguments over Towers of Binary Fields

Concrete Security for Succinct Arguments from Vector Commitments

On Parallel Repetition of PCPs

Malleable Commitments from Group Actions and Zero-Knowledge Proofs for Circuits based on Isogenies

On Quantum Simulation-Soundness

BabySpartan: Lasso-based SNARK for non-uniform computation

Succinct Arguments over Towers of Binary Fields

ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge

An efficient quantum parallel repetition theorem and applications

Dora: Processor Expressiveness is (Nearly) Free in Zero-Knowledge for RAM Programs

Non-Interactive Zero-Knowledge Functional Proofs

bls-s/paper.pdf at main · asanso/bls-s