Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
From MaRDI portal
Publication:6157544
Recommendations
Cites work
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- A subversion-resistant SNARK
- Advances in Cryptology - CRYPTO 2003
- An algebraic framework for Diffie-Hellman assumptions
- Definitions and properties of zero-knowledge proof systems
- Get shorty via group signatures without encryption
- How to delegate computations publicly
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- New Techniques for Non-interactive Shuffle and Range Arguments
- Non-interactive Zaps and New Techniques for NIZK
- On QA-NIZK in the BPK model
- On subversion-resistant SNARKs
- On the power of nonuniformity in proofs of security
- On the size of pairing-based non-interactive arguments
- Perfect NIZK with Adaptive Soundness
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Prover-efficient commit-and-prove zero-knowledge SNARKs
- QA-NIZK arguments in asymmetric groups: new tools and new constructions
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-adaptive NIZK for linear subspaces revisited
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Shorter pairing-based arguments under standard assumptions
- Shorter quadratic QA-NIZK proofs
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Somewhere statistically binding commitment schemes with applications
- Square span programs with applications to succinct NIZK arguments
- Subversion-zero-knowledge SNARKs
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
- The algebraic group model and its applications
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Cited in
(6)- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- Impossibilities in succinct arguments: black-box extraction and more
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Adaptively sound zero-knowledge SNARKs for UP
- Adaptive security in SNARGs via iO and lossy functions
- On black-box knowledge-sound commit-and-prove SNARKs
This page was built for publication: Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157544)
