Obtaining simulation extractable NIZKs in the updatable CRS model generically

Cites Work

Unnamed Item
Updatable and universal common reference strings with applications to zk-SNARKs
Arya: nearly linear-time zero-knowledge proofs for correct program execution
Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
Short signatures from the Weil pairing
Marlin: preprocessing zkSNARKs with universal and updatable SRS
Selectively linkable group signatures -- stronger security and preserved verifiability
Group signatures and more from isogenies and lattices: generic, simple, and efficient
Subversion-resistant simulation (knowledge) sound NIZKs
Foundations of fully dynamic group signatures
Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Square Span Programs with Applications to Succinct NIZK Arguments
NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Randomizable Proofs and Delegatable Anonymous Credentials
The knowledge complexity of interactive proof-systems
Quadratic Span Programs and Succinct NIZKs without PCPs
Decentralized Anonymous Micropayments
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Public Key Cryptography - PKC 2005
Non-interactive Zaps and New Techniques for NIZK

This page was built for publication: Obtaining simulation extractable NIZKs in the updatable CRS model generically