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

(83)

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

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)