Subversion-zero-knowledge SNARKs
From MaRDI portal
Publication:1749286
DOI10.1007/978-3-319-76578-5_11zbMATH Open1385.94036OpenAlexW2725135237MaRDI QIDQ1749286FDOQ1749286
Authors: Georg Fuchsbauer 
Publication date: 16 May 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-76578-5_11
Recommendations
Cited In (32)
- A unified framework for non-universal SNARKs
- On black-box knowledge-sound commit-and-prove SNARKs
- Updatable NIZKs from non-interactive zaps
- An algebraic framework for universal and updatable SNARKs
- Simulation Extractable Versions of Groth’s zk-SNARK Revisited
- Snarky ceremonies
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Onion routing with replies
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Smooth zero-knowledge hash functions
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- On the efficiency of privacy-preserving smart contract systems
- \(\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
- On QA-NIZK in the BPK model
- On subversion-resistant SNARKs
- Benchmarking the setup of updatable zk-SNARKs
- Subversion-resilient public key encryption with practical watchdogs
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Towards accountability in CRS generation
- Concurrently secure blind Schnorr signatures
- Witness semantic security
- Mining for privacy: how to bootstrap a snarky blockchain
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
- Pairing-free blind signatures from standard assumptions in the ROM
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Polymath: Groth16 is not the limit
- Succinct functional commitment for a large class of arithmetic circuits
- A subversion-resistant SNARK
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
This page was built for publication: Subversion-zero-knowledge SNARKs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749286)
