Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG

DOI10.1007/978-3-030-92078-4_2zbMATH Open1514.94114OpenAlexW3216039917MaRDI QIDQ6157544FDOQ6157544

Authors: Helger Lipmaa, Kateryna Pavlyk 

Publication date: 12 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_2

Recommendations

• Separating succinct non-interactive arguments from all falsifiable assumptions
• NIZK from SNARGs
• Tight security bounds for Micali's SNARGs
• The hunting of the SNARK
• Perfect NIZK with Adaptive Soundness

zbMATH Keywords

SNARKSNARGfalsifiable assumptionsGentry-Wichsnon-adaptive soundnessSub-ZK

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Perfect NIZK with Adaptive Soundness
• Advances in Cryptology - CRYPTO 2003
• Definitions and properties of zero-knowledge proof systems
• Non-interactive Zaps and New Techniques for NIZK
• On the power of nonuniformity in proofs of security
• Title not available (Why is that?)
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Short pairing-based non-interactive zero-knowledge arguments
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• An algebraic framework for Diffie-Hellman assumptions
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Quasi-adaptive NIZK for linear subspaces revisited
• How to delegate computations publicly
• The algebraic group model and its applications
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• Somewhere statistically binding commitment schemes with applications
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• On the size of pairing-based non-interactive arguments
• Prover-efficient commit-and-prove zero-knowledge SNARKs
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Square span programs with applications to succinct NIZK arguments
• A subversion-resistant SNARK
• New Techniques for Non-interactive Shuffle and Range Arguments
• Subversion-zero-knowledge SNARKs
• Get shorty via group signatures without encryption
• QA-NIZK arguments in asymmetric groups: new tools and new constructions
• On subversion-resistant SNARKs
• On QA-NIZK in the BPK Model
• Shorter quadratic QA-NIZK proofs
• The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
• Shorter pairing-based arguments under standard assumptions

Cited In (4)

• On black-box knowledge-sound commit-and-prove SNARKs
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Impossibilities in succinct arguments: black-box extraction and more
• On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles

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)