Impossibilities in succinct arguments: black-box extraction and more

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the complexity of interactive proofs with bounded communication
Minimum disclosure proofs of knowledge
Marlin: preprocessing zkSNARKs with universal and updatable SRS
Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
An algebraic framework for universal and updatable SNARKs
Composition with knowledge assumptions
Another look at extraction and randomization of Groth's zk-SNARK
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
On Continual Leakage of Discrete Log Representations
Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
Scalable Zero Knowledge via Cycles of Elliptic Curves
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Quasi-Adaptive NIZK for Linear Subspaces Revisited
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
A Pseudorandom Generator from any One-way Function
Succinct Malleable NIZKs and an Application to Compact Shuffles
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
Quadratic Span Programs and Succinct NIZKs without PCPs
Succinct delegation for low-space non-deterministic computation
How to use indistinguishability obfuscation
Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
Separating succinct non-interactive arguments from all falsifiable assumptions
Advances in Cryptology - CRYPTO 2003
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Automata, Languages and Programming
On the Size of Pairing-Based Non-interactive Arguments
Indistinguishability obfuscation from well-founded assumptions
\(\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

This page was built for publication: Impossibilities in succinct arguments: black-box extraction and more