On subversion-resistant SNARKs
From MaRDI portal
Publication:2039405
DOI10.1007/s00145-021-09379-yzbMath1467.94021OpenAlexW3157112142MaRDI QIDQ2039405
Helger Lipmaa, Janno Siim, Behzad Abdolmaleki, Michał Zając
Publication date: 2 July 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09379-y
common reference stringSNARKnon-interactive zero knowledgegeneric group modelsubversion zero knowledge
Related Items (5)
Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ A Unified Framework for Non-universal SNARKs ⋮ Counting vampires: from univariate sumcheck to updatable ZK-SNARK ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Pairings for cryptographers
- Definitions and properties of zero-knowledge proof systems
- Non-interactive zaps of knowledge
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- The algebraic group model and its applications
- Complexity of a determinate algorithm for the discrete logarithm
- Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- An Algebraic Framework for Diffie-Hellman Assumptions
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Square Span Programs with Applications to Succinct NIZK Arguments
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- A Shuffle Argument Secure in the Generic Model
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- How to Hash into Elliptic Curves
- Resettable zero-knowledge (extended abstract)
- Succinct NP Proofs from an Extractability Assumption
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Quadratic Span Programs and Succinct NIZKs without PCPs
- On QA-NIZK in the BPK Model
- On the existence of extractable one-way functions
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- On the Size of Pairing-Based Non-interactive Arguments
- Non-interactive Zaps and New Techniques for NIZK
- Cryptography and Coding
This page was built for publication: On subversion-resistant SNARKs
