NIZK from SNARGs - MaRDI portal

Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Leakage-resilient cryptography from minimal assumptions
Bit commitment using pseudorandomness
Definitions and properties of zero-knowledge proof systems
Certifying trapdoor permutations, revisited
Fiat-Shamir and correlation intractability from strong KDM-secure encryption
Quasi-optimal SNARGs via linear multi-prover interactive proofs
Verifiable delay functions
From obfuscation to the security of Fiat-Shamir for proofs
The hunting of the SNARK
Transparent SNARKs from DARK compilers
SPARKs: succinct parallelizable arguments of knowledge
Marlin: preprocessing zkSNARKs with universal and updatable SRS
\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
NIZK from SNARG
Targeted lossy functions and applications
Succinct arguments in the quantum random oracle model
Noninteractive zero knowledge for NP from (Plain) Learning With Errors
Reusable designated-verifier NIZKs for all NP from CDH
Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
Exploring constructions of compact NIZKs from various assumptions
Enhancements of trapdoor permutations
A forward-secure public-key encryption scheme
Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier
Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Efficient Public-Key Cryptography in the Presence of Key Leakage
Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
Signature Schemes with Bounded Leakage Resilience
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Group Signatures
A Pseudorandom Generator from any One-way Function
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
Nonmalleable Cryptography
Computationally Sound Proofs
Succinct Non-interactive Arguments via Linear Interactive Proofs
Quadratic Span Programs and Succinct NIZKs without PCPs
Fiat-Shamir: from practice to theory
How to use indistinguishability obfuscation
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
New Techniques for Noninteractive Zero-Knowledge
Separating succinct non-interactive arguments from all falsifiable assumptions
Advances in Cryptology - CRYPTO 2003
Zaps and Their Applications
Unconditional Characterizations of Non-interactive Zero-Knowledge
On the Size of Pairing-Based Non-interactive Arguments
Theory of Cryptography
Multi-theorem preprocessing NIZKs from lattices

This page was built for publication: NIZK from SNARGs