Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments

Recommendations

Short pairing-based non-interactive zero-knowledge arguments
Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
On the size of pairing-based non-interactive arguments
Shorter pairing-based arguments under standard assumptions

Cited in

(80)

Counting vampires: from univariate sumcheck to updatable ZK-SNARK
Homomorphic secret sharing with verifiable evaluation
A unified framework for non-universal SNARKs
Additive combinatorics: with a view towards computer science and cryptography -- an exposition
A simple and efficient framework of proof systems for NP
On black-box knowledge-sound commit-and-prove SNARKs
Sigma protocols from verifiable secret sharing and their applications
On security proofs of existing equivalence class signature schemes
Delegating RAM Computations
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
No-signaling linear PCPs
Snarky ceremonies
From polynomial IOP and commitments to non-malleable zkSNARKs
A shuffle argument secure in the generic model
How to build time-lock encryption
Algebraic group model with oblivious sampling
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
Election control through social influence with unknown preferences
Succinct non-interactive arguments via linear interactive proofs
Compact NIZKs from standard assumptions on bilinear maps
Lattice-based SNARGs and their application to more efficient obfuscation
scientific article; zbMATH DE number 7746256 (Why is no real title available?)
Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
Natively compatible super-efficient lookup arguments and how to apply them
CRS-updatable asymmetric quasi-adaptive NIZK arguments
Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
Arguments of proximity (extended abstract)
Rinocchio: SNARKs for ring arithmetic
Unconditionally secure NIZK in the fine-grained setting
\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
On the (in)security of SNARKs in the presence of oracles
The wonderful world of global random oracles
What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
\(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
On QA-NIZK in the BPK model
On subversion-resistant SNARKs
Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
Pairing-based batch arguments for NP with a linear-size CRS
Impossibilities in succinct arguments: black-box extraction and more
\textsf{Orbweaver}: succinct linear functional commitments from lattices
Non-interactive publicly-verifiable delegation of committed programs
Plonk is simulation extractable in ROM under falsifiable assumptions
Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
Interactive oracle proofs
Correlation intractability and SNARGs from sub-exponential DDH
Computational integrity with a public random string from quasi-linear PCPs
Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
Succinct verification of compressed sigma protocols in the updatable SRS setting
Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
SNARGs for P from sub-exponential DDH and QR
Optimally sound sigma protocols under DCRA
Compact designated verifier NIZKs from the CDH assumption without pairings
\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Compact NIZKs from standard assumptions on bilinear maps
On knowledge-soundness of Plonk in ROM from falsifiable assumptions
No-signaling linear PCPs
Spartan: efficient and general-purpose zkSNARKs without trusted setup
Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
Constant-size zk-SNARKs in ROM from falsifiable assumptions
Verifiable registration-based encryption
Constant-round interactive proofs for delegating computation
Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
Shorter arithmetization of nondeterministic computations
Scalable zero knowledge via cycles of elliptic curves
Multikey fully homomorphic encryption and applications
A generic approach to adaptively-secure broadcast encryption in the plain model
Efficient NIZK arguments via parallel verification of Beneš networks
Somewhere statistically binding commitment schemes with applications
The hunting of the SNARK
Polymath: Groth16 is not the limit
Succinct functional commitment for a large class of arithmetic circuits
On the existence of extractable one-way functions
Zero-Knowledge Accumulators and Set Algebra
Marlin: preprocessing zkSNARKs with universal and updatable SRS
A classification of computational assumptions in the algebraic group model
On succinct arguments and witness encryption from groups

This page was built for publication: Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891482)